Computing shortest paths among curved obstacles in the plane

DOI10.1145/2462356.2462377zbMath1305.68218OpenAlexW2022670034MaRDI QIDQ5174497

Haitao Wang, Danny Z. Chen

Publication date: 17 February 2015

Published in: Proceedings of the twenty-ninth annual symposium on Computational geometry (Search for Journal in Brave)

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

zbMATH Keywords

shortest pathsVoronoi diagramssplinegonscurved obstaclestangent graphsrelevant visibility graphs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

Navigating Weighted Regions with Scattered Skinny Tetrahedra ⋮ Visibility graphs, dismantlability, and the cops and robbers game ⋮ Visibility and ray shooting queries in polygonal domains

This page was built for publication: Computing shortest paths among curved obstacles in the plane