{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T20:00:06Z","timestamp":1772913606723,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642330896","type":"print"},{"value":"9783642330902","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33090-2_7","type":"book-chapter","created":{"date-parts":[[2012,8,28]],"date-time":"2012-08-28T11:29:11Z","timestamp":1346153351000},"page":"60-71","source":"Crossref","is-referenced-by-count":85,"title":["Constructing Street Networks from GPS Trajectories"],"prefix":"10.1007","author":[{"given":"Mahmuda","family":"Ahmed","sequence":"first","affiliation":[]},{"given":"Carola","family":"Wenk","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"7_CR1","unstructured":"Bruntrup, R., Edelkamp, S., Jabbar, S., Scholz, B.: Incremental map generation with GPS traces. In: Proc. IEEE Intelligent Transp. Systems, pp. 574\u2013579 (2005)"},{"key":"7_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/978-3-642-12098-5_3","volume-title":"Database Systems for Advanced Applications","author":"Z. Li","year":"2010","unstructured":"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.\u00a05982, pp. 32\u201346. Springer, Heidelberg (2010)"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"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\u2013670 (2007)","DOI":"10.1109\/IGARSS.2007.4422884"},{"key":"7_CR4","series-title":"GIS 2009","first-page":"3","volume-title":"Proc. of the 17th ACM SIGSPATIAL Int. Conf. on Advances in GIS","author":"L. Cao","year":"2009","unstructured":"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\u201312. ACM, New York (2009)"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Chen, D., Guibas, L., Hershberger, J., Sun, J.: Road network reconstruction for organizing paths. In: Proc. ACM-SIAM Symp. on Discrete Algorithms (2010)","DOI":"10.1137\/1.9781611973075.105"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"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\u201346 (2011)","DOI":"10.1145\/1998196.1998203"},{"key":"7_CR7","unstructured":"Ge, X., Safa, I., Belkin, M., Wang, Y.: Data skeletonization via Reeb graphs. In: 25th Annual Conference on Neural Info. Processing Systems, pp. 837\u2013845 (2011)"},{"key":"7_CR8","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1142\/S0218195995000064","volume":"5","author":"H. Alt","year":"1995","unstructured":"Alt, H., Godau, M.: Computing the Fr\u00e9chet distance between two polygonal curves. Int. J. of Computational Geometry and Applications\u00a05, 75\u201391 (1995)","journal-title":"Int. J. of Computational Geometry and Applications"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Buchin, K., Buchin, M., Wang, Y.: Exact algorithm for partial curve matching via the Fr\u00e9chet distance. In: Proc. ACM-SIAM Symp. on Discrete Algo. (SODA 2009), pp. 645\u2013654 (2009)","DOI":"10.1137\/1.9781611973068.71"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"Alt, H., Efrat, A., Rote, G., Wenk, C.: Matching planar maps. Journal of Algorithms, 262\u2013283 (2003)","DOI":"10.1016\/S0196-6774(03)00085-3"},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"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\u20134 (1993)","DOI":"10.1142\/S0218195993000257"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2012"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33090-2_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,27]],"date-time":"2022-01-27T14:06:57Z","timestamp":1643292417000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33090-2_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642330896","9783642330902"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33090-2_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}