Feed-links for network extensions

Boris 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

    Other

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

    Fingerprint

    Road Network
    Electric network analysis
    dilation
    Dilation
    Point Location
    Computational Analysis
    network analysis
    Network Analysis
    Experimental Analysis
    polygon
    heuristics
    Polygon
    flight
    Face
    Heuristics
    Partial
    road network

    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

    Cite this

    Aronov, B., Buchin, K., Buchin, M., Jansen, B., De Jong, T., Van Kreveld, M., ... Speckmann, B. (2008). Feed-links for network extensions. In Proceedings of the 16th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, ACM GIS 2008 (pp. 308-316). [1463478] https://doi.org/10.1145/1463434.1463478

    Feed-links for network extensions. / Aronov, Boris; Buchin, K.; Buchin, M.; Jansen, B.; De Jong, T.; Van Kreveld, M.; Löffler, M.; Luo, J.; Silveira, R. I.; Speckmann, B.

    Proceedings of the 16th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, ACM GIS 2008. 2008. p. 308-316 1463478.

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

    Aronov, B, Buchin, K, Buchin, M, Jansen, B, De Jong, T, Van Kreveld, M, Löffler, M, Luo, J, Silveira, RI & Speckmann, B 2008, Feed-links for network extensions. in Proceedings of the 16th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, ACM GIS 2008., 1463478, pp. 308-316, 16th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, ACM GIS 2008, Irvine, CA, United States, 11/5/08. https://doi.org/10.1145/1463434.1463478
    Aronov B, Buchin K, Buchin M, Jansen B, De Jong T, Van Kreveld M et al. Feed-links for network extensions. In Proceedings of the 16th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, ACM GIS 2008. 2008. p. 308-316. 1463478 https://doi.org/10.1145/1463434.1463478
    Aronov, Boris ; Buchin, K. ; Buchin, M. ; Jansen, B. ; De Jong, T. ; Van Kreveld, M. ; Löffler, M. ; Luo, J. ; Silveira, R. I. ; Speckmann, B. / Feed-links for network extensions. Proceedings of the 16th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, ACM GIS 2008. 2008. pp. 308-316
    @inproceedings{ae65e7a8dc6f4e758e7b1a1790d59a45,
    title = "Feed-links for network extensions",
    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.",
    keywords = "Network analysis, Road network",
    author = "Boris Aronov and K. Buchin and M. Buchin and B. Jansen and {De Jong}, T. and {Van Kreveld}, M. and M. L{\"o}ffler and J. Luo and Silveira, {R. I.} and B. Speckmann",
    year = "2008",
    doi = "10.1145/1463434.1463478",
    language = "English (US)",
    isbn = "9781605583235",
    pages = "308--316",
    booktitle = "Proceedings of the 16th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, ACM GIS 2008",

    }

    TY - GEN

    T1 - Feed-links for network extensions

    AU - Aronov, Boris

    AU - Buchin, K.

    AU - Buchin, M.

    AU - Jansen, B.

    AU - De Jong, T.

    AU - Van Kreveld, M.

    AU - Löffler, M.

    AU - Luo, J.

    AU - Silveira, R. I.

    AU - Speckmann, B.

    PY - 2008

    Y1 - 2008

    N2 - 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.

    AB - 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.

    KW - Network analysis

    KW - Road network

    UR - http://www.scopus.com/inward/record.url?scp=69949137057&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=69949137057&partnerID=8YFLogxK

    U2 - 10.1145/1463434.1463478

    DO - 10.1145/1463434.1463478

    M3 - Conference contribution

    AN - SCOPUS:69949137057

    SN - 9781605583235

    SP - 308

    EP - 316

    BT - Proceedings of the 16th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, ACM GIS 2008

    ER -