Guarding polyhedral terrains

DOI10.1016/0925-7721(95)00034-8MaRDI QIDQ676572zbMATH OpenOpenAlexFDO

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

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)

Recommendations

• Edge guarding polyhedral terrains
• On The Lower Bound Of Edge Guards Of Polyhedral Terrains
• Worst-case-optimal algorithms for guarding planar graphs and polyhedral surfaces
• A note on the lower bound of edge guards of polyhedral terrains
• Altitude terrain guarding and guarding uni-monotone polygons

Cites work

• scientific article; zbMATH DE number 4065813 (Why is no real title available?)
• scientific article; zbMATH DE number 3729461 (Why is no real title available?)
• scientific article; zbMATH DE number 3261280 (Why is no real title available?)
• A combinatorial theorem in plane geometry
• A short proof of Chvatal's Watchman Theorem
• Every planar map is four colorable. I: Discharging
• Hiding people in polygons

Cited in

(26)

• A note on the lower bound of edge guards of polyhedral terrains
• Inapproximability of finding maximum hidden sets on polygons and terrains
• Altitude terrain guarding and guarding uni-monotone polygons
• Improved bounds for guarding plane graphs with edges
• Polychromatic colorings of plane graphs
• Optimally guarding 2-reflex orthogonal polyhedra by reflex edge guards
• Approximation algorithms for terrain guarding.
• GUARDING A POLYGON FROM TWO NEARLY-OPPOSITE DIRECTIONS
• Parameter analysis for guarding terrains
• Guarding precise and imprecise polyhedral terrains with segments
• Facially-constrained colorings of plane graphs: a survey
• A note on polychromatic colorings of plane graphs
• Universal guard problems
• Worst-case-optimal algorithms for guarding planar graphs and polyhedral surfaces
• On guarding the vertices of rectilinear domains
• Improved bounds for guarding plane graphs with edges
• Distance domination, guarding and covering of maximal outerplanar graphs
• Polygon guarding with orientation
• Generating rooted triangulations without repetitions
• Face-guarding polyhedra
• A finite dominating set of cardinality \(O(k)\) and a witness set of cardinality \(O(n)\) for 1.5D terrain guarding problem
• Three-dimensional weak visibility: Complexity and applications
• Guarding a terrain by two watchtowers
• scientific article; zbMATH DE number 6297811 (Why is no real title available?)
• Acrophobic guard watchtower problem
• Edge guarding polyhedral terrains

This page was built for publication: Guarding polyhedral terrains

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