1,493 research outputs found
Separation-Sensitive Collision Detection for Convex Objects
We develop a class of new kinetic data structures for collision detection
between moving convex polytopes; the performance of these structures is
sensitive to the separation of the polytopes during their motion. For two
convex polygons in the plane, let be the maximum diameter of the polygons,
and let be the minimum distance between them during their motion. Our
separation certificate changes times when the relative motion of
the two polygons is a translation along a straight line or convex curve,
for translation along an algebraic trajectory, and for
algebraic rigid motion (translation and rotation). Each certificate update is
performed in time. Variants of these data structures are also
shown that exhibit \emph{hysteresis}---after a separation certificate fails,
the new certificate cannot fail again until the objects have moved by some
constant fraction of their current separation. We can then bound the number of
events by the combinatorial size of a certain cover of the motion path by
balls.Comment: 10 pages, 8 figures; to appear in Proc. 10th Annual ACM-SIAM
Symposium on Discrete Algorithms, 1999; see also
http://www.uiuc.edu/ph/www/jeffe/pubs/kollide.html ; v2 replaces submission
with camera-ready versio
Continuous Yao Graphs
In this paper, we introduce a variation of the well-studied Yao graphs. Given
a set of points and an angle , we
define the continuous Yao graph with vertex set and angle
as follows. For each , we add an edge from to in
if there exists a cone with apex and aperture such
that is the closest point to inside this cone.
We study the spanning ratio of for different values of .
Using a new algebraic technique, we show that is a spanner when
. We believe that this technique may be of independent
interest. We also show that is not a spanner, and that
may be disconnected for .Comment: 7 pages, 7 figures. Presented at CCCG 201
- …