6 search results - page 1 / 2 » Efficiently Approximating Polygonal Paths in Three and Highe... |
COMPGEOM
1998
ACM
14 years 2 months ago
1998
ACM
SODA
1992
ACM
14 years 2 days ago
1992
ACM
Given a family of disjoint polygons P1, P2, : : :, Pk in the plane, and an integer parameter m, it is NP-complete to decide if the Pi's can be pairwise separated by a polygon...
COMPGEOM
2000
ACM
14 years 3 months ago
2000
ACM
: We present a new approach for computing generalized Voronoi diagrams in two and three dimensions using interpolation-based polygon rasterization hardware. The input primitives ma...
STOC
2003
ACM
14 years 11 months ago
2003
ACM
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...
COMPGEOM
2008
ACM
14 years 21 days ago
2008
ACM
We consider the problem of finding a maximum number of disjoint paths for unit disks moving amidst static or dynamic obstacles. For the static case we give efficient exact algorit...