Guarding polyhedral terrains

DOI10.1016/0925-7721(95)00034-8zbMATH Open0869.68113OpenAlexW2116854100MaRDI QIDQ676572FDOQ676572

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

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

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

zbMATH Keywords

matchingart gallery theoremspolyhedral terrain

Mathematics Subject Classification ID

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

Cites Work

• A short proof of Chvatal's Watchman Theorem
• Every planar map is four colorable. I: Discharging
• Title not available (Why is that?)
• Title not available (Why is that?)
• A combinatorial theorem in plane geometry
• Title not available (Why is that?)
• Hiding people in polygons

Cited In (24)

• A note on the lower bound of edge guards of polyhedral terrains
• Inapproximability of finding maximum hidden sets on polygons and terrains
• Improved bounds for guarding plane graphs with edges
• Polychromatic colorings of plane graphs
• Optimally guarding 2-reflex orthogonal polyhedra by reflex edge guards
• GUARDING A POLYGON FROM TWO NEARLY-OPPOSITE DIRECTIONS
• Approximation algorithms for terrain guarding.
• Parameter analysis for guarding terrains
• Guarding precise and imprecise polyhedral terrains with segments
• A note on polychromatic colorings of plane graphs
• Facially-constrained colorings of plane graphs: a survey
• Worst-case-optimal algorithms for guarding planar graphs and polyhedral surfaces
• Improved bounds for guarding plane graphs with edges
• On guarding the vertices of rectilinear domains
• 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
• Guarding a terrain by two watchtowers
• Three-dimensional weak visibility: Complexity and applications
• Title not available (Why is that?)
• 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)