COMPGEOM
2001
ACM
15 years 22 days ago
2001
ACM
We consider segment intersection searching amidst (possibly intersecting) algebraic arcs in the plane. We show how to preprocess n arcs in time O(n2+ ) into a data structure of si...
COMPGEOM
2001
ACM
15 years 22 days ago
2001
ACM
This presentation illustrates examples of my geometric sculpture and outlines certain design techniques. I apply methods from the field of computational geometry to the creation o...
COMPGEOM
2001
ACM
15 years 22 days 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
15 years 22 days ago
2001
ACM
COMPGEOM
2001
ACM
15 years 22 days ago
2001
ACM
The treatment of curved algebraic surfaces becomes more and more the focus of attention in Computational Geometry. We present a video that illustrates the computation of the conve...
COMPGEOM
2001
ACM
15 years 22 days 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
15 years 22 days 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
15 years 22 days ago
2001
ACM
COMPGEOM
2001
ACM
15 years 22 days 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
15 years 22 days ago
2001
ACM