Feed-links for network extensions

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

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

2 Citations (Scopus)

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.
Original languageEnglish
Title of host publicationProceedings 16th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems (ACM-GIS'08, Irvine CA, USA, November 5-7, 2008)
Place of PublicationNew York NY
PublisherAssociation for Computing Machinery, Inc
Pages35-1/9
ISBN (Print)978-1-60558-323-5
DOIs
Publication statusPublished - 2008

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

Cite this