H-Walk: Hierarchical Distance Computation for Moving Convex Bodies

  title={H-Walk: Hierarchical Distance Computation for Moving Convex Bodies},
  author={Leonidas J. Guibas and David Hsu and Li Zhang},
  booktitle={Symposium on Computational Geometry},
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… CONTINUE READING
Highly Cited
This paper has 77 citations. REVIEW CITATIONS
50 Citations
0 References
Similar Papers


Publications citing this paper.

77 Citations

Citations per Year
Semantic Scholar estimates that this publication has 77 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…