{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T04:23:04Z","timestamp":1743049384024,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031389054"},{"type":"electronic","value":"9783031389061"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-38906-1_15","type":"book-chapter","created":{"date-parts":[[2023,7,27]],"date-time":"2023-07-27T16:05:14Z","timestamp":1690473914000},"page":"208-231","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On Length-Sensitive Fr\u00e9chet Similarity"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3022-7877","authenticated-orcid":false,"given":"Kevin","family":"Buchin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1908-0154","authenticated-orcid":false,"given":"Brittany Terese","family":"Fasy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2548-7428","authenticated-orcid":false,"given":"Erfan Hosseini","family":"Sereshgi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9275-5336","authenticated-orcid":false,"given":"Carola","family":"Wenk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,7,28]]},"reference":[{"unstructured":"Aguilar, J., Buchin, K., Buchin, M., Hosseini Sereshgi, E., Silveira, R.I., Wenk, C.: Graph sampling for map comparison. In: 3rd ACM SIGSPATIAL International Workshop on Spatial Gems (2021)","key":"15_CR1"},{"doi-asserted-by":"crossref","unstructured":"Ahmed, M., Fasy, B.T., Hickmann, K.S., Wenk, C.: Path-based distance for street map comparison. ACM Trans. Spat. Algorithms Syst. 28 (2015)","key":"15_CR2","DOI":"10.1145\/2729977"},{"doi-asserted-by":"crossref","unstructured":"Ahmed, M., Fasy, B.T., Wenk, C.: Local persistent homology based distance between maps. In: Proceedings of the 22nd ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, pp. 43\u201352. ACM (2014)","key":"15_CR3","DOI":"10.1145\/2666310.2666390"},{"key":"15_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-25166-0","volume-title":"Map Construction Algorithms","author":"M Ahmed","year":"2015","unstructured":"Ahmed, M., Karagiorgou, S., Pfoser, D., Wenk, C.: Map Construction Algorithms. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-319-25166-0"},{"doi-asserted-by":"crossref","unstructured":"Akitaya, H.A., Buchin, M., Kilgus, B., Sijben, S., Wenk, C.: Distance measures for embedded graphs. Comput. Geom.: Theory Appl. 95, 101743 (2021)","key":"15_CR5","DOI":"10.1016\/j.comgeo.2020.101743"},{"issue":"2","key":"15_CR6","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1016\/s0196-6774(03)00085-3","volume":"49","author":"H Alt","year":"2003","unstructured":"Alt, H., Efrat, A., Rote, G., Wenk, C.: Matching planar maps. J. Algorithms 49(2), 262\u2013283 (2003). https:\/\/doi.org\/10.1016\/s0196-6774(03)00085-3","journal-title":"J. Algorithms"},{"issue":"1\u20132","key":"15_CR7","first-page":"75","volume":"5","author":"H Alt","year":"1995","unstructured":"Alt, H., Godau, M.: Computing the Fr\u00e9chet distance between two polygonal curves. IJCGA 5(1\u20132), 75\u201391 (1995)","journal-title":"IJCGA"},{"issue":"1","key":"15_CR8","doi-asserted-by":"publisher","first-page":"61","DOI":"10.3141\/2291-08","volume":"2291","author":"J Biagioni","year":"2012","unstructured":"Biagioni, J., Eriksson, J.: Inferring road maps from global positioning system traces. Transp. Res. Rec.: J. Transp. Res. Board 2291(1), 61\u201371 (2012)","journal-title":"Transp. Res. Rec.: J. Transp. Res. Board"},{"doi-asserted-by":"publisher","unstructured":"Buchin, K., et al.: Improved map construction using subtrajectory clustering. In: Proceedings of the 4th ACM SIGSPATIAL LocalRec Workshop, pp. 5:1\u20135:4 (2020). https:\/\/doi.org\/10.1145\/3423334.3431451","key":"15_CR9","DOI":"10.1145\/3423334.3431451"},{"issue":"7","key":"15_CR10","doi-asserted-by":"publisher","first-page":"1101","DOI":"10.1080\/13658810903569598","volume":"24","author":"K Buchin","year":"2010","unstructured":"Buchin, K., Buchin, M., Gudmundsson, J.: Constrained free space diagrams: a tool for trajectory analysis. Int. J. Geogr. Inf. Sci. 24(7), 1101\u20131125 (2010). https:\/\/doi.org\/10.1080\/13658810903569598","journal-title":"Int. J. Geogr. Inf. Sci."},{"doi-asserted-by":"crossref","unstructured":"Buchin, K., Buchin, M., Wang, Y.: Exact algorithms for partial curve matching via the Fr\u00e9chet distance. In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, pp. 645\u2013654. Society for Industrial and Applied Mathematics, USA (2009)","key":"15_CR11","DOI":"10.1137\/1.9781611973068.71"},{"doi-asserted-by":"publisher","unstructured":"Chen, C., Lu, C., Huang, Q., Yang, Q., Gunopulos, D., Guibas, L.: City-scale map creation and updating using GPS collections. In: Proceedings of the\/ 22nd ACM SIGKDD, pp. 1465\u20131474 (2016). https:\/\/doi.org\/10.1145\/2939672.2939833","key":"15_CR12","DOI":"10.1145\/2939672.2939833"},{"key":"15_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/978-3-642-02011-7_11","volume-title":"Experimental Algorithms","author":"O Cheong","year":"2009","unstructured":"Cheong, O., Gudmundsson, J., Kim, H.-S., Schymura, D., Stehn, F.: Measuring the similarity of geometric graphs. In: Vahrenhold, J. (ed.) SEA 2009. LNCS, vol. 5526, pp. 101\u2013112. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02011-7_11"},{"issue":"5","key":"15_CR14","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1016\/j.comgeo.2014.01.002","volume":"47","author":"JL De Carufel","year":"2014","unstructured":"De Carufel, J.L., Gheibi, A., Maheshwari, A., Sack, J.R., Scheffer, C.: Similarity of polygonal curves in the presence of outliers. Comput. Geom. 47(5), 625\u2013641 (2014). https:\/\/doi.org\/10.1016\/j.comgeo.2014.01.002","journal-title":"Comput. Geom."},{"issue":"3","key":"15_CR15","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1007\/s10707-019-00386-7","volume":"24","author":"D Duran","year":"2020","unstructured":"Duran, D., Sacrist\u00e1n, V., Silveira, R.I.: Map construction algorithms: a local evaluation through hiking data. GeoInformatica 24(3), 633\u2013681 (2020). https:\/\/doi.org\/10.1007\/s10707-019-00386-7","journal-title":"GeoInformatica"},{"doi-asserted-by":"crossref","unstructured":"He, S., et al.: Roadrunner: improving the precision of road network inference from GPS trajectories. In: Proceedings of 26th ACM SIGSPATIAL GIS, pp. 3\u201312 (2018)","key":"15_CR16","DOI":"10.1145\/3274895.3274974"},{"issue":"4","key":"15_CR17","doi-asserted-by":"publisher","first-page":"676","DOI":"10.1137\/0211056","volume":"11","author":"A Itai","year":"1982","unstructured":"Itai, A., Papadimitriou, C.H., Szwarcfiter, J.L.: Hamilton paths in grid graphs. SIAM J. Comput. 11(4), 676\u2013686 (1982)","journal-title":"SIAM J. Comput."},{"doi-asserted-by":"publisher","unstructured":"Koide, S., Xiao, C., Ishikawa, Y.: Fast subtrajectory similarity search in road networks under weighted edit distance constraints. Proc. VLDB Endow. 13(12), 2188\u20132201 (2020). https:\/\/doi.org\/10.14778\/3407790.3407818","key":"15_CR18","DOI":"10.14778\/3407790.3407818"},{"doi-asserted-by":"publisher","unstructured":"Maheshwari, A., Sack, J.R., Shahbaz, K., Zarrabi-Zadeh, H.: Fr\u00e9chet distance with speed limits. Comput. Geom. 44(2), 110\u2013120 (2011). https:\/\/doi.org\/10.1016\/j.comgeo.2010.09.008. Special issue of selected papers from the 21st Annual Canadian Conference on Computational Geometry","key":"15_CR19","DOI":"10.1016\/j.comgeo.2010.09.008"},{"issue":"2","key":"15_CR20","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0196-6774(84)90029-4","volume":"5","author":"CH Papadimitriou","year":"1984","unstructured":"Papadimitriou, C.H., Vazirani, U.V.: On two geometric problems related to the travelling salesman problem. J. Algorithms 5(2), 231\u2013246 (1984)","journal-title":"J. Algorithms"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-38906-1_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,27]],"date-time":"2023-07-27T16:06:57Z","timestamp":1690474017000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-38906-1_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031389054","9783031389061"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-38906-1_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"28 July 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WADS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Algorithms and Data Structures Symposium","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Montreal, QC","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 July 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 August 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wads2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/wads.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"92","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"47","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"51% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.1","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"10","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}