David Eppstein
Michael T. Goodrich
ABSTRACT
A geometric graph is a graph embedded in the plane with vertices at points and edges drawn as curves (which are usually straight line segments) between those points. The average transversal complexity of a geometric graph is the number of edges of that graph that are crossed by random line or line segment.
In this paper, we study the average transversal complexity of road networks. By viewing road networks as multiscale-dispersed graphs, we show that a random line will cross the edges of such a graph O(√n) times on average. In addition, we provide by empirical evidence from experiments on the road networks of the fifty states of United States and the District of Columbia that this bound holds in practice and has a small constant factor. Combining this result with data structuring techniques from computational geometry, allows us to show that we can then do point location and ray-shooting navigational queries with respect to road networks in O(√n log n) expected time. Finally, we provide empirical justification for this claim as well.
- N. Alon and P. Erdős. Disjoint edges in geometric graphs. Discrete Comput. Geom., 4:287--290, 1989.Google Scholar
Digital Library
- B. Chazelle, H. Edelsbrunner, M. Grigni, L. Guibas, J. Hershberger, M. Sharir, and J. Snoeyink. Ray shooting in polygons using geodesic triangulations. In Proceedings of the 18th international colloquium on Automata, languages and programming, pages 661--673, New York, NY, USA, 1991. Springer-Verlag New York, Inc. Google ScholarDigital Library
- Y. H. Chou. Exploring Spatial Analysis in GIS. Onword Press, 1996.Google Scholar
- R. Cole. Searching and storing similar lists. J. Algorithms, 7:202--220, 1986. Google ScholarDigital Library
- M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf. Computational Geometry: Algorithms and Applications. Springer-Verlag, Berlin, 1997. Google ScholarDigital Library
- R. A. Dwyer. Voronoi diagrams of random lines and flats. Discrete&Computational Geometry, 17(2):123--136, 1997.Google ScholarDigital Library
- M. Edahiro, I. Kokubo, and T. Asano. A new point-location algorithm and its practical efficiency --- Comparison with existing algorithms. ACM Trans. Graph., 3(2):86--109, 1984. Google ScholarDigital Library
- H. Edelsbrunner. Algorithms in Combinatorial Geometry, volume 10 of EATCS Monographs on Theoretical Computer Science. Springer-Verlag, Heidelberg, West Germany, 1987. Google ScholarDigital Library
- D. Eppstein and M. T. Goodrich. Studying (non-planar) road networks through an algorithmic lens. In GIS '08: Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems, pages 1--10, New York, NY, USA, 2008. ACM. Google ScholarDigital Library
- D. Eppstein, M. T. Goodrich, and D. Strash. Linear-time algorithms for geometric graphs with sublinearly many crossings. In SODA '09: Proceedings of the Nineteenth Annual ACM -SIAM Symposium on Discrete Algorithms, pages 150--159, Philadelphia, PA, USA, 2009. Society for Industrial and Applied Mathematics. Google ScholarDigital Library
- I. Fáry. On straight lines representation of planar graphs. Acta Univ. Szeged. Sect. Sci. Math., 11:229--233, 1948.Google Scholar
- S. Felsner. Geometric Graphs and Arrangements. Vieweg Press, 2004.Google Scholar
- 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. Google ScholarDigital Library
- M. T. Goodrich and R. Tamassia. Dynamic ray shooting and shortest paths via balanced geodesic triangulations. In SCG '93: Proceedings of the ninth annual symposium on Computational geometry, pages 318--327, New York, NY, USA, 1993. ACM. Google ScholarDigital Library
- M. T. Goodrich and R. Tamassia. Dynamic trees and dynamic point location. SIAM J. Comput., 28(2):612--636, 1998. Google ScholarDigital Library
- S. Goudsmit. Random distribution of lines in a plane. Rev. Modern Phys., 17:321--322, 1945.Google ScholarCross Ref
- M. Holzer, F. Schulz, D. Wagner, and T. Willhalm. Combining speed-up techniques for shortest-path computations. J. Exp. Algorithmics, 10:2.5, 2005. Google ScholarDigital Library
- G. A. Klunder and H. N. Post. The shortest path problem on large-scale real-road networks. Networks, 48(4):182--194, 2006. Google ScholarDigital Library
- D. E. Knuth. Computer drawn flowcharts. Commun. ACM, 6, 1963. Google ScholarDigital Library
- R. E. Miles. Random polygons determined by random lines in a plane. Proc. Nat. Acad. Sci. U.S.A., 52:901--907, 1964.Google ScholarCross Ref
- J. O'Rourke. Art Gallery Theorems and Algorithms. The International Series of Monographs on Computer Science. Oxford University Press, New York, NY, 1987. Google ScholarDigital Library
- J. Pach. Geometric graph theory. In Surveys in Combinatorics, volume 267 of Lecture Notes Series, pages 167--200. Cambridge University Press, 1999.Google Scholar
- J. Pach. Geometric graph theory. In J. E. Goodman and J. O'Rourke, editors, Handbook of Discrete and Computational Geometry, chapter 10, pages 219--238. CRC Press LLC, 2nd edition, 2004.Google Scholar
- J. Pach. Towards a Theory of Geometric Graphs, volume 342 of Contemporary Mathematics. American Mathematical Society, 2004.Google Scholar
- F. P. Preparata. A new approach to planar point location. SIAM J. Comput., 10(3):473--482, 1981.Google ScholarCross Ref
- F. P. Preparata. Planar point location revisited. Internat. J. Found. Comput. Sci., 1(1):71--86, 1990.Google ScholarCross Ref
- F. P. Preparata and M. I. Shamos. Computational Geometry: An Introduction. Springer-Verlag, 3rd edition, Oct. 1990. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- N. Sarnak and R. E. Tarjan. Planar point location using persistent search trees. Commun. ACM, 29(7):669--679, July 1986. Google ScholarDigital Library
- R. Sedgewick and J. S. Vitter. Shortest paths in Euclidean graphs. Algorithmica, 1:31--48, 1986. Google ScholarDigital Library
- S.-H. Teng. Combinatorial aspects of geometric graphs. Comput. Geom. Theory Appl., 9:277--287, 1998. Google ScholarDigital Library
- W. T. Tutte. Convex representations of graphs. Proceedings London Mathematical Society, 10(38):304--320, 1960.Google ScholarCross Ref
- W. T. Tutte. How to draw a graph. Proceedings London Mathematical Society, 13(52):743--768, 1963.Google ScholarCross Ref
- F. B. Zhan and C. E. Noon. Shortest path algorithms: An evaluation using real road networks. Transportation Science, 32(1):65--73, 1998. Google ScholarDigital Library
Index Terms
- Going off-road: transversal complexity in road networks
Recommendations
Studying (non-planar) road networks through an algorithmic lens
GIS '08: Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systemsThis paper studies real-world road networks from an algorithmic perspective, focusing on empirical studies that yield useful properties of road networks that can be exploited in the design of fast algorithms that deal with geographic data. Unlike ...
Geometric Biplane Graphs II: Graph Augmentation
We study biplane graphs drawn on a finite point set $$S$$S in the plane in general position. This is the family of geometric graphs whose vertex set is $$S$$S and which can be decomposed into two plane graphs. We show that every sufficiently large point ...
On grids in topological graphs
SCG '09: Proceedings of the twenty-fifth annual symposium on Computational geometryA topological graph is a graph drawn in the plane with vertices represented by points and edges as arcs connecting its vertices. A k-grid in a topological graph is a pair of subsets of the edge set, each of size k, such that every edge in one subset ...
Comments