Number of the records: 1
Terrain prickliness: Theoretical grounds for high complexity viewsheds
- 1.0548611 - ÚI 2022 RIV DE eng C - Conference Paper (international conference)
Acharyya, Ankush - Jallu, Ramesh Kumar - Löffler, M. - Meijer, G.G.T. - Saumell, Maria - Silveira, R.I. - Staals, F.
Terrain prickliness: Theoretical grounds for high complexity viewsheds.
11th International Conference on Geographic Information Science (GIScience 2021) - Part II. Dagstuhl: Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, 2021 - (Janowicz, K.; Verstegen, J.), č. článku 10. Leibniz International Proceedings in Informatics (LIPIcs), 208. ISBN 978-3-95977-208-2. ISSN 1868-8969.
[GIScience 2021: International Conference on Geographic Information Science /11./. Poznan / Online (PL), 27.09.2021-30.09.2021]
R&D Projects: GA ČR(CZ) GJ19-06792Y
EU Projects: European Commission(ES) 734922
Institutional support: RVO:67985807
Keywords : Digital elevation model * Triangulated irregular network * Viewshed complexity
OECD category: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
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.
Permanent Link: http://hdl.handle.net/11104/0324652
File Download Size Commentary Version Access 0548611-aoa.pdf 1 4.4 MB OA CC BY 4.0 Publisher’s postprint open-access
Number of the records: 1