138 search results - page 22 / 28 » K-Guarding Polygons on the Plane |
APVIS
2006
13 years 9 months ago
2006
In this paper, we present a method for simplification of arbitrary 3D meshes that is based on Isotropic Quantization of face-normal vectors. There are three stages. Firstly, a cod...
STACS
1990
Springer
13 years 11 months ago
1990
Springer
We consider the problem of approximating a convex gure in the plane by a pair (r; R) of homothetic (that is, similar and parallel) rectangles with r C R. We show the existenc...
COMPGEOM
2005
ACM
13 years 9 months ago
2005
ACM
We consider the existence and efficient construction of bounded curvature paths traversing constant-width regions of the plane, called corridors. We make explicit a width threshol...
CCCG
2003
13 years 9 months ago
2003
We consider the problem of finding the shortest curve in the plane that has unit width. This problem was first posed as the “river shore” puzzle by Ogilvy (1972) and is rela...
COMPGEOM
2005
ACM
13 years 9 months ago
2005
ACM
We introduce a new type of diagram called the VV(c)-diagram (the visibility–Voronoi diagram for clearance c), which is a hybrid between the visibility graph and the Voronoi diag...