16 search results - page 3 / 4 » compgeom 1998 |
121
Voted
COMPGEOM
1998
ACM
15 years 7 months ago
1998
ACM
We discuss floating-point filters as a means of restricting the precision needed for arithmetic operations while still computing the exact result. We show that interval techniques...
115
click to vote
COMPGEOM
1997
ACM
15 years 7 months ago
1997
ACM
An effective and fast algorithm is given for rotational overlap minimization: given an overlapping layout of polygons P1, P2, P3, . . . , Pk in a container polygon Q, translate an...
148
Voted
COMPGEOM
1998
ACM
15 years 7 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...
125
Voted
COMPGEOM
1998
ACM
15 years 7 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...
129
Voted
COMPGEOM
1998
ACM
15 years 7 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...