Sciweavers

GIS
2008
ACM

Feed-links for network extensions

14 years 4 months ago
Feed-links for network extensions
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. Categories and Subject Descriptors: H.4 [Information Systems Applications]: Geographic Information Systems General Terms: Algorithms, Experimentation.
Boris Aronov, Kevin Buchin, Maike Buchin, B. Janse
Added 09 Nov 2009
Updated 09 Nov 2009
Type Conference
Year 2008
Where GIS
Authors Boris Aronov, Kevin Buchin, Maike Buchin, B. Jansen, T. de Jong, Marc J. van Kreveld, Maarten Löffler, Jin Luo, Rodrigo I. Silveira, Bettina Speckmann
Comments (0)