LOCATING GUARDS FOR VISIBILITY COVERAGE OF POLYGONS

DOI10.1142/S0218195910003451zbMath1204.65017MaRDI QIDQ3063659

Yoav Amit, Joseph S. B. Mitchell, Eli Packer

Publication date: 15 December 2010

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

zbMATH Keywords

numerical examplesart galleryvisibility coverageguards

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (9)

Universal Guard Problems ⋮ Guarding orthogonal art galleries with sliding cameras ⋮ A nearly optimal algorithm for covering the interior of an art gallery ⋮ Minimum covering with travel cost ⋮ Algorithm 966 ⋮ A nearly optimal sensor placement algorithm for boundary coverage ⋮ The art gallery theorem for polyominoes ⋮ Facets for art gallery problems ⋮ Altitude terrain guarding and guarding uni-monotone polygons

Cites Work

• Guarding galleries and terrains
• Corrections to Lee's visibility polygon algorithm
• An optimal visibility graph algorithm for triangulated simple polygons
• A short proof of Chvatal's Watchman Theorem
• A combinatorial theorem in plane geometry
• POLYGON DECOMPOSITION AND THE ORTHOGONAL ART GALLERY PROBLEM
• Decomposing a Polygon into Simpler Components
• Computational complexity of art gallery problems
• An Output-Sensitive Algorithm for Computing Visibility Graphs

This page was built for publication: LOCATING GUARDS FOR VISIBILITY COVERAGE OF POLYGONS