Shortest Path Queries in Polygonal Domains
From MaRDI portal
Publication:3511429
DOI10.1007/978-3-540-68880-8_20zbMath1143.68618OpenAlexW1504893535WikidataQ62037467 ScholiaQ62037467MaRDI QIDQ3511429
Jörg-Rüdiger Sack, Hua Guo, Anil Maheshwari
Publication date: 10 July 2008
Published in: Algorithmic Aspects in Information and Management (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-68880-8_20
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items
The polygon burning problem ⋮ The geodesic diameter of polygonal domains ⋮ Querying two boundary points for shortest paths in a polygonal domain ⋮ Shortest rectilinear path queries to rectangles in a rectangular domain ⋮ Unnamed Item
Cites Work
This page was built for publication: Shortest Path Queries in Polygonal Domains