License: 
Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.GIScience.2021.II.10
URN: urn:nbn:de:0030-drops-147697
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2021/14769/
Acharyya, Ankush ;
Jallu, Ramesh K. ;
Löffler, Maarten ;
Meijer, Gert G.T. ;
Saumell, Maria ;
Silveira, Rodrigo I. ;
Staals, Frank
Terrain Prickliness: Theoretical Grounds for High Complexity Viewsheds
Abstract
An important task in terrain analysis is computing viewsheds. A viewshed is the union of all the parts of the terrain that are visible from a given viewpoint or set of viewpoints. The complexity of a viewshed can vary significantly depending on the terrain topography and the viewpoint position.
In this work we study a new topographic attribute, the prickliness, that measures the number of local maxima in a terrain from all possible angles of view. We show that the prickliness effectively captures the potential of terrains to have high complexity viewsheds. We present near-optimal algorithms to compute it for TIN terrains, and efficient approximate algorithms for raster DEMs. We validate the usefulness of the prickliness attribute with experiments in a large set of real terrains.
BibTeX - Entry
@InProceedings{acharyya_et_al:LIPIcs.GIScience.2021.II.10,
author = {Acharyya, Ankush and Jallu, Ramesh K. and L\"{o}ffler, Maarten and Meijer, Gert G.T. and Saumell, Maria and Silveira, Rodrigo I. and Staals, Frank},
title = {{Terrain Prickliness: Theoretical Grounds for High Complexity Viewsheds}},
booktitle = {11th International Conference on Geographic Information Science (GIScience 2021) - Part II},
pages = {10:1--10:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-208-2},
ISSN = {1868-8969},
year = {2021},
volume = {208},
editor = {Janowicz, Krzysztof and Verstegen, Judith A.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2021/14769},
URN = {urn:nbn:de:0030-drops-147697},
doi = {10.4230/LIPIcs.GIScience.2021.II.10},
annote = {Keywords: Digital elevation model, Triangulated irregular network, Viewshed complexity}
}
