The art gallery theorem for simple polygons in terms of the number of reflex and convex vertices

DOI10.1016/j.ipl.2012.07.005zbMath1248.68523OpenAlexW2051885868MaRDI QIDQ456117

Justin Iwerks, Joseph S. B. Mitchell

Publication date: 23 October 2012

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2012.07.005

zbMATH Keywords

computational geometryart gallery theoremguard numbervisibility coverage

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Combinatorial complexity of geometric structures (52C45)

Related Items (1)

The fortress problem in terms of the number of reflex and convex vertices. A 3D objects scanning application

Cites Work

• A combinatorial theorem in plane geometry
• Guarding Art Galleries: The Extra Cost for Sculptures Is Linear
• Unnamed Item
• Unnamed Item

This page was built for publication: The art gallery theorem for simple polygons in terms of the number of reflex and convex vertices