Saved in:
| Main Authors: | , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2021
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2103.06696 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911198750965760 |
|---|---|
| author | Acharyya, Ankush Löffler, Maarten Meijer, Gert G. T. Saumell, Maria Silveira, Rodrigo I. Staals, Frank |
| author_facet | Acharyya, Ankush Löffler, Maarten Meijer, Gert G. T. Saumell, Maria Silveira, Rodrigo I. Staals, Frank |
| contents | An important task in terrain analysis is computing \emph{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
\emph{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 2.5D TIN terrains to have high complexity viewsheds.
We present
optimal and (under standard assumptions) near-optimal
algorithms to compute it for 1.5D and 2.5D TIN terrains, respectively, and efficient approximate algorithms for raster DEMs.
We validate the usefulness of the prickliness attribute with experiments in a large set of real terrains. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2103_06696 |
| institution | arXiv |
| publishDate | 2021 |
| record_format | arxiv |
| spellingShingle | Terrain prickliness: theoretical grounds for high complexity viewsheds Acharyya, Ankush Löffler, Maarten Meijer, Gert G. T. Saumell, Maria Silveira, Rodrigo I. Staals, Frank Computational Geometry 68U05 An important task in terrain analysis is computing \emph{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 \emph{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 2.5D TIN terrains to have high complexity viewsheds. We present optimal and (under standard assumptions) near-optimal algorithms to compute it for 1.5D and 2.5D TIN terrains, respectively, and efficient approximate algorithms for raster DEMs. We validate the usefulness of the prickliness attribute with experiments in a large set of real terrains. |
| title | Terrain prickliness: theoretical grounds for high complexity viewsheds |
| topic | Computational Geometry 68U05 |
| url | https://arxiv.org/abs/2103.06696 |