DeepAI AI Chat
Log In Sign Up

Terrain prickliness: theoretical grounds for low complexity viewsheds

by   Ankush Acharyya, et al.

An important task when working with terrain models is computing viewsheds: the parts of the terrain visible from a given viewpoint. When the terrain is modeled as a polyhedral terrain, the viewshed is composed of the union of all the triangle parts that are visible from the viewpoint. The complexity of a viewshed can vary significantly, from constant to quadratic in the number of terrain vertices, depending on the terrain topography and the viewpoint position. In this work we study a new topographic attribute, the prickliness, that measures the number of local maxima in a terrain from all possible perspectives. We show that the prickliness effectively captures the potential of 2.5D terrains to have high complexity viewsheds, and we present near-optimal algorithms to compute the prickliness of 1.5D and 2.5D terrains. We also report on some experiments relating the prickliness of real word 2.5D terrains to the size of the terrains and to their viewshed complexity.


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...

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

Given a grid terrain T and a viewpoint v, the viewshed of v is the set o...

An Optimal Algorithm for Computing the Visibility Area of a Polygon from a Point Using Constant-Memory

Given a simple polygon P of n vertices in the Plane. We study the prob...

A PTAS for vertex guarding weakly-visible polygons - An extended abstract

In this extended abstract, we first present a PTAS for guarding the vert...

Triangle Centrality

Triangle centrality is introduced for finding important vertices in a gr...

Combining Local and Global Viewpoint Planning for Fruit Coverage

Obtaining 3D sensor data of complete plants or plant parts (e.g., the cr...

Abelian Complexity and Synchronization

We present a general method for computing the abelian complexity ρ^ ab_ ...