39 search results - page 2 / 8 » cccg 2006 |
CCCG
2006
13 years 6 months ago
2006
We present a new normal form for bounded-curvature paths that admits a combinatorial discription of such paths and a bound on the algebraic complexity of the underlying geometry.
CCCG
2006
13 years 6 months ago
2006
We study the relationship between the interior angles of a convex polygon and the lengths of external watchman routes.
CCCG
2006
13 years 6 months ago
2006
We analyze an extremely simple approximation algorithm for computing the minimum enclosing ball (or the 1-center) of a set of points in high dimensions. We prove that this algorit...
CCCG
2006
13 years 6 months ago
2006
We present a generalization of Welzl's smallest enclosing disk algorithm [E. Welzl, Smallest enclosing disks (balls and ellipsoids), in: New Results and New Trends in Compute...
CCCG
2006
13 years 6 months ago
2006
We present a polynomial time algorithm for the unit disk covering problem with an approximation factor 72, and show that this is the best possible approximation factor based on th...