The Observer Algorithm for Visibility Approximation

Authors:
Per-Magnus Olsson;Patrick Doherty
Affiliations:
Department of Computer and Information Science. Linköping University, {perol, patdo}@ida.liu.se;Department of Computer and Information Science. Linköping University, {perol, patdo}@ida.liu.se
Venue:
Proceedings of the 2008 conference on Tenth Scandinavian Conference on Artificial Intelligence: SCAI 2008
Year:
2008

Citing 2
Cited 0

Computer Graphics with OpenGL

Computer Graphics with OpenGL
A survey of visibility for walkthrough applications

IEEE Transactions on Visualization and Computer Graphics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a novel algorithm for visibility approximation that is substantially faster than ray casting based algorithms. The algorithm does not require extensive preprocessing or specialized hardware as most other algorithms do. We test this algorithm in several settings: rural, mountainous and urban areas, with different view ranges and grid cell sizes. By changing the size of the grid cells that the algorithm uses, it is possible to tailor the algorithm between speed and accuracy.