Ad hocmatching of vectorial road networks

E. Safra, Y. Kanza, Y. Sagiv, Y. Doytsher
<span title="">2013</span> <i title="Informa UK Limited"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/5bs7dystenbhbe6dcjwszk233u" style="color: black;">International Journal of Geographical Information Science</a> </i> &nbsp;
In integration of road maps modeled as road vector data, the main task is matching pairs of objects that represent, in different maps, the same segment of a real-world road. In an ad hoc integration, the matching is done for a specific need, and thus, is performed in real time, where only a limited preprocessing is possible. Usually, ad hoc integration is performed as part of some interaction with a user, and hence, the matching algorithm is required to complete its task in time that is short
more &raquo; ... ough for human users to provide feedback to the application, that is, in no more than a few seconds. Such interaction is typical of services on the World-Wide Web and to applications in car-navigation systems or in hand-held devices. Several algorithms were proposed in the past for matching road vector data; however, these algorithms are not efficient enough for ad hoc integration. This paper presents algorithms for ad hoc integration of maps in which roads are represented as polylines. The main novelty of these algorithms is in using only the locations of the endpoints of the polylines rather than trying to match whole lines. The efficiency of the algorithms is shown both analytically and experimentally. In particular, these algorithms do not require the existence of a spatial index, and they are more efficient than an alternative approach based on employing a grid index. Extensive experiments using various maps of three different cities show that our approach to matching road networks is efficient and accurate (that is, it provides high recall and precision).
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1080/13658816.2012.667104">doi:10.1080/13658816.2012.667104</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ey4oevz2t5eg3lp2mdkrqr6nby">fatcat:ey4oevz2t5eg3lp2mdkrqr6nby</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20121114193627/http://www.cs.technion.ac.il/~kanza/Papers/IJGIS2012.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/7e/8e/7e8eabeae2ed09a5efdebb9534a021e8bc12ccce.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1080/13658816.2012.667104"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> tandfonline.com </button> </a>