TERRAIN VISIBILITY WITH MULTIPLE VIEWPOINTS
From MaRDI portal
Publication:5261016
DOI10.1142/S0218195914600085zbMath1331.68253arXiv1309.4323OpenAlexW2951115213MaRDI QIDQ5261016
Frank Staals, Vera Sacristán, Maria Saumell, Inês Matos, Rodrigo I. Silveira, Maarten Löffler, Ferran Hurtado
Publication date: 1 July 2015
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1309.4323
Related Items
An Efficient Algorithm for the 1D Total Visibility-Index Problem and Its Parallelization, On Voronoi visibility maps of 1.5D terrains with multiple viewpoints, Altitude terrain guarding and guarding uni-monotone polygons
Cites Work
- Improved approximations for guarding 1.5-dimensional terrains
- Improved approximation algorithms for geometric set cover
- Corrections to Lee's visibility polygon algorithm
- Efficient hidden surface removal for objects with small union size
- Ray shooting in polygons using geodesic triangulations
- Generalized hidden surface removal
- Terrain Guarding is NP-Hard
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
- Improved algorithms for discs and balls using power diagrams
- Power Diagrams: Properties, Algorithms and Applications
- A Constant‐Factor Approximation Algorithm for Optimal 1.5D Terrain Guarding