Art Gallery Problems for Convex Nested Polygons

DOI10.1287/ijoc.9.1.100zbMath0890.90155OpenAlexW2088317464MaRDI QIDQ4367047

No author found.

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

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

Related Items (1)

Watchman routes in the presence of a pair of convex polygons

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