150
Voted
COMGEO
2002
ACM
15 years 16 days 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
15 years 16 days ago
2002
ACM
117
click to vote
COMGEO
2000
ACM
15 years 16 days 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...
77
Voted
COMGEO
2000
ACM
15 years 16 days ago
2000
ACM
102
click to vote
COMGEO
2000
ACM
15 years 16 days 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 ...
133
Voted
COMGEO
2000
ACM
15 years 16 days 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...
70
Voted
COMGEO
2000
ACM
15 years 16 days ago
2000
ACM
101
Voted
COMGEO
2004
ACM
15 years 17 days 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...
85
Voted
COMGEO
2004
ACM
15 years 17 days 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
15 years 17 days ago
2004
ACM