Guarding polyhedral terrains

DOI10.1016/0925-7721(95)00034-8zbMath0869.68113OpenAlexW2116854100MaRDI QIDQ676572

Binhai Zhu, Prosenjit Bose, Godfried T. Toussaint, Thomas C. Shermer

Publication date: 18 March 1997

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

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

zbMATH Keywords

matchingart gallery theoremspolyhedral terrain

Mathematics Subject Classification ID

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

Related Items

A finite dominating set of cardinality \(O(k)\) and a witness set of cardinality \(O(n)\) for 1.5D terrain guarding problem ⋮ Facially-constrained colorings of plane graphs: a survey ⋮ Optimally guarding 2-reflex orthogonal polyhedra by reflex edge guards ⋮ Worst-case-optimal algorithms for guarding planar graphs and polyhedral surfaces ⋮ Distance domination, guarding and covering of maximal outerplanar graphs ⋮ Polychromatic colorings of plane graphs ⋮ Improved bounds for guarding plane graphs with edges ⋮ Edge guarding polyhedral terrains ⋮ On guarding the vertices of rectilinear domains ⋮ Inapproximability of finding maximum hidden sets on polygons and terrains ⋮ A note on the lower bound of edge guards of polyhedral terrains ⋮ Generating rooted triangulations without repetitions ⋮ Three-dimensional weak visibility: Complexity and applications ⋮ Acrophobic guard watchtower problem ⋮ Improved bounds for guarding plane graphs with edges ⋮ A note on polychromatic colorings of plane graphs ⋮ Approximation algorithms for terrain guarding.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hiding people in polygons
• A short proof of Chvatal's Watchman Theorem
• Every planar map is four colorable. I: Discharging
• A combinatorial theorem in plane geometry

This page was built for publication: Guarding polyhedral terrains