A hierarchical method for real-time distance computation among moving convex bodies

DOI10.1016/S0925-7721(99)00042-5zbMATH Open0949.68156OpenAlexW2075726319WikidataQ126851768 ScholiaQ126851768MaRDI QIDQ1974624FDOQ1974624

Authors: Leonidas Guibas, David Hsu, Li Zhang 

Publication date: 7 May 2000

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0925-7721(99)00042-5

Recommendations

• scientific article; zbMATH DE number 1440920
• An accurate distance-calculation algorithm for convex polyhedra
• scientific article; zbMATH DE number 740451
• scientific article; zbMATH DE number 2202078
• An optimal algorithm for solving collision distance between convex polygons in plane

zbMATH Keywords

hierarchical walk

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cited In (3)

• A new fast algorithm for computing the distance between two disjoint convex polygons based on Voronoi diagram
• The GJK distance algorithm: an interval version for incremental motions
• Representation complexity of adaptive 3D distance fields

This page was built for publication: A hierarchical method for real-time distance computation among moving convex bodies

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1974624)