Studying (non-planar) road networks through an algorithmic lens

GIS: Proceedings of the ACM International Symposium on Advances in Geographic Information Systems

Volumn , Issue , 2008, Pages 125-134

  Eppstein, David ^a   Goodrich, Michael T ^a  

^a Irvine   (United States)

Author keywords

Algorithmic lens; Circle arrangements; Disk neighborhood systems; Multiscale dispersed graphs; Road networks; Shortest paths; Voronoi diagrams

Indexed keywords

MULTISCALES; NEIGHBORHOOD SYSTEMS; ROAD NETWORK; SHORTEST PATH; SHORTEST PATHS; VORONOI DIAGRAMS;

ALGORITHMS; DISKS (STRUCTURAL COMPONENTS); GEOGRAPHIC INFORMATION SYSTEMS; GRAPH THEORY; GRAPHIC METHODS; INFORMATION SYSTEMS; LENSES; OPTICAL INSTRUMENTS; ROADS AND STREETS;

MOTOR TRANSPORTATION;

EID: 70449727218     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1463434.1463455     Document Type: Conference Paper

References (42)

1. L. Aceto and A. Ingolfsdottir. Computer Scientist: 21st Century Renaissance Man, 2007. http://www.ru.is/faculty/luca/PAPERS/renaissance-man.pdf.
2. N. M. Amato, M. T. Goodrich, and E. A. Ramos. A randomized algorithm for triangulating a simple polygon in linear time. Discrete Comput. Geom., 26(2):245-265, 2001.
3. D. Armon and J. Reif. A dynamic separator algorithm. In Proc. 3rd Workshop Algorithms Data Struct., volume 709 of Lecture Notes Comput. Sci., pages 107-118. Springer-Verlag, 1993.
4. S. Arora and B. Chazelle. Is the thrill gone? Commun. ACM, 48(8):31-33, 2005.
5. F. Aurenhammer. Voronoi diagrams: A survey of a fundamental geometric data structure. ACM Comput. Surv., 23(3):345-405, Sept. 1991.
6. F. Aurenhammer and R. Klein. Voronoi diagrams. In J.-R. Sack and J. Urrutia, editors, Handbook of Computational Geometry, pages 201-290. Elsevier Science Publishers B.V. North-Holland, Amsterdam, 2000.
7. M. Batty and P. Longley. Fractal Cities: A Geometry of Form and Function. Academic Press, 1994.
8. P. Bose and L. Devroye. On the stabbing number of a random Delaunay triangulation. Comput. Geom. Theory Appl., 36(2):89-105, 2007.
9. B. Chazelle. Triangulating a simple polygon in linear time. Discrete Comput. Geom., 6(5):485-524, 1991.
10. B. Chazelle. Could Your iPod Be Holding the Greatest Mystery in Modern Science? MAA Math Horizons (Codes, Cryptography, and National Security), 13, 2006. http://www.cs.princeton.edu/~chazelle/pubs/ipod.pdf.
11. B. Chazelle. The Algorithm: Idiom of Modern Science, 2006. http://www.cs.princeton.edu/~chazelle/pubs/algorithm.html.
12. Y. H. Chou. Exploring Spatial Analysis in GIS. Onword Press, 1996.
13. A. Condon. RNA Molecules: Glimpses Through an Algorithmic Lens. In LATIN 2006: Theoretical Informatics, volume 3887 of Springer LNCS, pages 8-10. Springer, 2006.
14. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms. MIT Press, Cambridge, MA, 2nd edition, 2001.
15. D. Eppstein. Setting parameters by example. SIAM J. Computing, 32(3):643-653, 2003.
16. D. Eppstein, G. L. Miller, and S.-H. Teng. A deterministic linear time algorithm for geometric separators and its applications. In Proc. 9th Annu. ACM Sympos. Comput. Geom., pages 99-108, 1993.
17. M. Erwig. The Graph Voronoi Diagram with Applications. Networks, 36(3):156-163, 2000.
18. M. L. Fredman and R. E. Tarjan. Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM, 34:596-615, 1987.
19. A. V. Goldberg. Scaling algorithms for the shortest paths problem. In SODA '93: Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms, pages 222-231, Philadelphia, PA, USA, 1993. Society for Industrial and Applied Mathematics.
20. A. V. Goldberg and C. Harrelson. Computing the shortest path: A* search meets graph theory. In SODA '05: Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms, pages 156-165, Philadelphia, PA, USA, 2005. Society for Industrial and Applied Mathematics.
21. M. T. Goodrich. Planar separators and parallel polygon triangulation. J. Comput. Syst. Sci., 51(3):374-389, 1995.
22. M. T. Goodrich and R. Tamassia. Algorithm Design: Foundations, Analysis, and Internet Examples. John Wiley & Sons, New York, NY, 2002.
23. M. R. Henzinger, P. Klein, S. Rao, and S. Subramanian. Faster shortest-path algorithms for planar graphs. J. Comput. Syst. Sci., 55(1):3-23, 1997.
24. M. Holzer, F. Schulz, D. Wagner, and T. Willhalm. Combining speed-up techniques for shortest-path computations. J. Exp. Algorithmics, 10:2.5, 2005.
25. G. A. Klunder and H. N. Post. The shortest path problem on large-scale real-road networks. Networks, 48(4):182-194, 2006.
26. P. Koebe. Kontaktprobleme der konformen Abbildung. Ber. Verh. Sächs. Akademie der Wissenschaften Leipzig, Math.-Phys. Klasse, 88:141-164, 1936.
27. R. J. Lipton and R. E. Tarjan. A separator theorem for planar graphs. SIAM J. Appl. Math., 36:177-189, 1979.
28. K. Mehlhorn. A Faster Approximation Algorithm for the Steiner Problem in Graphs. Information Processing Letters, 27:125-128, 1988.
29. U. Meyer. Single-source shortest-paths on arbitrary directed graphs in linear average-case time. In SODA '01: Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms, pages 797-806, Philadelphia, PA, USA, 2001. Society for Industrial and Applied Mathematics.
30. G. L. Miller. Finding small simple cycle separators for 2-connected planar graphs. J. Comput. Syst. Sci., 32(3):265-279, 1986.
31. G. L. Miller, S.-H. Teng, W. Thurston, and S. A. Vavasis. Geometric separators for finite element meshes. SIAM J. Sci. Comput., 19(2):364-386, 1995.
32. G. L. Miller, S.-H. Teng, W. Thurston, and S. A. Vavasis. Separators for sphere-packings and nearest neighbor graphs. J. ACM, 44:1-29, 1997.
33. B. Mohar. A polynomial time circle packing algorithm. Discrete Math., 117:257-263, 1993.
34. C. Papadimitriou. The Algorithmic Lens: How the Computational Perspective is Transforming the Sciences, 2007. FCRC CCC presentation, http://lazowska.cs. washington.edu/fcrc/Christos.FCRC.pdf.
35. R. Raman. Recent results on the single-source shortest paths problem. SIGACT News, 28(2):81-87, 1997.
36. P. Sanders and D. Schultes. Highway Hierarchies Hasten Exact Shortest Path Queries. In Proceedings 17th European Symposium on Algorithms (ESA), volume 3669 of Springer LNCS, pages 568-579. Springer, 2005.
37. R. Sedgewick and J. S. Vitter. Shortest paths in Euclidean graphs. Algorithmica, 1:31-48, 1986.
38. D. D. Sleator and R. E. Tarjan. A data structure for dynamic trees. J. Comput. Syst. Sci., 26(3):362-381, 1983.
39. D. A. Spielman and S.-H. Teng. Disk packings and planar separators. In Proc. 12th Annu. ACM Sympos. Comput. Geom., pages 349-358, 1996.
40. M. Thorup. Undirected single-source shortest paths with positive integer weights in linear time. J. ACM, 46(3):362-394, 1999.
41. J. M. Wing. Computational thinking. Commun. ACM, 49(3):33-35, 2006.
42. F. B. Zhan and C. E. Noon. Shortest Path Algorithms: An Evaluation Using Real Road Networks. Transportation Science, 32(1):65-73, 1998.