Comparison of viewshed algorithms on regular spaced points

Authors:
Branko Kaučič;Borut Zalik
Affiliations:
University of Maribor, Slovenia;University of Maribor, Slovenia
Venue:
SCCG '02 Proceedings of the 18th spring conference on Computer graphics
Year:
2002

Citing 2
Cited 2

The Science of Fractal Images

The Science of Fractal Images
Curve-drawing algorithms for Raster displays

ACM Transactions on Graphics (TOG)

An optimal method for multiple observers sitting on terrain based on improved simulated annealing techniques

IEA/AIE'06 Proceedings of the 19th international conference on Advances in Applied Artificial Intelligence: industrial, Engineering and Other Applications of Applied Intelligent Systems
Low-Complexity Intervisibility in Height Fields

Computer Graphics Forum

Quantified Score

Hi-index	0.00

Visualization

Abstract

Viewshed is a basic visibility structure and represents all visible points from a given viewpoint. The paper gives a survey of non-parallel viewshed algorithms using regular spaced points. At first, a comprehensive background of the problem is given, then the existing methods (R3, R2, XDraw, method based on the line rasterisation) are introduced briefly. They have been implemented in 11 variants. Real terrain data and fractal generated terrains have been used for their comparison against spent CPU time and the accuracy of a computed visibility information.