COMGEO
2002
ACM
13 years 8 months ago
2002
ACM
We present a quadtree-based decomposition of the interior of a polygon with holes. The complete decomposition yields a constant factor approximation of the minimum weight Steiner ...
COMGEO
2002
ACM
13 years 8 months ago
2002
ACM
COMGEO
2000
ACM
13 years 8 months ago
2000
ACM
Given a set X of points in the plane, two distinguished points s,t X, and a set of obstacles represented by line segments, we wish to compute a simple polygonal path from s to t...
COMGEO
2000
ACM
13 years 8 months ago
2000
ACM
COMGEO
2000
ACM
13 years 8 months ago
2000
ACM
This paper presents the Hierarchical Walk, or H-Walk algorithm, which maintains the distance between two moving convex bodies by exploiting both motion coherence and hierarchical ...
COMGEO
2000
ACM
13 years 8 months ago
2000
ACM
We present a fast and accurate collision detection algorithm for haptic interaction with polygonal models. Given a model, we pre-compute a hybrid hierarchical representation, cons...
COMGEO
2000
ACM
13 years 8 months ago
2000
ACM
COMGEO
2004
ACM
13 years 8 months ago
2004
ACM
We introduce a novel technique for drawing proximity graphs in polynomial area and volume. Previously known algorithms produce representations whose size increases exponentially w...
COMGEO
2004
ACM
13 years 8 months ago
2004
ACM
We investigate the problem of finding a minimal volume parallelepiped enclosing a given set of n threedimensional points. We give two mathematical properties of these parallelepip...
COMGEO
2004
ACM
13 years 8 months ago
2004
ACM