947 search results - page 113 / 190 » Discrete Geometry |
COMPGEOM
1998
ACM
15 years 2 months ago
1998
ACM
Computing the visibility of out-door scenes is often much harder than of in-door scenes. A typical urban scene, for example, is densely occluded, and it is effective to precompute...
COMPGEOM
1998
ACM
15 years 2 months ago
1998
ACM
We present a new technique for constructing a data-structure that approximates shortest path maps in IRd . By applying this technique, we get the following two results on approxim...
COMPGEOM
1998
ACM
15 years 2 months ago
1998
ACM
An algorithm and a robust floating point implementation is given for rotational polygon containment: given polygons P1,P2,P3,...,Pk and a container polygon C, find rotations and...
JCDCG
1998
Springer
15 years 2 months ago
1998
Springer
We study the minimum number g(m, n) (respectively, p(m, n)) of pieces needed to dissect a regular m-gon into a regular n-gon of the same area using glass-cuts (respectively, polygo...
COMPGEOM
1997
ACM
15 years 2 months ago
1997
ACM
We describe the first known algorithm for efficiently maintaining a Binary Space Partition (BSP) for n continuously moving segments in the plane, whose interiors remain disjoint...