OPTIMUM GUARD COVERS AND m-WATCHMEN ROUTES FOR RESTRICTED POLYGONS

DOI10.1142/S0218195993000063zbMATH Open0784.90098MaRDI QIDQ5289296FDOQ5289296

Authors: Svante Carlsson, Bengt J. Nilsson, Simeon C. Ntafos 

Publication date: 22 August 1993

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 177562
• Optimum watchman routes
• Approximating watchman routes
• Shortest watchman routes in simple polygons

zbMATH Keywords

NP-hardpolygonart gallery problem\(m\)-watchman routes problemoptimum guard coverswatchmen route problem

Mathematics Subject Classification ID

Dynamic programming (90C39) Abstract computational complexity for mathematical programming problems (90C60) Convex sets in (2) dimensions (including convex curves) (52A10) Variants of convex sets (star-shaped, ((m, n))-convex, etc.) (52A30)

Cited In (7)

• Title not available (Why is that?)
• Watchman routes in the presence of a pair of convex polygons
• Approximability of guarding weak visibility polygons
• Shortest watchman tours in simple polygons under rotated monotone visibility
• Linear-Time 3-Approximation Algorithm for the r-Star Covering Problem
• Multiagent visual area coverage using a new genetic algorithm selection scheme
• \(k\)-Transmitter watchman routes

This page was built for publication: OPTIMUM GUARD COVERS AND m-WATCHMEN ROUTES FOR RESTRICTED POLYGONS

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