COMPGEOM
2001
ACM
15 years 7 months ago
2001
ACM
122
Voted
COMPGEOM
2001
ACM
15 years 7 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...
111
Voted
COMPGEOM
2001
ACM
15 years 7 months ago
2001
ACM
101
click to vote
COMPGEOM
2001
ACM
15 years 7 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
147
click to vote
COMPGEOM
2001
ACM
15 years 7 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...