In this paper, we present a model based on a collection of nested horizons to describe the visibility of a terrain with respect to a viewpoint. We introduce first a formalization of mathematical and digital terrain models, and some background notions for visibility problems on terrains. Then, we define horizons and shadows on a polyhedral terrain, and introduce a few horizon-based visibility maps of a terrain. Finally, we present two algorithms for building the nested horizons on a polyhedral terrain. An application to the solution of point-to-point visibility queries are briefly discussed.
CITATION STYLE
De Floriani, L., & Magillo, P. (1993). Computing visibility maps on a digital terrain model. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 716 LNCS, pp. 248–269). Springer Verlag. https://doi.org/10.1007/3-540-57207-4_17
Mendeley helps you to discover research relevant for your work.