20 search results - page 4 / 4 » compgeom 2000 |
109
click to vote
COMPGEOM
2000
ACM
15 years 7 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...
147
click to vote
COMPGEOM
2000
ACM
15 years 7 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...
117
click to vote
COMPGEOM
1997
ACM
15 years 7 months ago
1997
ACM
We describe the first known algorithm for efficiently maintaining a Binary Space Partition (BSP) for n continuously moving segments in the plane, whose interiors remain disjoint...
126
Voted
COMPGEOM
1995
ACM
15 years 6 months ago
1995
ACM
The range searching problem is a fundamental problem in computational geometry, with numerous important applications. Most research has focused on solving this problem exactly, bu...
112
Voted
COMPGEOM
2000
ACM
15 years 7 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 ...