Efficient integration of road maps

  • Authors:
  • Eliyah Safra;Yaron Kanza;Yehoshua Sagiv;Yerach Doytsher

  • Affiliations:
  • Technion, Haifa, Israel;University of Toronto, Toronto, Canada;The Hebrew University, Jerusalem, Israel;Technion, Haifa, Israel

  • Venue:
  • GIS '06 Proceedings of the 14th annual ACM international symposium on Advances in geographic information systems
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

Integration of two road maps is finding a matching between pairs of objects that represent, in the maps, the same real-world road. Several algorithms were proposed in the past for road-map integration; however, these algorithms are not efficient and some of them even require human feedback. Thus, they are not suitable for many important applications (e.g., Web services) where efficiency, in terms of both time and space, is crucial. This paper presents two efficient algorithms for integrating 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. Experiments on real-world data are given, showing that our approach of integration based on matching merely endpoints is efficient and accurate (that is, it provides high recall and precision).