23 search results - page 3 / 5 » compgeom 2001 |
COMPGEOM
2001
ACM
13 years 9 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 9 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 9 months ago
2001
ACM
We present an approximation algorithm for computing the diameter of a point-set in d-dimensions. The new algorithm is sensitive to the "hardness" of computing the diamet...
COMPGEOM
2001
ACM
13 years 9 months ago
2001
ACM
A recent result by Pach and Pinchasi on so-called balanced lines of a finite two-colored point set in the plane is related to other facts on halving triangles in 3-space and to a ...
COMPGEOM
2001
ACM
13 years 9 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...