An Efficient Algorithm for the 1D Total Visibility-Index Problem and Its Parallelization

Let T be a terrain and P be a set of points on its surface. An important problem in Geographic Information Science (GIS) is computing the visibility index of a point p on P , that is, the number of points in P that are visible from p . The total visibility-index problem asks for the visibility index...

Full description

Saved in:
Bibliographic Details
Published in:The ACM journal of experimental algorithmics 2018-11, Vol.23, p.1-23
Main Authors: Afshani, Peyman, Berg, Mark De, Casanova, Henri, Karsin, Ben, Lambrechts, Colin, Sitchinava, Nodari, Tsirogiannis, Constantinos
Format: Article
Language:English
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!