144
Voted
COMPGEOM
2000
ACM
15 years 10 months ago
2000
ACM
140
Voted
COMPGEOM
2000
ACM
15 years 10 months ago
2000
ACM
182
Voted
COMPGEOM
2000
ACM
15 years 10 months ago
2000
ACM
The purpose of this paper is to present a new method to design exact geometric predicates in algorithms dealing with curved objects such as circular arcs. We focus on the comparis...
176
Voted
COMPGEOM
2000
ACM
15 years 11 months ago
2000
ACM
We present fast implementations of a hybrid algorithm for reporting box and cube intersections. Our algorithm initially takes a divide-and-conquer approach and switches to simpler...
164
Voted
COMPGEOM
2000
ACM
15 years 11 months ago
2000
ACM
154
Voted
COMPGEOM
2000
ACM
15 years 11 months ago
2000
ACM
205
Voted
COMPGEOM
2000
ACM
15 years 11 months ago
2000
ACM
For a sufficiently dense set of points in any closed Riemannian manifold, we prove that a unique Delannay triangulation exists. This triangulation has the same properties as in Eu...
130
Voted
COMPGEOM
2000
ACM
15 years 11 months ago
2000
ACM
204
Voted
COMPGEOM
2000
ACM
15 years 11 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...
190
Voted
COMPGEOM
2000
ACM
15 years 11 months ago
2000
ACM
We present an (1+ε)-approximation algorithm for computing the minimum-spanning tree of points in a planar arrangement of lines, where the metric is the number of crossings betwee...