Minimization of the Maximum Distance between the Two Guards Patrolling a Polygonal Region
From MaRDI portal
Publication:2897981
DOI10.1007/978-3-642-29700-7_5zbMath1304.68187OpenAlexW2296766534MaRDI QIDQ2897981
Publication date: 16 July 2012
Published in: Frontiers in Algorithmics and Algorithmic Aspects in Information and Management (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-29700-7_5
Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (2)
Watchman routes for lines and line segments ⋮ Minimization of the maximum distance between the two guards patrolling a polygonal region
This page was built for publication: Minimization of the Maximum Distance between the Two Guards Patrolling a Polygonal Region