Algorithms for visibility computation on terrains: A survey

Environment and Planning B: Planning and Design

Volumn 30, Issue 5, 2003, Pages 709-728

  De Floriani, Leila ^a   Magillo, Paola ^a  

^a UNIVERSITY OF GENOA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM; COMMUNICATION; GIS; PLANNING METHOD; VISIBILITY;

EID: 0142122998     PISSN: 02658135     EISSN: None     Source Type: Journal    
DOI: 10.1068/b12979     Document Type: Article

References (38)

1. Attallah M, 1983, "Dynamic computational geometry", in Proceedings of the 24th IEEE Symposium on Foundations of Computer Science (IEEE Computer Society, Washington, DC) pp 92-99
2. Blelloch G E, 1990 Vector Models for Data-parallel Computing (MIT Press, Cambridge, MA)
3. Bruzzone E, De Floriani L, Magillo P, 1995, "Updating visibility information on multiresolution terrain models", in Proceedings of the Conference on Spatial Information Theory (COSIT 95) Eds A U Frank, W Kuhn (Springer, Berlin) pp 279-296
4. Cole R, Sharir M, 1989, "Visibility problems for polyhedral terrains" Journal of Symbolic Computation 17 11-30
5. De Floriani L, Magillo P, 1995, "Horizon computation on a hierarchical terrain model" The Visual Computer: An International Journal of Computer Graphics 11 134-149
6. De Floriani L, Magillo P, 1997, "Visibility computations on hierarchical triangulated terrain models" Geoinformatica 1(3) 219-250
7. De Floriani L, Magillo P, 2002, "Multiresolution mesh representation: models and data structures", in Tutorials on Multiresolution in Geometric Modelling Eds A Iske, E Quak, M S Floater (Springer, Berlin) pp 363-418
8. De Floriani L, Falcidieno B, Nagy G, Pienovi C, 1989, "Polyhedral terrain description using visibility criteria", TR, Institute for Applied Mathematics, National Research Council, Genova
9. De Floriani L, Falcidieno B, Nagy G, Pienovi C, 1991, "On sorting triangles in a Delaunay tesselation" Algorithmica 6 522-532
10. De Floriani L, Montani C, Scopigno R, 1994, "Parallelizing visibility computations on triangulated terrains" International Journal of Geographical Information Systems 8 515-532
11. Dobrindt K, Yvinec M, 1993, "Remembering conflicts in history yields dynamic algorithms", in Algorithms and Computation Eds K W Ng, P Raghavan, N V Balasubramanian, F Y L Chin (Springer, Hong Kong) pp 21-30
12. Felleman J P, Griffin C, 1990, "The role of error in GIS-based viewshed determination-a problem analysis", TR EIPP-90-2, State University of New York, Institute for Environmental Policy and Planning, Albany, NY
13. Fisher P F, 1993, "Algorithms and implementation of uncertainty in viewshed analysis" International Journal of Geographic Information Systems 7 331-347
14. Fisher P F, 1995, "An exploration of probable viewsheds in landscape planning" Environment and Planning B: Planning and Design 22 527-546
15. Fisher P F, 1996a, "Extending the applicability of viewsheds in landscape planning" Photogrammetric Engineering and Remote Sensing 62 1297-1302
16. Fisher P F, 1996b, "Reconsideration of the viewshed function in terrain modeling" Geographic Systems 3 33-58
17. Franklin W R, 2002, "Siting observers on a terrain", in Proceedings of the International Symposium on Spatial Data Handling 2002 Eds D Richardson, P van Oosterom (Springer, Berlin)
18. Franklin W R, Ray C, 1994, "Higher is not necessarily better: visibility algorithms and experiments", in Advance in GIS Research, Proceedings of the 6th International Symposium on Spatial Data Handling Eds T C Waugh, R G Healey (Taylor and Francis, London) pp 751-770
19. Hershberger J, 1989, "Finding the upper envelope of n line segments in O(n log n) time" Information Processing Letters 33 169-174
20. Katz M J, Overmars M H, Sharir M, 1991, "Efficient hidden surface removal for objects with small union size", in Proceedings of the 7th ACM Symposium on Computational Geometry (ACM Press, New York) pp 31-40
21. Kirkpatrick D G, 1983, "Optimal search in planar subdivision" SIAM Journal of Computing 12(1) 28-33
22. Lee J, 1991, "Analyses of visibility sites on topographic surfaces" International Journal of Geographical Information Systems 5 413-429
23. Lee J, Preparata F P, 1977, "Location of a point in a planar subdivision and its applications" SIAM Journal of Computing 6 594-606
24. Mills K, Fox G, Heimbach R, 1992, "Implementing an intervisibility analysis model on a parallel computing system" Computers and Geosciences 18 1047-1054
25. Nagy G, 1994, "Terrain visibility" Computer and Graphics 18 763-773
26. O'Sullivan D, Turner A, 2001, "Visibility graphs and landscape visibility analysis" International Journal of Geographic Information Science 15 221-237
27. Preparata F P, Shamos M I, 1985 Computational Geometry: An Introduction (Springer, Berlin)
28. Preparata F P, Vitter J S, 1992, "A simplified technique for hidden-line elimination in terrains", in STACS '92 Eds A Finkel, M Jantzen (Springer, Berlin) pp 135-144
29. Puppo E, Marzano P, 1997, "Discrete visibility problems and graph algorithms" International Journal of Geographical Information Systems 11 139-161
30. Rallings P J, Ware J A, Kidner D B, 1998, "Parallel distributed viewshed analysis", in Proceedings of ACMGIS '98 (ACM Press, New York) pp 151-156
31. Reif J, Sen S, 1988, "An efficient output-sensitive hidden surface removal algorithm and its parallelization", in Proceedings of the 4th ACM Symposium on Computational Geometry (ACM Press, New York) pp 193-200
32. Sarnak N, Tarjan R E, 1986, "Planar point location using persistent search trees" Communications of the ACM 29(7) 669-679
33. Shapira A, 1990, "Visibility and terrain labelling", masters thesis, Department of Electrical, Computer, and System Engineering, Rensselaer Polytechnic Institute, Troy, NY
34. Sorensen P, Lanter D, 1993, "Two algorithms for determining partial visibility and reducing data structure induced error in viewshed analysis" Photogrammetric Engineering and Remote Sensing 59 1129-1132
35. Stewart A J, 1998, "Fast horizon computation at all points of a terrain with visibility and shadow applications" IEEE Transactions on Visualization and Computer Graphics 4(l) 82-93
36. Teng Y A, De Menthon D, Davis L S, 1993, "Region-to-region visibility analysis using data parallel machines" Concurrency: Practice and Experience 5 379-406
37. Teng Y A, Mount D, Puppo E, Davis L S, 1995, "Parallelizing an algorithm for visibility on polyhedral terrain" International Journal of Computational Geometry and Applications 7(l -2) 75-84
38. Van Kreveld M, 1996, "Variations on sweep algorithms: efficient computation of extended viewsheds and class intervals", in Proceedings of the Symposium on Spatial Data Handling '96 (Eds M J Kraak, M Molenaar, Faculty of Geodetic Engineering, Delft University of Technology, Delft) pp 13A.15-13A.27