On the number of guard edges of a polygon

DOI10.1007/BF02573990zbMath0788.52005OpenAlexW2004449756MaRDI QIDQ1312196

Kyung-Yong Chwa, Tony C. Woo, Jung-Heum Park, Sung Yong Shin

Publication date: 19 January 1994

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/131285

zbMATH Keywords

visibilityart galleryguards

Mathematics Subject Classification ID

Other problems of combinatorial convexity (52A37) Variants of convex sets (star-shaped, ((m, n))-convex, etc.) (52A30)

Related Items (2)

Starshaped sets ⋮ Open Guard Edges and Edge Guards in Simple Polygons

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Galleries need fewer mobile guards: A variation on Chvatal's theorem
• A short proof of Chvatal's Watchman Theorem
• A combinatorial theorem in plane geometry
• Computational complexity of art gallery problems
• An Optimal Algorithm for Finding the Kernel of a Polygon
• An optimal algorithm for detecting weak visibility of a polygon

This page was built for publication: On the number of guard edges of a polygon