8 papers · 1 filter
Optimized Color Gamuts for Tiled Displays
Marshall Bern, David Eppstein
We consider the problem of finding a large color space that can be generated by all units in multi-projector tiled display systems. Viewing the problem geometrically as one of find…
Moebius-Invariant Natural Neighbor Interpolation
Marshall Bern, David Eppstein
We propose an interpolation method that is invariant under Moebius transformations; that is, interpolation followed by transformation gives the same result as transformation follow…
Optimization Over Zonotopes and Training Support Vector Machines
Marshall Bern, David Eppstein
We make a connection between classical polytopes called zonotopes and Support Vector Machine (SVM) classifiers. We combine this connection with the ellipsoid method to give some ne…
Optimal Moebius Transformations for Information Visualization and Meshing
Marshall Bern, David Eppstein
We give linear-time quasiconvex programming algorithms for finding a Moebius transformation of a set of spheres in a unit ball or on the surface of a unit sphere that maximizes the…
Computing the Depth of a Flat
Marshall Bern, David Eppstein
We give algorithms for computing the regression depth of a k-flat for a set of n points in R^d. The running time is O(n^(d-2) + n log n) when 0 < k < d-1, faster than the best time…
Emerging Challenges in Computational Topology
Marshall Bern, David Eppstein, Pankaj K. Agarwal +19
Here we present the results of the NSF-funded Workshop on Computational Topology, which met on June 11 and 12 in Miami Beach, Florida. This report identifies important problems inv…