Sciweavers

Share
COMPGEOM
1999
ACM

H-Walk: Hierarchical Distance Computation for Moving Convex Bodies

12 years 2 months ago
H-Walk: Hierarchical Distance Computation for Moving Convex Bodies
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 representations. For convex polygons, we prove that H-Walk improves on the classic Lin-Canny and DobkinKirkpatrick algorithms. We have implemented H-Walk for moving convex polyhedra in three dimensions. Experimental results indicate that, unlike previous incremental distance computation algorithms, H-Walk adapts well to variable coherence in the motion.
Leonidas J. Guibas, David Hsu, Li Zhang
Added 02 Aug 2010
Updated 02 Aug 2010
Type Conference
Year 1999
Where COMPGEOM
Authors Leonidas J. Guibas, David Hsu, Li Zhang
Comments (0)
books