Edge guarding polyhedral terrains

DOI10.1016/0925-7721(95)00051-8zbMath0869.68115OpenAlexW1986121990MaRDI QIDQ676574

Hazel Everett, Eduardo Rivera-Campo

Publication date: 4 September 1997

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0925-7721(95)00051-8

zbMATH Keywords

art gallery problemgeometric edge guarding problem

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

Edge guards for polyhedra in three-space, Worst-case-optimal algorithms for guarding planar graphs and polyhedral surfaces, Improved bounds for guarding plane graphs with edges, On The Lower Bound Of Edge Guards Of Polyhedral Terrains, Improved bounds for guarding plane graphs with edges

Cites Work

• Unnamed Item
• Guarding polyhedral terrains
• Every planar map is four colorable. I: Discharging
• A combinatorial theorem in plane geometry