Visibility algorithms on triangulated digital terrain models

International Journal of Geographical Information Systems

Volumn 8, Issue 1, 1994, Pages 13-41

  De Flor1ani, Leila ^a   Magillo, Paola ^a  

^a UNIVERSITY OF GENOA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM; DTM; TRIANGULATION; VISIBILITY;

EID: 0028330572     PISSN: 02693798     EISSN: None     Source Type: Journal    
DOI: 10.1080/02693799408901985     Document Type: Article

References (31)

1. ALLEN, D. L., 1983, Visibility in two-and-half dimensions. Unpublished Master’s thesis, Rensselaer Polytechnic Institute, Troy, New York.
2. Atallah, M., 1989, Dynamic computational geometry. In Proceedings, 24th Symposium on Foundations of Computer Science, (Baltimore: I.E.E.E. Computer Society), pp. 92-99.
3. Aho, A. V., Hopcroft, J. E., and Ullman, J. D., 1974, The Design and Analysis of Computer Algorithms (Reading, MA: Addison Wesley).
4. BOISSONAT, J. D., and DOBRINDT, K, 1992, On-line construction of the upper envelope of triangles in 3P. In Acts of the 4th Canadian Conference on Computational Geometry (Newfoundland: Memorial), pp. 311-315.
5. CAZZANTI, M., DE FLORIANI, L., PUPPO, E., and NAGY, G., 1991, Visibility computation on a triangulated terrain. In Proceedings of 8th International Conference on Image Analysis and Processing, Como, September 1991 (Singapore: World Scientific), pp. 721-728.
6. CHAZELLE, B., and GUIBAS, L., 1985, Fractional cascading: a data structuring with geometric applications. Proceedings of 12th International Colloquium on Automata Languages and Programming, Lecture Notes in Computer Sciences (New York: Springer-Verlag), pp. 90-99.
7. COLE, R., and Sharir, M., 1986, Visibility problems for polyhedral terrains. Technical Report 32, Courant Institute, New York University.
8. DE BERG, M., HALPERIN, D., OVERMARS, M., SNOEYINK, J., and VAN KREVELD, M., 1991, Efficient ray shooting and hidden surface removal. Proceedings of the 7th ACM Symposium on Computational Geometry (New York: ACM Press), pp. 21-30.
9. DE FLORIANI, L., FALCIDIENO, B., NAGY, G., and PIENOVI, C., 1989, Polyhedral terrain description using visibility criteria. Institute for Applied Mathematics, National Research Council, Technical Report No. 17, October 1989.
10. DE FLORIANI, L., FALCIDIENO, B., NAGY, G., and PIENOVI, C., 1991, On sorting triangles in a Delaunay tesselation. Algorithmica (New York: Springer-Verlag), pp. 522-532.
11. DE Floriani, L., Puppo, E., and Nagy, G., 1992, Computing on a line-of-sight network on a terrain model. Symposium on Spatial Data Handling, Charleston, 3-7 August (Columbia: IGU Commission on GIS), pp. 672-61.
12. DE FLORIANI, L., and PUPPO, E., 1992, A hierarchical triangle-based model for terrain description. Proceedings of the International, Conference on GIS, Pisa, 21-23 September 1992 (Berlin: Springer-Verlag), pp. 236-251.
13. DEVAI, F., 1986, Quadratic bounds for hidden line elimination. In Proceedings of 2nd ACM Symposium on Computational Geometry (New York: ACM Press), pp. 269-275.
14. Edelsbrunner, H., Guibas, L. J., and Sharir, M., 1989, The upper envelope of piecewise linear functions: algorithms and applications. Discrete and Computational Geometry, 4, 311-336.
15. EDELSBRUNNER, H., 1989, The upper envelope of piecewise linear functions: tight bounds on the number of faces. Discrete and Computational Geometry, 4, 337-343.
16. Foley, D. J., Van Dam, A., Feine, S. K., and Hughes, J. F., 1991, Computer Graphics: Principle and Practice (Reading, MA: Addison Wesley).
17. GOODCHILD, M. F., and LEE, J., 1989, Coverage problems and visibility regions on topographic surfaces. Annals of Operations Research, 20, 175-186.
18. Guting, R. H., and Ottmann, T., 1987, New algorithms for special cases of the hidden line elimination problem. Computer Vision, Graphics, and Image Processing, 40, 188-204.
19. JUNG, D. M., 1989, Comparisons of Algorithms for Terrain Visibility. Unpublished Master’s Thesis, Renssalaer Polytechnic Institute, Troy, New York.
20. Katz, M. J., Overmars, M. H., and Sharir, M., 1991, Efficient hidden surface removal of objects with small union size. Proceedings of the 7 th ACM Symposium on Computational Geometry (New York: ACM Press), pp. 31-40.
21. HERSHELBERG, J., 1989, Finding the upper envelope of n line segments in 0(n log n) time. Information Processing Letters, 33, 169-174.
22. McKenna, M., 1987, Worst case optimal hidden surface removal. ACM Transactions on Graphics, 6, 19-28.
23. LEE, J., 1991, Analyses of visibility sites on topographic surfaces. International Journal of Geographical Information Systems, 5, 413-429.
24. Mulmuley, K., 1989, An effeicent algorithm for hidden surface removal. Computer Graphics, 23, 379-388.
25. Overmars, M., and Sharir, M., 1989, Output-sensitive hidden surface removal. In Proceedings of 30th I.E.E.E. Symposium on Foundations of Computer Science (Baltimore: I.E.E.E. Computer Society), pp. 598-603.
26. Pach, J., and Sharir, M., 1989, The upper envelope of piecewise linear functions and the boundary of a region enclosed by convex plates: combinatorial analysis. Discrete and Geometry, 4, 291-309.
27. Preparata, F. P., and Shamos, M. I., 1985, Computational Geometry: An Introduction (New York: Springer-Veriag).
28. Preparata, F. P., and Vitter, J. S., 1992, A simplified technique for hidden-line elimination in terrains. Proceedings ST ACS '92, Paris, February 1992 (New York: Springer-Veriag), pp. 135-144.
29. REIF, J. H., and SEN, S., 1988, An efficient output-sensitive hidden-surface removal algorithm and its parallelization. In Proceedings of 4th ACM Symposium on Computational Geometry (New York: ACM Press), pp. 193-200.
30. Schmitt, A., 1981, Time and space bounds for hidden line and hidden surface algorithms. Proceedings Eurographics, '81 (Amsterdam: North Holland), pp. 43-56.
31. Weiler, K. , and Atherton, P., 1977, Hidden surface removal using polygonal area sorting. In Proceedings SIGGRAPH '77, July 1977 (New York: Sole).