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

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

2 Citaten (Scopus)

Samenvatting

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.
Originele taal-2Engels
TitelProceedings 16th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems (ACM-GIS'08, Irvine CA, USA, November 5-7, 2008)
Plaats van productieNew York NY
UitgeverijAssociation for Computing Machinery, Inc
Pagina's35-1/9
ISBN van geprinte versie978-1-60558-323-5
DOI's
StatusGepubliceerd - 2008

Vingerafdruk Duik in de onderzoeksthema's van 'Feed-links for network extensions'. Samen vormen ze een unieke vingerafdruk.

Citeer dit