Shortest paths in Euclidean graphs
Algorithmica
Finding small simple cycle separators for 2-connected planar graphs
Journal of Computer and System Sciences
Fibonacci heaps and their uses in improved network optimization algorithms
Journal of the ACM (JACM)
A faster approximation algorithm for the Steiner problem in graphs
Information Processing Letters
A data structure for dynamic trees
Journal of Computer and System Sciences
Voronoi diagrams—a survey of a fundamental geometric data structure
ACM Computing Surveys (CSUR)
Triangulating a simple polygon in linear time
Discrete & Computational Geometry
A polynomial time circle packing algorithm
Discrete Mathematics
A deterministic linear time algorithm for geometric separators and its applications
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Fractal cities: a geometry of form and function
Fractal cities: a geometry of form and function
Planar separators and parallel polygon triangulation
Journal of Computer and System Sciences - Special issue on selected papers presented at the 24th annual ACM symposium on the theory of computing (STOC '92)
Disk packings and planar separators
Proceedings of the twelfth annual symposium on Computational geometry
Separators for sphere-packings and nearest neighbor graphs
Journal of the ACM (JACM)
Recent results on the single-source shortest paths problem
ACM SIGACT News
Faster shortest-path algorithms for planar graphs
Journal of Computer and System Sciences - Special issue: 26th annual ACM symposium on the theory of computing & STOC'94, May 23–25, 1994, and second annual Europe an conference on computational learning theory (EuroCOLT'95), March 13–15, 1995
Geometric Separators for Finite-Element Meshes
SIAM Journal on Scientific Computing
Scaling algorithms for the shortest paths problem
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Undirected single-source shortest paths with positive integer weights in linear time
Journal of the ACM (JACM)
Single-source shortest-paths on arbitrary directed graphs in linear average-case time
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Introduction to Algorithms
SIAM Journal on Computing
WADS '93 Proceedings of the Third Workshop on Algorithms and Data Structures
Shortest Path Algorithms: An Evaluation Using Real Road Networks
Transportation Science
Computing the shortest path: A search meets graph theory
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Communications of the ACM - Spyware
Communications of the ACM - Self managed systems
Combining speed-up techniques for shortest-path computations
Journal of Experimental Algorithmics (JEA)
On the stabbing number of a random Delaunay triangulation
Computational Geometry: Theory and Applications
Algorithm Design: Foundations, Analysis and Internet Examples
Algorithm Design: Foundations, Analysis and Internet Examples
Highway hierarchies hasten exact shortest path queries
ESA'05 Proceedings of the 13th annual European conference on Algorithms
RNA molecules: glimpses through an algorithmic lens
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Augmenting cartographic resources for autonomous driving
Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Going off-road: transversal complexity in road networks
Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Road network reconstruction for organizing paths
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
AAIM'10 Proceedings of the 6th international conference on Algorithmic aspects in information and management
Extended dynamic subgraph statistics using h-index parameterized data structures
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part I
Approximate shortest path queries using Voronoi duals
Transactions on computational science IX
Approximate shortest path queries using Voronoi duals
Transactions on computational science IX
Tracking moving objects with few handovers
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Edge Crossings
SIAM Journal on Computing
Exact distance oracles for planar graphs
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Ordered polyline trees for efficient search of objects moving on a graph
ICCSA'10 Proceedings of the 2010 international conference on Computational Science and Its Applications - Volume Part I
Preprocessing speed-up techniques is hard
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
Extended dynamic subgraph statistics using h-index parameterized data structures
Theoretical Computer Science
On optimal preprocessing for contraction hierarchies
Proceedings of the 5th ACM SIGSPATIAL International Workshop on Computational Transportation Science
Security scheduling for real-world networks
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
Shortest-path queries in static networks
ACM Computing Surveys (CSUR)
Hi-index | 0.00 |
This 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 previous approaches, our study is not based on the assumption that road networks are planar graphs. Indeed, based on the a number of experiments we have performed on the road networks of the 50 United States and District of Columbia, we provide strong empirical evidence that road networks are quite non-planar. Our approach therefore instead is directed at finding algorithmically-motivated properties of road networks as non-planar geometric graphs, focusing on alternative properties of road networks that can still lead to efficient algorithms for such problems as shortest paths and Voronoi diagrams. In particular, we study road networks as multiscale-dispersed graphs, which is a concept we formalize in terms of disk neighborhood systems. This approach allows us to develop fast algorithms for road networks without making any additional assumptions about the distribution of edge weights. In fact, our algorithms can allow for non-metric weights.