نتایج جستجو برای: 304peak viewshed

تعداد نتایج: 150  

Journal: :ACM Transactions on Spatial Algorithms and Systems 2016

Journal: :Forests 2021

This paper demonstrates the possibilities of a Geographical Information System (GIS) for investigating and explicating spatial variation short-range viewshed aesthetic appeal in World Heritage coastal dune forest area. The study pursues following objectives: (1) develop trial GIS-based algorithm computing Aesthetic Appeal Index Short-Range Viewshed (?); (2) deliver an output map showing compute...

2009
Martin Tomko Friedjoff Trautwein Ross Purves

Image retrieval of landscape photographs requires accurate annotation using multi-faceted descriptions relating to the subject and content of the photograph. The subject of such photographs is dominantly the terrain and spatial objects visible from the photographer’s viewpoint. While some spatial objects in the background may be obscured by foreground vegetation, other visible spatial objects b...

2010
K. Nackaerts G. Govers L. Loots

In archaeological research, visibility analysis is usually based on binary viewshed maps. However, Digital Elevation Models inherently contain errors due to inaccuracies in the original topographic data and the data structure used. Therefore the binary classification will be subject to an unknown amount of error. It would be more appropriate to use a method for visibility calculation which allo...

2013

We present an approach to determine the credibility of content provided within a visual VGI source such as Flickr. We propose analysing the variability of selected user and photo metadata of geotagged Flickr photos with the location correctness of these images, which is our reference quality measure. These observed user and photo metadata can help to infer the credibility of contributors.

1995
ANSEL TENG Esther M. Arkin

The best known output-sensitive sequential algorithm for computing the viewshed on a polyhedral terrain from a given viewpoint was proposed by Katz, Overmars, and Sharir 10 , and achieves time complexity O((k + nn(n)) log n) where n and k are the input and output sizes respectively, and () is the inverse Ackermann's function. In this paper, we present a parallel algorithm that is based on the w...

2006
W. Randolph Franklin Christian Vogt

This paper demonstrates a toolkit for multiple observer siting to maximize their joint viewshed, on high-resolution gridded terrains, up to 2402 × 2402, with the viewsheds’ radii of up to 1000. It shows that approximate (rather than exact) visibility indexes of observers are sufficient for siting multiple observers. It also shows that, when selecting potential observers, geographic dispersion i...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید