Visiting a Polygon on the Optimal Way to a Query Point
From MaRDI portal
Publication:3507339
DOI10.1007/978-3-540-69311-6_26zbMath1143.90393MaRDI QIDQ3507339
Mohammad Ghodsi, Ramtin Khosravi
Publication date: 19 June 2008
Published in: Frontiers in Algorithmics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-69311-6_26
Cites Work
- Unnamed Item
- Corrections to Lee's visibility polygon algorithm
- An efficient algorithm for Euclidean shortest paths among polygonal obstacles in the plane
- Shortest paths in simple polygons with polygon-meet constraints
- Visibility of a simple polygon
- Touring a sequence of polygons
- An Optimal Algorithm for Euclidean Shortest Paths in the Plane
- SHORTEST PATHS AMONG OBSTACLES IN THE PLANE