Art Gallery Problems for Convex Nested Polygons

DOI10.1287/IJOC.9.1.100MaRDI QIDQ4367047zbMATH OpenOpenAlexFDO

Authors

Publication date 25 November 1997

Published in INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL http://libres.uncg.edu/ir/uncg/f/J_Bhadury_Art_1997.pdf

zbMATH Keywords

convex nested polygonsminimal nested polygon problem

Mathematics Subject Classification ID

Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Integer programming (90C10) Combinatorial optimization (90C27) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Two NP‐Hard Art‐Gallery Problems for Ortho‐Polygons
• POLYGON DECOMPOSITION AND THE ORTHOGONAL ART GALLERY PROBLEM
• scientific article; zbMATH DE number 177851
• Approximation algorithms for art gallery problems in polygons
• Approximation Algorithms for Art Gallery Problems in Polygons and Terrains
• The art gallery theorem for polyominoes
• scientific article; zbMATH DE number 219237
• scientific article; zbMATH DE number 139794
• The art gallery theorem for simple polygons in terms of the number of reflex and convex vertices
• Computational complexity of the chromatic art gallery problem for orthogonal polygons

Cited in

(3)

• Watchman routes in the presence of a pair of convex polygons
• The art gallery theorem for simple polygons in terms of the number of reflex and convex vertices
• Facets for art gallery problems

This page was built for publication: Art Gallery Problems for Convex Nested Polygons

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