Watchman routes for lines and segments

DOI10.1007/978-3-642-31155-0_4MaRDI QIDQ2904541zbMATH OpenOpenAlexFDO

Authors Adrian Dumitrescu, Joseph S. B. Mitchell, Paweł Żyliński

Publication date 14 August 2012

Published in Algorithm Theory – SWAT 2012 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-31155-0_4

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Recommendations

• Watchman routes for lines and line segments
• An improved algorithm for computing a shortest watchman route for lines
• Approximating watchman routes
• Optimum watchman routes
• Watchman routes in the presence of a pair of convex polygons

Cited in

(4)

• Optimum watchman routes
• Watchman routes for lines and line segments
• Inspecting a Set of Strips Optimally
• Solving the Watchman Route Problem with Heuristic Search

This page was built for publication: Watchman routes for lines and segments

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2904541)