Dynamic and robust local clearance triangulations

DOI10.1145/2580947zbMATH Open1378.68175OpenAlexW2072884685MaRDI QIDQ5370926FDOQ5370926

Authors: Marcelo Kallmann 

Publication date: 20 October 2017

Published in: ACM Transactions on Graphics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2580947

Recommendations

• An efficient algorithm for computing high-quality paths amid polygonal obstacles
• An efficient algorithm for computing high-quality paths amid polygonal obstacles
• An algorithm for dynamic Delaunay triangulation of simple polygon
• Does a robot path have clearance C?
• Computing \(L_1\) shortest paths among polygonal obstacles in the plane

zbMATH Keywords

path planningcharacter navigationnavigation meshes

Mathematics Subject Classification ID

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

Cited In (2)

• On the performance of self-organizing maps for the non-Euclidean traveling salesman problem in the polygonal domain
• LOCAL ROBUSTNESS AND ITS APPLICATION TO POLYHEDRAL INTERSECTION

This page was built for publication: Dynamic and robust local clearance triangulations

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