Querying Two Boundary Points for Shortest Paths in a Polygonal Domain
From MaRDI portal
Publication:3652291
DOI10.1007/978-3-642-10631-6_106zbMath1273.68095OpenAlexW1719465442MaRDI QIDQ3652291
Publication date: 17 December 2009
Published in: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-10631-6_106
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05)
Related Items (1)
This page was built for publication: Querying Two Boundary Points for Shortest Paths in a Polygonal Domain