Skip to main content
SpringerLink
Log in
Book cover

International Conference on Spatial Information Theory

COSIT 1995: Spatial Information Theory A Theoretical Basis for GIS pp 279–296Cite as

Updating visibility information on multiresolut ion terrain models

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 988))

Abstract

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.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Agarwal, P.K., Sharir, M.: Applications of a New Space Partitioning Technique. Discrete and Computational Geometry 9 (1986) 11–38.

    Google Scholar 

  2. Atallah, M.: Dynamic computational geometry. Proceedings 24th Symposium on Foundations of Computer Science (1983) 92–99.

    Google Scholar 

  3. Bertolotto, M., De Floriani, L., Marzano, P.: An efficient representation for pyramidal terrain models. Proceedings 2nd ACM Symposium on Advances in GIS (1994) 129–136.

    Google Scholar 

  4. Bertolotto, M., De Floriani, L., Marzano, P.: A unifying framework for multilevel description of spatial data. These Proceedings.

    Google Scholar 

  5. Boissonnat, J.D., Devillers, O., Schott, R., Taillaud, M., Yvinec, M.: Application of random sampling to on-line algorithms in computational geometry. Discrete and Computational Geometry 8 (1992) 51–71.

    Google Scholar 

  6. Boissonnat, J.D., Dobrindt, K.: On-Line construction of the upper envelope of triangles in ℝ3. Proceedings 4th Canadian Conference on Computational Geometry (1992) 311–315.

    Google Scholar 

  7. Boissonnat, J.D., Yvinec, M.: Structures et algorithmes géométriques (1994). In preparation.

    Google Scholar 

  8. Cazzanti, M., De Floriani, L., Nagy, G., Puppo, E.: Visibility computation on a triangulated terrain. Progress in Image Analysis and Processing II (1991) 721–728.

    Google Scholar 

  9. Chen, Z.T., Tobler, W.R.: Quadtree representation of digital terrain. Proceedings Autocarto (1986) 475–484.

    Google Scholar 

  10. Clarkson, K.L., Shor, P.W.: Application of random sampling in computer geometry. Discrete and Computational Geometry 4 (1989) 387–421.

    Google Scholar 

  11. Cole, R., Sharir, M.: Visibility problems for polyhedral terrains. Journal of Symbolic Computation 17 (1989) 11–30.

    Google Scholar 

  12. De Berg, M., Halperin, D., Overmars, M., Snoeyink, J., Van Kreveld, M.: Efficient ray shooting and hidden surface removal. Algorithmica: An International Journal in Computer Science 12 (1994) 30–53.

    Google Scholar 

  13. De Floriani, L., Puppo, E.: A hierarchical triangle-based model for terrain description. Theories and Methods of Spatio-Temporal Reasoning in Geographic Space (1992) 236–251.

    Google Scholar 

  14. De Floriani, L., Magillo, P.: Horizon Computation on a Hierarchical Triangulated Terrain Model. The Visual Computer: An International Journal of Computer Graphics 11 (1995) 134–149.

    Google Scholar 

  15. Devai, F.: Quadratic bounds for hidden line elimination. Proceedings 2nd ACM Symposium on Computational Geometry (1986) 269–275.

    Google Scholar 

  16. Edelsbrunner, H., Guibas, L.J., Sharir, M.: The upper envelope of piecewise linear functions: algorithms and applications. Discrete and Computational Geometry 4 (1989) 311–336.

    Google Scholar 

  17. Gomez, D., Guzman, A.: Digital model for three-dimensional surface representation. Geo-processing 1 (1979) 53–70.

    Google Scholar 

  18. Katz, M.J., Overmars, M.H., Sharir, M.: Efficient hidden surface removal for objects with small union size. Proceedings 7th ACM Symposium on Computational Geometry (1991) 31–40.

    Google Scholar 

  19. McKenna, M.: Worst case optimal hidden surface removal. ACM Transactions on Graphics 6 (1987) 19–28.

    Google Scholar 

  20. Hershberger, J.: Finding the upper envelope of n line segments in O(n log n) time. Information Processing Letters 33 (1989) 169–174.

    Google Scholar 

  21. Overmars, M., Sharir, M.: Output-sensitive hidden surface removal. Proceedings 30th IEEE Symposium on Foundations of Computer Science (1989) 598–603.

    Google Scholar 

  22. Ponce, J., Faugeras, O.: An object-centered hierarchical representation for 3D objects: the prism tree. Computer Vision, Graphics and Image Processing 38 (1987) 1–28.

    Google Scholar 

  23. Preparata, F.P., Shamos, M.I.: Computational Geometry: An Introduction (1985), Springer Verlag.

    Google Scholar 

  24. Reif, J.H., Sen, S.: An efficient output-sensitive hidden-surface removal algorithm and its parallelization. Proceedings 4th ACM Symposium on Computational Geometry (1988) 193–200.

    Google Scholar 

  25. Samet, H., Sivan, R.: Algorithms for constructing quadtree surface maps. Proceedings 5th International Symposium on Spatial Data Handling (1992) 361–370.

    Google Scholar 

  26. Scarlatos, L.L., Pavlidis, T.: Hierarchical triangulation using cartographic coherence. Graphical Models and Image Processing 54 (1992) 147–161.

    Google Scholar 

  27. Schmitt, A.: Time and space bounds for hidden line and hidden surface algorithms. Proceedings Eurographics (1981) 43–56.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Information and Computer Science Department (DISI), University of Genova, Viale Benedetto XV, 3, 16132, Genova, Italy

    Paola Magillo, Leila De Floriani & Elisabetta Bruzzone

Authors
  1. Paola Magillo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Leila De Floriani
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Elisabetta Bruzzone
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Andrew U. Frank Werner Kuhn

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Magillo, P., De Floriani, L., Bruzzone, E. (1995). Updating visibility information on multiresolut ion terrain models. In: Frank, A.U., Kuhn, W. (eds) Spatial Information Theory A Theoretical Basis for GIS. COSIT 1995. Lecture Notes in Computer Science, vol 988. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60392-1_18

Download citation

  • DOI: https://doi.org/10.1007/3-540-60392-1_18

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60392-4

  • Online ISBN: 978-3-540-45519-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation