Discrete visibility problems and graph algorithms

International Journal of Geographical Information Science

Volumn 11, Issue 2, 1997, Pages 139-161

  Puppo, Enrico ^a   Marzano, Paola ^b  

^a CNR   (Italy)

^b UNIVERSITY OF GENOA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM; DISCRETE VISIBILITY; GIS; GRAPH; TOPOGRAPHIC SURFACE;

EID: 0030759407     PISSN: 13658816     EISSN: 13623087     Source Type: Journal    
DOI: 10.1080/136588197242437     Document Type: Article

References (24)

1. Agarwal, P. Kand Sharir, M1994, On the number of views of polyhedral terrains. Discrete and Computational Geometry, 12, 177-182.
2. Aho, A. V., Hopcroft, J. E., and Ullman, J. D., 1983, Data structures and algorithms (Reading, MA, USA: Addison-Wesley), pp. 203-208.
3. Cole, R., and Sharir, M., 1989, Visibility problems for polyhedral terrains. Journal of Symbolic Computing, 7, 11-30.
4. Cormen, T.H., Leiserson, C. E., and Rivest, R.L.,1990,Introduction to Algorithms (Cambridge, USA: MIT Press).
5. De Floriani, L., and Magillo, P., 1994, Visibility algorithms on triangulated terrain models. International Journal of Geographical Information Systems, 8, 13-42.
6. De FLoriani, L., Marzano, P., and Puppo, E., 1994, Line-of-sight communication on terrain models. International Journal of Geographical Information Systems, 8, 329-342.
7. Duin, C., and Volgenant, W., 1987, Some generalizations of the Steiner problem in graphs. Networks, 17, 353-364.
8. Even, S., 1979, Graph Algorithms (Potomac, MD: Computer Science Press).
9. Fisher, P., 1994, Stretching the viewshed. In Proceedings 6th International Symposium on Spatial Data Handling, Advances in GIS, edited by T. C. Waugh and R. G. Healey (London: Taylor & Francis), pp. 725-738.
10. Garey, M. R., and Johnson, D. S., 1979, Computers and Intractability: A guide to the theory of NP-completeness (San Francisco, CA: Freeman & Co.).
11. Gigus, Z., Canny, R., and Seidel, R., 1991, Efficiently computing and representing aspect graphs of polyhedral objects. I.E.E.E. Transactions on Pattern Analysis and Machine Intelligence, 13, 542-551.
12. Gondran, M., and Minoux, M., 1986, Graphs and Algorithms (New York: John Wiley & Sons).
13. Kou, L., Markowsky, G., and Bermann, L., 1981, A fast algorithm for Steiner Tree. Acta Informatica, 15, 141-149.
14. Lee, J., 1991, Analyses of visibility sites on topographic surfaces. International Journal of Geographical Information Systems, 5, 413-429.
15. van Leeuwen, J., 1990, Graph algorithms. In Handbook of Theoretical Computer Science— Volume A: Algorithms and Complexity, edited by J. van Leeuwen (Amsterdam: Elsevier), pp. 525-631.
16. Nagy, G., 1994, Terrain visibility. Computers and Graphics, 18, 763-773.
17. Preparata, F. P., and Shamos, M. I., 1985, Computational geometry: an introduction (New York: Springer-Verlag).
18. Reingold, E. M., Nievergelt, J., and Deo, N., 1977, Combinatorial Algorithms: Theory and Practice (Englewood Cliffs: Prentice Hall).
19. Sharir, M., 1988, The shortest watchtower and related problems for polyhedral terrains. Information Processing Letters, 29, 265-270.
20. Tarjan, R. E., 1983, Data Structures and Network Algorithms (Philadelphia: Society for Industrial and Applied Mathematics).
21. Teng, Y. A., 1993, Parallel processing of geometric structures: visibility and triangulation algorithms, PhD Thesis, University of Maryland, also published as Technical Report CAR-TR-680, Center for Automation Research, University of Maryland.
22. Teng, Y. A., DeMenthon, D., and Davis, L. S., 1992, Stealth terrain navigation for multivehicle path planning. International Journal of Pattern Recognition and Artificial Intelligence, 6, 395-415.
23. Winter, P., 1987, Steiner problems in network: a survey. Networks, 17, 129-167.
24. Wong, R. T., 1984, A dual ascent approach for Steiner tree problems on a directed graph. Mathematical Programming, 28, 271-287.