Computing Shortest Paths among Curved Obstacles in the Plane

DOI10.1145/2660771zbMath1398.68617arXiv1103.3911OpenAlexW2565603695MaRDI QIDQ4962186

Danny Z. Chen, Haitao Wang

Publication date: 30 October 2018

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

Full work available at URL: https://arxiv.org/abs/1103.3911

zbMATH Keywords

shortest pathsVoronoi diagramscurved obstaclestangent graphs

Mathematics Subject Classification ID

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

Related Items (8)

Shortest paths in the plane with obstacle violations ⋮ Computing \(L_1\) shortest paths among polygonal obstacles in the plane ⋮ A Near-Optimal Algorithm for Shortest Paths Among Curved Obstacles in the Plane ⋮ Multi-robot motion planning for unit discs with revolving areas ⋮ Unnamed Item ⋮ Minimizing Distance-to-Sight in Polygonal Domains ⋮ Computing an \(L_1\) shortest path among splinegonal obstacles in the plane ⋮ Computing Shortest Paths in the Plane with Removable Obstacles

This page was built for publication: Computing Shortest Paths among Curved Obstacles in the Plane