COMPGEOM
2000
ACM
13 years 8 months ago
2000
ACM
COMPGEOM
2000
ACM
13 years 8 months ago
2000
ACM
COMPGEOM
2000
ACM
13 years 8 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...
COMPGEOM
2000
ACM
13 years 9 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...
COMPGEOM
2000
ACM
13 years 9 months ago
2000
ACM
COMPGEOM
2000
ACM
13 years 9 months ago
2000
ACM
COMPGEOM
2000
ACM
13 years 9 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...
COMPGEOM
2000
ACM
13 years 9 months ago
2000
ACM
COMPGEOM
2000
ACM
13 years 9 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...
COMPGEOM
2000
ACM
13 years 9 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...