Altitude terrain guarding and guarding uni-monotone polygons
From MaRDI portal
Publication:2331221
DOI10.1016/j.comgeo.2019.07.004zbMath1427.52004arXiv1803.05893OpenAlexW2966187240MaRDI QIDQ2331221
Hemant Malik, Stephan Friedrichs, Valentin Polishchuk, Ovidiu Daescu, Christiane Schmidt
Publication date: 25 October 2019
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1803.05893
altitude terrain guarding problemmonotone mountainsperfect polygonsterrain guarding problemuni-monotone polygons
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Convex sets in (2) dimensions (including convex curves) (52A10)
Related Items (2)
On orthogonally guarding orthogonal polygons with bounded treewidth ⋮ On Voronoi visibility maps of 1.5D terrains with multiple viewpoints
Cites Work
- Unnamed Item
- Unnamed Item
- Maintaining visibility of a polygon with a moving point of view
- Improved approximations for guarding 1.5-dimensional terrains
- Improved approximation algorithms for geometric set cover
- Covering orthogonal polygons with star polygons: The perfect graph approach
- Approximation algorithms for terrain guarding.
- A fixed-parameter algorithm for guarding 1.5D terrains
- Efficient parallel implementations of approximation algorithms for guarding 1.5D terrains
- Guarding terrains via local search
- LOCATING GUARDS FOR VISIBILITY COVERAGE OF POLYGONS
- Terrain Guarding is NP-Hard
- POLYGON DECOMPOSITION AND THE ORTHOGONAL ART GALLERY PROBLEM
- A 4-Approximation Algorithm for Guarding 1.5-Dimensional Terrains
- An Approximation Scheme for Terrain Guarding
- An Output-Sensitive Algorithm for Computing Visibility Graphs
- A Pedestrian Approach to Ray Shooting: Shoot a Ray, Take a Walk
- TERRAIN VISIBILITY WITH MULTIPLE VIEWPOINTS
- A Constant‐Factor Approximation Algorithm for Optimal 1.5D Terrain Guarding
This page was built for publication: Altitude terrain guarding and guarding uni-monotone polygons
