Visibility Algorithms on Triangulated Digital Terrain Models

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.

[1]  Ketan Mulmuley,et al.  An efficient algorithm for hidden surface removal , 1989, SIGGRAPH.

[2]  Jeffrey Scott Vitter,et al.  A Simplified Technique for Hidden-Line Elimination in Terrains , 1992, STACS.

[3]  John H. Reif,et al.  An efficient output-sensitive hidden surface removal algorithm and its parallelization , 1988, SCG '88.

[4]  Herbert Edelsbrunner,et al.  The upper envelope of piecewise linear functions: Tight bounds on the number of faces , 1989, Discret. Comput. Geom..

[5]  大野 義夫,et al.  Computer Graphics : Principles and Practice, 2nd edition, J.D. Foley, A.van Dam, S.K. Feiner, J.F. Hughes, Addison-Wesley, 1990 , 1991 .

[6]  Leonidas J. Guibas,et al.  Fractional Cascading: A Data Structuring Technique with Geometric Applications , 1985, ICALP.

[7]  Ferenc Dévai,et al.  Quadratic bounds for hidden line elimination , 1986, SCG '86.

[8]  Leila De Floriani,et al.  A Hierarchical Triangle-Based Model for Terrain Description , 1992, Spatio-Temporal Reasoning.

[9]  Michael McKenna.  Worst-case optimal hidden-surface removal , 1987, TOGS.

[10]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[11]  Mark de Berg,et al.  Efficient ray shooting and hidden surface removal , 1991, SCG '91.

[12]  M. Goodchild,et al.  Coverage problems and visibility regions on topographic surfaces , 1990 .

[13]  Micha Sharir,et al.  Output-sensitive hidden surface removal , 1989, 30th Annual Symposium on Foundations of Computer Science.

[14]  Micha Sharir,et al.  The upper envelope of piecewise linear functions and the boundary of a region enclosed by convex plates: Combinatorial analysis , 2011, Discret. Comput. Geom..

[15]  Jay Lee.  Analyses of visibility sites on topographic surfaces , 1991, Int. J. Geogr. Inf. Sci..

[16]  Richard Cole,et al.  Visibility Problems for Polyhedral Terrains , 2018, J. Symb. Comput..

[17]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[18]  Alfred Schmitt,et al.  Time and Space Bounds for Hidden Line and Hidden Surface Algorithms , 1981, Eurographics.

[19]  John Hershberger,et al.  Finding the Upper Envelope of n Line Segments in O(n log n) Time , 1989, Inf. Process. Lett..

[20]  Mikhail J. Atallah,et al.  Dynamic computational geometry , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[21]  Leonidas J. Guibas,et al.  The upper envelope of piecewise linear functions: Algorithms and applications , 2015, Discret. Comput. Geom..

[22]  Ralf Hartmut Güting,et al.  New algorithms for special cases of the hidden line elimination problem , 1987, Comput. Vis. Graph. Image Process..