Abstract
We consider the problem of constructing street networks from geo-referenced trajectory data: Given a set of trajectories in the plane, compute a street network that represents all trajectories in the set. We present a simple and practical incremental algorithm that is based on partial matching of the trajectories to the graph. We use minimumlink paths to reduce the complexity of the reconstructed graph. We provide quality guarantees and experimental results based on both real and synthetic data. For the partial matching we introduce a new variant of partial Fréchet distance.
This work has been supported by the National Science Foundation grant NSF CAREER CCF-0643597.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bruntrup, R., Edelkamp, S., Jabbar, S., Scholz, B.: Incremental map generation with GPS traces. In: Proc. IEEE Intelligent Transp. Systems, pp. 574–579 (2005)
Li, Z., Lee, J.-G., Li, X., Han, J.: Incremental Clustering for Trajectories. In: Kitagawa, H., Ishikawa, Y., Li, Q., Watanabe, C. (eds.) DASFAA 2010. LNCS, vol. 5982, pp. 32–46. Springer, Heidelberg (2010)
Guo, T., Iwamura, K., Koga, M.: Towards high accuracy road maps generation from massive GPS traces data. In: IEEE Int. Geoscience and Remote Sensing Symposium, pp. 667–670 (2007)
Cao, L., Krumm, J.: From GPS traces to a routable road map. In: Proc. of the 17th ACM SIGSPATIAL Int. Conf. on Advances in GIS. GIS 2009, pp. 3–12. ACM, New York (2009)
Chen, D., Guibas, L., Hershberger, J., Sun, J.: Road network reconstruction for organizing paths. In: Proc. ACM-SIAM Symp. on Discrete Algorithms (2010)
Aanjaneya, M., Chazal, F., Chen, D., Glisse, M., Guibas, L.J., Morozov, D.: Metric graph reconstruction from noisy data. In: Proc. ACM Symp. Computational Geometry, pp. 37–46 (2011)
Ge, X., Safa, I., Belkin, M., Wang, Y.: Data skeletonization via Reeb graphs. In: 25th Annual Conference on Neural Info. Processing Systems, pp. 837–845 (2011)
Alt, H., Godau, M.: Computing the Fréchet distance between two polygonal curves. Int. J. of Computational Geometry and Applications 5, 75–91 (1995)
Buchin, K., Buchin, M., Wang, Y.: Exact algorithm for partial curve matching via the Fréchet distance. In: Proc. ACM-SIAM Symp. on Discrete Algo. (SODA 2009), pp. 645–654 (2009)
Alt, H., Efrat, A., Rote, G., Wenk, C.: Matching planar maps. Journal of Algorithms, 262–283 (2003)
Guibas, L.J., Hershberger, J.E., Mitchell, J.S.B., Snoeyink, J.S.: Approximating polygons and subdivisions with minimum-link paths. Int. J. of Computational Geometry and Applications, 3–4 (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ahmed, M., Wenk, C. (2012). Constructing Street Networks from GPS Trajectories. In: Epstein, L., Ferragina, P. (eds) Algorithms – ESA 2012. ESA 2012. Lecture Notes in Computer Science, vol 7501. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33090-2_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-33090-2_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-33089-6
Online ISBN: 978-3-642-33090-2
eBook Packages: Computer ScienceComputer Science (R0)