Updating Visibility Information on Multiresolution Terrain Models

We propose a new randomized incremental approach to visibility update on a terrain model when varying the level of resolution. In particular, we consider visibility update on multiresolution terrain models, which encode surface descriptions at different resolution degrees. Randomized dynamic algorithms for upper envelope of triangles and segments are used for updating the visible image and the horizon, respectively. In this paper, we propose a new randomized dynamic algorithm for upper envelope of triangles, which is an extension of the semi-dynamic algorithm by Boissonnat and Dobrindt [6]. A dynamic algorithm for computing the upper envelope of segments was proposed in a previous paper [14]. It is shown that, under suitable conditions, the update of visibility information by means of these algorithms is more convenient than a complete recomputation.

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

[2]  Andrew U. Frank,et al.  Theories and Methods of Spatio-Temporal Reasoning in Geographic Space , 1992, Lecture Notes in Computer Science.

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

[4]  Micha Sharir,et al.  Applications of a new space-partitioning technique , 1993, Discret. Comput. Geom..

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

[6]  Mariette Yvinec,et al.  Applications of random sampling to on-line algorithms in computational geometry , 1992, Discret. Comput. Geom..

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

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

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

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

[11]  Theodosios Pavlidis,et al.  Hierarchical triangulation using cartographic coherence , 1992, CVGIP Graph. Model. Image Process..

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

[13]  Michela Bertolotto,et al.  A Unifying Framework for Multilevel Description of Spatial Data , 1995, COSIT.

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

[15]  Olivier D. Faugeras,et al.  An object centered hierarchical representation for 3D objects: The prism tree , 1987, Comput. Vis. Graph. Image Process..

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

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

[18]  Micha Sharir,et al.  Efficient hidden surface removal for objects with small union size , 1991, SCG '91.