Feed-links for network extensions

B. Aronov, K. Buchin, M. Buchin, B. Jansen, T. De Jong, M. Van Kreveld, M. Löffler, J. Luo, R. I. Silveira, B. Speckmann

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    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 coeficient). 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.

    Original languageEnglish (US)
    Title of host publicationProceedings of the 16th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, ACM GIS 2008
    Pages308-316
    Number of pages9
    DOIs
    StatePublished - 2008
    Event16th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, ACM GIS 2008 - Irvine, CA, United States
    Duration: Nov 5 2008Nov 7 2008

    Publication series

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

    Other

    Other16th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, ACM GIS 2008
    Country/TerritoryUnited States
    CityIrvine, CA
    Period11/5/0811/7/08

    Keywords

    • Network analysis
    • Road network

    ASJC Scopus subject areas

    • Earth-Surface Processes
    • Computer Science Applications
    • Modeling and Simulation
    • Computer Graphics and Computer-Aided Design
    • Information Systems

    Fingerprint

    Dive into the research topics of 'Feed-links for network extensions'. Together they form a unique fingerprint.

    Cite this