COMPGEOM
2000
ACM
14 years 3 months ago
2000
ACM
COMPGEOM
2000
ACM
14 years 3 months ago
2000
ACM
COMPGEOM
2000
ACM
14 years 3 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
14 years 3 months ago
2000
ACM
COMPGEOM
2000
ACM
14 years 3 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
14 years 3 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...
COMPGEOM
2000
ACM
14 years 3 months ago
2000
ACM
We describe a kinetic data structure (KDS) that maintains the connected components of the union of a set of unit-radius disks moving in the plane. We assume that the motion of eac...
COMPGEOM
2000
ACM
14 years 3 months ago
2000
ACM
It has been known for 30 years that pseudorandom number generators in the class of linear congruential generators (LCG) exhibit strong and predictable regularities. A widely used ...
COMPGEOM
2000
ACM
14 years 3 months ago
2000
ACM
In this paper we describe and discuss a new kernel design for geometric computation in the plane. It combines different kinds of floating-point filter techniques and a lazy eval...
COMPGEOM
2000
ACM
14 years 3 months ago
2000
ACM
Let A be the incidence matrix of a set system with m sets and n points, m ≤ n, and let t = tr M, where M = AT A. Finally, let σ = tr M2 be the sum of squares of the elements of ...