Approximate multi-visibility map computation

A multi-visibility map is the subdivision of the domain of a terrain into different regions that, according to different criteria, encode the visibility with respect to a set of view elements. We present an algorithm for computing approximate multi-visibility maps for a terrain, modeled as a TIN, with respect to a set of view segments. Our approach is based on an algorithm that reconstructs an approximation of an unknown planar subdivision from information gathered from linear probes of the subdivision.

[1]  Leila De Floriani,et al.  Visibility Algorithms on Triangulated Digital Terrain Models , 1994, Int. J. Geogr. Inf. Sci..

[2]  Leila De Floriani,et al.  Applications of Computational Geometry to Geographic Information Systems , 2000, Handbook of Computational Geometry.

[3]  Sherif Ghali.  Computation and maintenance of visibility and shadows in the plane , 1998 .

[4]  Herbert Solomon,et al.  Geometric Probability , 1978, CBMS-NSF regional conference series in applied mathematics.

[5]  Binhai Zhu,et al.  Three Dimensional Weak Visibility: Complexity and Applications , 1995, COCOON.

[6]  Robert L. Grossman,et al.  Visibility with a moving point of view , 1994, SODA '90.

[7]  Marc J. van Kreveld,et al.  Region Intervisibility in Terrains , 2007, Int. J. Comput. Geom. Appl..

[8]  Marc J. van Kreveld,et al.  Digital Elevation Models and TIN Algorithms , 1996, Algorithmic Foundations of Geographic Information Systems.