The graph Voronoi diagram with applications

Networks

Volumn 36, Issue 3, 2000, Pages 156-163

  Erwig, Martin ^a  

^a Oregon State University   (United States)

Author keywords

Dijkstra's algorithm; Shortest path; Voronoi diagram

Indexed keywords

EID: 0034288747     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/1097-0037(200010)36:3<156::AID-NET2>3.0.CO;2-L     Document Type: Article

References (15)

1. [1] A. V. Aho, J. E. Hopcroft, and J. D. Ullman, Data structures and algorithms, Addison-Wesley, Reading, MA 1983.
2. [2] H. Alt and C. K. Yap, Algorithmic aspects of motion planning: A tutorial (Part 2), Alg Rev 1 (1990), 61-77.
3. [3] F. Aurenhammer, Voronoi diagrams - A survey of a fundamental geometric data structure, ACM Comput Sur 23 (1991), 345-405.
4. [4] F. Buckley and F. Harary, Distance in graphs, Addison-Wesley, Reading, MA 1989.
5. [5] N. Deo and C. Pang, Shortest-path algorithms: Taxonomy and annotation, Networks 14 (1984), 275-323.
6. [6] M. Erwig, Encoding shortest paths in spatial networks, Networks 26 (1995), 291-303.
7. [7] M. Erwig and R. H. Güting, Explicit graphs in a functional model for spatial databases, IEEE Trans Knowledge Data Eng 5 (1994), 787-804.
8. [8] M. L. Fredman and R. E. Tarjan, Fibonacci heaps and their uses in improved network optimization algorithms, J ACM 34 (1987), 596-615.
9. [9] S. L. Hakimi, Optimum distribution of switching centers in a communication network and some related graph theoretic problems, Oper Res 13 (1965), 462-475.
10. [10] G. Y. Handler and P. B. Mirchandani, Location on networks: Theory and algorithms, MIT Press, 1979.
11. [11] R. Klein, Concrete and abstract Voronoi diagrams, LNCS 400, Springer-Verlag, Berlin 1989.
12. [12] R. Klein and D. Wood, Voronoi diagrams based on general metrics in the plane, Symp on Theoretical Aspects of Computer Science, 1988, pp. 281-291.
13. [13] K. Mehlhorn, A faster approximation algorithm for the steiner problem in graphs, Info Process Lett 27 (1988), 125-128.
14. [14] F. P. Preparata and M. I. Shamos, Computational geometry, Springer-Verlag, Berlin 1985.
15. [15] M. I. Shamos and D. Hoey, Closest point problems, IEEE Symp on Foundations of Computer Science, 1975, pp. 151-162.