Feed-links for network extensions

Authors:
B. Aronov;K. Buchin;M. Buchin;B. Jansen;T. de Jong;M. van Kreveld;M. Löffler;J. Luo;R. I. Silveira;B. Speckmann
Affiliations:
Polytechnic Institute of NYU, Brooklyn, New York;Utrecht University, Utrecht, The Netherlands;Utrecht University, Utrecht, The Netherlands;Utrecht University, Utrecht, The Netherlands;Utrecht University, Utrecht, The Netherlands;Utrecht University, Utrecht, The Netherlands;Utrecht University, Utrecht, The Netherlands;Utrecht University, Utrecht, The Netherlands;Utrecht University, Utrecht, The Netherlands;TU Eindhoven, Eindhoven, The Netherlands
Venue:
Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems
Year:
2008

Citing 10
Cited 1

An Optimal Algorithm for Euclidean Shortest Paths in the Plane

SIAM Journal on Computing
Approximating the Stretch Factor of Euclidean Graphs

SIAM Journal on Computing
Computing the Maximum Detour and Spanning Ratio of Planar Paths, Trees, and Cycles

STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Planar Spanners and Approximate Shortest Path Queries among Obstacles in the Plane

ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms
Finding the best shortcut in a geometric network

SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
The Geometric Dilation of Finite Point Sets

Algorithmica
Geometric Spanner Networks

Geometric Spanner Networks
Region-fault tolerant geometric spanners

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Experimental study of geometric t-spanners: a running time comparison

WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Dilation-optimal edge deletion in polygonal cycles

ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation

Connect the Dot: Computing Feed-Links with Minimum Dilation

WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures

Quantified Score

Hi-index	0.00

Visualization

Abstract

Road network data is often incomplete, making it hard to perform network analysis. This paper discusses the problem of extending partial road networks with reasonable links, using the concept of dilation (also known as crow flight conversion coefficient). To this end, we study how to connect a point (relevant location) inside a polygon (face of the known part of the road network) to the boundary so that the dilation from that point to any point on the boundary is not too large. We provide algorithms and heuristics, and give a computational and experimental analysis.