A new algorithm for Euclidean shortest paths in the plane

DOI10.1145/3406325.3451037arXiv2102.12589OpenAlexW3166750876MaRDI QIDQ6065225

No author found.

Publication date: 14 November 2023

Published in: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

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

zbMATH Keywords

shortest pathpolygonal domainobstacle avoidanceEuclidean distanceshortest path queryshortest path map

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

Maximal distortion of geodesic diameters in polygonal domains

This page was built for publication: A new algorithm for Euclidean shortest paths in the plane