Terrain Visibility with Multiple Viewpoints

We study the problem of visibility in polyhedral terrains in the presence of multiple viewpoints. We consider three fundamental visibility structures: the visibility map, the colored visibility map, and the Voronoi visibility map. We study the complexity of each structure for both 1.5D and 2.5D terrains, and provide efficient algorithms to construct them. Our algorithm for the visibility map in 2.5D terrains improves on the only existing algorithm in this setting.

keywords: Computational Geometry, Terrains

Journal Article (peer-reviewed)

Ferran Hurtado, Frank Staals, Inês Matos, Maarten Löffler, Maria Saumell, Rodrigo I. Silveira, Vera Sacristán
Terrain Visibility with Multiple Viewpoints
International Journal on Computational Geometry and Applications
24, 4, 275–306, 2014
http://dx.doi.org/10.1142/S0218195914600085

Conference Proceedings (peer-reviewed)

Ferran Hurtado, Frank Staals, Inês Matos, Maarten Löffler, Maria Saumell, Rodrigo I. Silveira, Vera Sacristán
Terrain Visibility with Multiple Viewpoints
Proc. 24th International Symposium on Algorithms and Computation
LNCS 8283, 317–327, 2013
http://dx.doi.org/10.1007/978-3-642-45030-3_30
Invited to Special Issue of IJCGA

Workshop or Poster (weakly reviewed)

Maarten Löffler, Maria Saumell, Rodrigo I. Silveira
A Faster Algorithm to Compute the Visibility Map of a 1.5D Terrain
Proc. 30th European Workshop on Computational Geometry
, 2014

Archived Publication (not reviewed)

Ferran Hurtado, Frank Staals, Inês Matos, Maarten Löffler, Maria Saumell, Rodrigo I. Silveira, Vera Sacristán
Terrain Visibility with Multiple Viewpoints
1309.4323, 2013
http://arXiv.org/abs/1309.4323

back to list