Shortest watchman tours in simple polygons under rotated monotone visibility

DOI10.1007/978-3-030-58150-3_25MaRDI QIDQ2019474zbMATH OpenOpenAlexFDO

Authors David Orden, Leonidas Palios, Carlos Seara, Paweł Żyliński, Bengt J. Nilsson

Publication date 21 April 2021

Full work available at URL https://arxiv.org/abs/2007.08368

zbMATH Keywords

polygonsvisibilitywatchman tours

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx)

Recommendations

• Shortest watchman routes in simple polygons
• Computing a shortest watchman path in a simple polygon in polynomial-time
• Fast computation of shortest watchman routes in simple polygons
• Finding the shortest watchman route in a simple polygon
• The shortest watchtower and related problems for polyhedral terrains
• A linear-time 2-approximation algorithm for the watchman route problem for simple polygons
• Watchman tours for polygons with holes
• Watchman routes in the presence of a pair of convex polygons
• OPTIMUM GUARD COVERS AND m-WATCHMEN ROUTES FOR RESTRICTED POLYGONS
• scientific article; zbMATH DE number 177562

Cited in

(1)

• The maximum cover with rotating field of view

This page was built for publication: Shortest watchman tours in simple polygons under rotated monotone visibility

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