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

DOI10.1016/J.IPL.2012.07.005MaRDI QIDQ456117zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• The art gallery theorem for polyominoes
• Art Gallery Problems for Convex Nested Polygons
• A simple proof of the rectilinear art gallery theorem
• A Helly-type theorem for simple polygons
• Partitioning orthogonal polygons into \(\leq 8\)-vertex pieces, with application to an art gallery theorem
• POLYGON DECOMPOSITION AND THE ORTHOGONAL ART GALLERY PROBLEM
• An art gallery theorem for line segments in the plane
• A Short Proof of the Rectilinear Art Gallery Theorem
• scientific article; zbMATH DE number 1553617
• scientific article; zbMATH DE number 1382594

Cites work

• scientific article; zbMATH DE number 4065813 (Why is no real title available?)
• scientific article; zbMATH DE number 1424310 (Why is no real title available?)
• A combinatorial theorem in plane geometry
• Guarding Art Galleries: The Extra Cost for Sculptures Is Linear

Cited in

(2)

• Art Gallery Problems for Convex Nested Polygons
• The fortress problem in terms of the number of reflex and convex vertices. A 3D objects scanning application

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

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