Edge guarding polyhedral terrains

DOI10.1016/0925-7721(95)00051-8zbMATH Open0869.68115OpenAlexW1986121990MaRDI QIDQ676574FDOQ676574

Authors: Hazel Everett, E. 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

Recommendations

• Guarding polyhedral terrains
• A note on the lower bound of edge guards of polyhedral terrains
• On The Lower Bound Of Edge Guards Of Polyhedral Terrains
• Worst-case-optimal algorithms for guarding planar graphs and polyhedral surfaces
• Improved bounds for guarding plane graphs with edges

zbMATH Keywords

art gallery problemgeometric edge guarding problem

Mathematics Subject Classification ID

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

Cites Work

• Every planar map is four colorable. I: Discharging
• Title not available (Why is that?)
• A combinatorial theorem in plane geometry
• Guarding polyhedral terrains

Cited In (7)

• A note on the lower bound of edge guards of polyhedral terrains
• Improved bounds for guarding plane graphs with edges
• On The Lower Bound Of Edge Guards Of Polyhedral Terrains
• Edge guards for polyhedra in three-space
• Worst-case-optimal algorithms for guarding planar graphs and polyhedral surfaces
• EDGE GUARDS IN STRAIGHT WALKABLE POLYGONS
• Improved bounds for guarding plane graphs with edges

This page was built for publication: Edge guarding polyhedral terrains

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