Sciweavers

COMPGEOM
2000
ACM
14 years 1 months ago
Point set labeling with specified positions
Srinivas Doddi, Madhav V. Marathe, Bernard M. E. M...
COMPGEOM
2000
ACM
14 years 1 months ago
Algebraic methods and arithmetic filtering for exact predicates on circle arcs
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...
Olivier Devillers, Alexandra Fronville, Bernard Mo...
COMPGEOM
2000
ACM
14 years 2 months ago
Fast software for box intersections
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...
Afra Zomorodian, Herbert Edelsbrunner
COMPGEOM
2000
ACM
14 years 2 months ago
Delaunay triangulations and Voronoi diagrams for Riemannian manifolds
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...
Greg Leibon, David Letscher
COMPGEOM
2000
ACM
14 years 2 months ago
An algorithm for searching a polygonal region with a flashlight
Steven M. LaValle, Borislav H. Simov, Giora Slutzk...
COMPGEOM
2000
ACM
14 years 2 months ago
Fast computation of generalized Voronoi diagrams using graphics hardware
: 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...
Kenneth E. Hoff III, Tim Culver, John Keyser, Ming...
COMPGEOM
2000
ACM
14 years 2 months ago
When crossings count - approximating the minimum spanning tree
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...
Sariel Har-Peled, Piotr Indyk