We consider the problem of approximating a set P of n points in Rd by a collection of j-dimensional flats, and extensions thereof, under the standard median / mean / center measur...
—This paper develops a framework for locally deforming either a parametric surface or hierarchical subdivision surface to match a set of positional and energy minimizing constrai...
Abstract. We consider the problem of approximating the average distance between pairs of points in a high-dimensional Euclidean space, and more generally in any metric space. We co...
Let S be a set of points in the plane in general position. A triangulation of S will be called even if all the points of S have an even degree. We show how to construct a triangul...
We initiate an investigation of sublinear algorithms for geometric problems in two and three dimensions. We give optimal algorithms for intersection detection of convex polygons a...