activity
19982002
most citedOptimal Point Placement for Mesh Smoothing

71 citations · 219 across the 12 of their papers we have counts for

collaborators

12 papers

cs.CG2002

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…

cs.CG2002

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…

cs.CG2001★ 56 cited

Flipping Cubical Meshes

Marshall Bern, David Eppstein, Jeff Erickson

We define and examine flip operations for quadrilateral and hexahedral meshes, similar to the flipping transformations previously used in triangular and tetrahedral mesh generation…

cs.CG2001★ 5 cited

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…

cs.CG2001

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…

cs.CG2000★ 1 cited

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…