Computing highly occluded paths on a terrain


Journal Article

Understanding the locations of highly occluded paths on a terrain is an important GIS problem. In this paper we present a model and a fast algorithm for computing highly occluded paths on a terrain. It does not assume the observer locations to be known and yields a path likely to be occluded under a rational observer strategy. We present experimental results that examine several different observer strategies. The repeated visibility map computations necessary for our model is expedited using a fast algorithm for calculating approximate visibility maps that models the decrease in observational fidelity as distance increases. The algorithm computes a multiresolution approximate visibility map and makes use of a graphics processing unit (GPU) to speed up computation. We present experimental results on terrrain data sets with up to 144 million points. © 2013 ACM.

Full Text

Duke Authors

Cited Authors

  • Lebeck, N; Mølhave, T; Agarwal, PK

Published Date

  • December 1, 2013

Published In

  • Gis: Proceedings of the Acm International Symposium on Advances in Geographic Information Systems

Start / End Page

  • 14 - 23

Digital Object Identifier (DOI)

  • 10.1145/2525314.2525363

Citation Source

  • Scopus