Visibility algorithms on triangulated digital terrain models
- 1 January 1994
- journal article
- research article
- Published by Taylor & Francis in International Journal of Geographical Information Science
- Vol. 8 (1) , 13-41
- https://doi.org/10.1080/02693799408901985
Abstract
In this paper, we address the problem of computing visibility information on triangulated digital terrain models. We present first a general introduction to digital terrain models. Visibility problems on terrains are classified, according to the kind of visibility information they compute, into point visibility, line visibility and region visibility. A survey of the state-of-the-art of the algorithms for computing the different kinds of visibility information is presented, according to the previous classification. A new algorithm for computing the horizon on a digital terrain model is also described.Keywords
This publication has 17 references indexed in Scilit:
- Fractional cascading: A data structuring technique with geometric applicationsPublished by Springer Nature ,2005
- A hierarchical triangle-based model for terrain descriptionPublished by Springer Nature ,1992
- Finding the upper envelope of n line segments in O(n log n) timeInformation Processing Letters, 1989
- Coverage problems and visibility regions on topographic surfacesAnnals of Operations Research, 1989
- The upper envelope of piecewise linear functions: Tight bounds on the number of facesDiscrete & Computational Geometry, 1989
- The upper envelope of piecewise linear functions: Algorithms and applicationsDiscrete & Computational Geometry, 1989
- An efficient algorithm for hidden surface removalACM SIGGRAPH Computer Graphics, 1989
- Visibility problems for polyhedral terrainsJournal of Symbolic Computation, 1989
- New algorithms for special cases of the hidden line elimination problemComputer Vision, Graphics, and Image Processing, 1987
- Worst-case optimal hidden-surface removalACM Transactions on Graphics, 1987