COMPGEOM
2001
ACM
13 years 8 months ago
2001
ACM
We present two approaches to the problem of calculating a cell in a 3-dimensional arrangement of quadrics. The first approach solves the problem using rational arithmetic. It work...
COMPGEOM
2001
ACM
13 years 8 months ago
2001
ACM
We propose a new randomized algorithm for maintaining a set of clusters among moving nodes in the plane. Given a specified cluster radius, our algorithm selects and maintains a va...
COMPGEOM
2001
ACM
13 years 8 months ago
2001
ACM
COMPGEOM
2001
ACM
13 years 8 months ago
2001
ACM
We present algorithms for constructing a hierarchy of increasingly coarse Morse complexes that decompose a piecewise linear 2-manifold. While Morse complexes are defined only in t...
COMPGEOM
2001
ACM
13 years 8 months ago
2001
ACM
COMPGEOM
2001
ACM
13 years 8 months ago
2001
ACM
This paper addresses the problem of lossy compression of arrangements. Given an arrangement of n lines in the plane, we show how to construct another arrangement consisting of man...
COMPGEOM
2001
ACM
13 years 8 months ago
2001
ACM
COMPGEOM
2001
ACM
13 years 8 months ago
2001
ACM
Given a triangulation in the plane or a tetrahedralization in 3-space, we investigate the efficiency of locating a point by walking in the structure with different
COMPGEOM
2001
ACM
13 years 8 months ago
2001
ACM
We show how to maintain the width of a set of n planar points subject to insertions and deletions of points in O( n log3 n) amortized time per update. Previously, no fully dynami...
COMPGEOM
2001
ACM
13 years 8 months ago
2001
ACM