The input/output complexity of sorting and related problems
Communications of the ACM
Visibility problems for polyhedral terrains
Journal of Symbolic Computation
Efficient hidden surface removal for objects with small union size
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Visibility preserving terrain simplification: an experimental study
Proceedings of the eighteenth annual symposium on Computational geometry
Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time
Journal of the ACM (JACM)
Approximating the Visible Region of a Point on a Terrain
Geoinformatica
Computational Geometry: Theory and Applications
Computing visibility on terrains in external memory
Journal of Experimental Algorithmics (JEA)
Improved visibility computation on massive grid terrains
Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Efficient viewshed computation on terrain in external memory
Geoinformatica
STXXL: standard template library for XXL data sets
ESA'05 Proceedings of the 13th annual European conference on Algorithms
| Hi-index | 0.00 |
Visibility is one of the fundamental problems on terrains. It is at the core of many applications, such as planning the placement of communication towers or watchtowers, planning buildings and roads such that they have a good view or such that they do not spoil somebody else's view, and finding routes on which you can travel while seeing a lot, or without being seen. A variety of problems pertaining to visibility have been researched in computational geometry and graphics, as well as in GIS and geospatial engineering.