37 search results - page 6 / 8 » compgeom 2007 |
COMPGEOM
2007
ACM
13 years 10 months ago
2007
ACM
We illustrate a simple algorithm for approximating the medial axis of a 2D shape with smooth boundary from a sample of this boundary. The algorithm is compared to a more general a...
COMPGEOM
2007
ACM
13 years 10 months ago
2007
ACM
In this paper we show that dimensionality reduction (i.e., Johnson-Lindenstrauss lemma) preserves not only the distances between static points, but also between moving points, and...
COMPGEOM
2007
ACM
13 years 10 months ago
2007
ACM
We prove an optimal generalization of the centerpoint theorem: given a set P of n points in the plane, there exist two points (not necessarily among input points) that hit all con...
COMPGEOM
2007
ACM
13 years 10 months ago
2007
ACM
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...
COMPGEOM
2007
ACM
13 years 10 months ago
2007
ACM
We show how to embed a 3-connected planar graph with n vertices as a 3-polytope with small integer coordinates. The coordinates are bounded by O(27.55n ). The crucial part is the ...