Showing 3 publications
- 📄 Journal Article 🔓 Bronze
An Efficient Algorithm for Euclidean Shortest Paths Among Polygonal Obstacles in the Plane
Discrete & Computational Geometry , Vol. 18 (4) - 📄 Conference Paper 🔓 Bronze
Efficient computation of geodesic shortest paths
ACM Symposium on Theory of Computing (STOC) - 📄 Conference Paper 🔒 Closed
Efficient algorithms for Euclidean shortest path and visibility problems with polygonal obstacles
Annual Symposium on Computational Geometry (SoCG)