Shortest paths in simple polygons with polygon-meet constraints

DOI10.1016/j.ipl.2004.04.010zbMath1178.68380OpenAlexW2172235831MaRDI QIDQ2390305

Ramtin Khosravi, Mohammad Ghodsi

Publication date: 21 July 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2004.04.010

zbMATH Keywords

shortest pathcomputational geometryshortest path mappolygon-meet

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (3)

Visiting a Polygon on the Optimal Way to a Query Point ⋮ Query-point visibility constrained shortest paths in simple polygons ⋮ How to Keep an Eye on Small Things

Cites Work

• Unnamed Item
• Unnamed Item
• Shortest watchman routes in simple polygons
• Finding shortest safari routes in simple polygons
• Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
• Watchman routes under limited visibility
• The zookeeper route problem
• Approximation algorithms for the watchman route and zookeeper's problems.
• Touring a sequence of polygons
• An Optimal Algorithm for Euclidean Shortest Paths in the Plane

This page was built for publication: Shortest paths in simple polygons with polygon-meet constraints