A Comparison of I/O-Efficient Algorithms for Visibility Computation on Massive Grid Terrains

10/03/2018
by   Herman Haverkort, et al.
0

Given a grid terrain T and a viewpoint v, the viewshed of v is the set of grid points of T that are visible from v. To decide whether a point p is visible one needs to interpolate the elevation of the terrain along the line-of-sight vp. Existing viewshed algorithms differ widely in what points they chose to interpolate and how they interpolate the terrain. These choices crucially affect the running time and accuracy of the algorithms. This paper describes I/O-efficient algorithms for computing visibility maps in a couple of different models. First, we describe two algorithms that sweep the terrain by rotating a ray around the viewpoint while maintaining the terrain profile along the ray. Second, we describe an algorithm which sweeps the terrain centrifugally, growing a star-shaped region around the viewpoint while maintaining the approximate visible horizon of the terrain within the swept region. Our last two algorithms are based on computing and merging horizons. All algorithms are I/O-efficient in the I/O-model of Aggarwal and Vitter. We present an experimental analysis on large terrains obtained from NASA SRTM data. All our algorithms are scalable to volumes of data that are over 50 times larger than main memory. Our main finding is that, in practice, horizons are significantly smaller than their theoretical worst case bound, which makes horizon-based approaches very fast. Our last two algorithms, which compute the most accurate viewshed, turn out to be very fast in practice, although their worst-case bound is inferior.

READ FULL TEXT
research
01/12/2023

On Voronoi visibility maps of 1.5D terrains with multiple viewpoints

Given an n-vertex 1.5D terrain and a set of m<n viewpoints, the Vorono...
research
01/21/2018

Efficient algorithms for computing a minimal homology basis

Efficient computation of shortest cycles which form a homology basis und...
research
03/11/2021

Terrain prickliness: theoretical grounds for low complexity viewsheds

An important task when working with terrain models is computing viewshed...
research
11/05/2020

Visibility Extension via Reflection

This paper studies a variant of the Art-gallery problem in which "walls"...
research
08/13/2018

Faster and More Robust Mesh-based Algorithms for Obstacle k-Nearest Neighbour

We are interested in the problem of finding k nearest neighbours in the ...
research
03/27/2018

A New Optimal Algorithm for Computing the Visibility Area of a simple Polygon from a Viewpoint

Given a simple polygon P of n vertices in the Plane. We study the pr...
research
01/26/2021

New Algorithms for Computing Field of Vision over 2D Grids

The aim of this paper is to propose new algorithms for Field of Vision (...

Please sign up or login with your details

Forgot password? Click here to reset