scientific article; zbMATH DE number 177562

MaRDI QIDQ4037433zbMATH OpenFDO

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

Publication date 18 May 1993

zbMATH Keywords

NP-hardlinear time algorithmart gallery problemminimum number of vision pointsset of \(m\) watchmen in a histogramset of static guards in a histogram

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• OPTIMUM GUARD COVERS AND m-WATCHMEN ROUTES FOR RESTRICTED POLYGONS
• Minimum-link watchman tours
• Optimum watchman routes
• Approximating watchman routes
• Watchman tours for polygons with holes

Cited in

(7)

• Two-guarding a rectilinear polygon
• Solving the Watchman Route Problem with Heuristic Search
• Shortest watchman tours in simple polygons under rotated monotone visibility
• Watchman routes in the presence of a pair of convex polygons
• The Two-Guard Polygon Walk Problem
• Covering grids and orthogonal polygons with periscope guards
• Online exploration outside a convex obstacle

This page was built for publication:

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