{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T16:19:32Z","timestamp":1743005972231,"version":"3.40.3"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030835071"},{"type":"electronic","value":"9783030835088"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-83508-8_18","type":"book-chapter","created":{"date-parts":[[2021,7,30]],"date-time":"2021-07-30T13:05:06Z","timestamp":1627650306000},"page":"243-257","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Computing the Fr\u00e9chet Distance Between Uncertain Curves in One Dimension"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3022-7877","authenticated-orcid":false,"given":"Kevin","family":"Buchin","sequence":"first","affiliation":[]},{"given":"Maarten","family":"L\u00f6ffler","sequence":"additional","affiliation":[]},{"given":"Tim","family":"Ophelders","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0158-1746","authenticated-orcid":false,"given":"Aleksandr","family":"Popov","sequence":"additional","affiliation":[]},{"given":"J\u00e9r\u00f4me","family":"Urhausen","sequence":"additional","affiliation":[]},{"given":"Kevin","family":"Verbeek","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,7,31]]},"reference":[{"key":"18_CR1","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/3-540-44676-1_23","volume-title":"Algorithms \u2013 ESA 2001","author":"M Abellanas","year":"2001","unstructured":"Abellanas, M., et al.: Smallest color-spanning objects. In: auf der Heide, F.M. (ed.) Algorithms \u2013 ESA 2001. LNCS, vol. 2161, pp. 278\u2013289. Springer, Berlin (2001). https:\/\/doi.org\/10.1007\/3-540-44676-1_23"},{"issue":"2","key":"18_CR2","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1137\/130920526","volume":"43","author":"PK Agarwal","year":"2014","unstructured":"Agarwal, P.K., Avraham, R.B., Kaplan, H., Sharir, M.: Computing the discrete Fr\u00e9chet distance in subquadratic time. SIAM J. Comput. 43(2), 429\u2013449 (2014). https:\/\/doi.org\/10.1137\/130920526","journal-title":"SIAM J. Comput."},{"key":"18_CR3","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/978-3-642-33090-2_7","volume-title":"Algorithms \u2013 ESA 2012","author":"M Ahmed","year":"2012","unstructured":"Ahmed, M., Wenk, C.: Constructing street networks from GPS trajectories. In: Epstein, L., Ferragina, P. (eds.) Algorithms \u2013 ESA 2012. LNCS, vol. 7501, pp. 60\u201371. Springer, Berlin (2012). https:\/\/doi.org\/10.1007\/978-3-642-33090-2_7"},{"issue":"1","key":"18_CR4","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1142\/S0218195912600023","volume":"22","author":"HK Ahn","year":"2012","unstructured":"Ahn, H.K., Knauer, C., Scherfenberg, M., Schlipf, L., Vigneron, A.: Computing the discrete Fr\u00e9chet distance with imprecise input. Int. J. Comput. Geom. Appl. 22(1), 27\u201344 (2012). https:\/\/doi.org\/10.1142\/S0218195912600023","journal-title":"Int. J. Comput. Geom. Appl."},{"issue":"1","key":"18_CR5","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. Comput. Geom. Appl. 5(1), 75\u201391 (1995). https:\/\/doi.org\/10.1142\/S0218195995000064","journal-title":"Int. J. Comput. Geom. Appl."},{"doi-asserted-by":"publisher","unstructured":"Brakatsoulas, S., Pfoser, D., Salas, R., Wenk, C.: On map-matching vehicle tracking data. In: Proceedings of the 31st International Conference on Very Large Data Bases, pp. 853\u2013864. ACM, New York (2005). https:\/\/doi.org\/10.5555\/1083592.1083691","key":"18_CR6","DOI":"10.5555\/1083592.1083691"},{"doi-asserted-by":"publisher","unstructured":"Bringmann, K.: Why walking the dog takes time: Fr\u00e9chet distance has no strongly subquadratic algorithms unless SETH fails. In: Proceedings of the 55th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2014), pp. 661\u2013670. IEEE, Piscataway, NJ, USA (2014). https:\/\/doi.org\/10.1109\/FOCS.2014.76","key":"18_CR7","DOI":"10.1109\/FOCS.2014.76"},{"issue":"2","key":"18_CR8","doi-asserted-by":"publisher","first-page":"46","DOI":"10.20382\/jocg.v7i2a4","volume":"7","author":"K Bringmann","year":"2016","unstructured":"Bringmann, K., Mulzer, W.: Approximability of the discrete Fr\u00e9chet distance. J. Comput. Geom. 7(2), 46\u201376 (2016). https:\/\/doi.org\/10.20382\/jocg.v7i2a4","journal-title":"J. Comput. Geom."},{"doi-asserted-by":"publisher","unstructured":"Buchin, K., et al.: Clustering trajectories for map construction. In: Proceedings of the 25th International Conference on Advances in Geographic Information Systems (SIGSPATIAL \u201917), pp. 14:1\u201314:10. ACM, New York (2017). https:\/\/doi.org\/10.1145\/3139958.3139964","key":"18_CR9","DOI":"10.1145\/3139958.3139964"},{"unstructured":"Buchin, K., Buchin, M., Knauer, C., Rote, G., Wenk, C.: How difficult is it to walk the dog? (2007). https:\/\/page.mi.fu-berlin.de\/rote\/Papers\/pdf\/How+difficult+is+it+to+walk+the+dog.pdf, presented at EuroCG 2007, Graz, Austria","key":"18_CR10"},{"issue":"1","key":"18_CR11","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/s00454-017-9878-7","volume":"58","author":"K Buchin","year":"2017","unstructured":"Buchin, K., Buchin, M., Meulemans, W., Mulzer, W.: Four Soviets walk the dog: improved bounds for computing the Fr\u00e9chet distance. Discret. Comput. Geom. 58(1), 180\u2013216 (2017). https:\/\/doi.org\/10.1007\/s00454-017-9878-7","journal-title":"Discret. Comput. Geom."},{"doi-asserted-by":"publisher","unstructured":"Buchin, K., Driemel, A., van de L\u2019Isle, N., Nusser, A.: Klcluster: center-based clustering of trajectories. In: Proceedings of the 27th International Conference on Advances in Geographic Information Systems (SIGSPATIAL \u201919), pp. 496\u2013499. ACM, New York (2019). https:\/\/doi.org\/10.1145\/3347146.3359111","key":"18_CR12","DOI":"10.1145\/3347146.3359111"},{"doi-asserted-by":"publisher","unstructured":"Buchin, K., Fan, C., L\u00f6ffler, M., Popov, A., Raichel, B., Roeloffzen, M.: Fr\u00e9chet distance for uncertain curves. In: 47th International Colloquium on Automata, Languages, and Programming. LIPIcs, vol. 168, pp. 20:1\u201320:20. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2020). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2020.20","key":"18_CR13","DOI":"10.4230\/LIPIcs.ICALP.2020.20"},{"issue":"3","key":"18_CR14","doi-asserted-by":"publisher","first-page":"674","DOI":"10.1007\/s00453-010-9430-0","volume":"61","author":"K Buchin","year":"2011","unstructured":"Buchin, K., L\u00f6ffler, M., Morin, P., Mulzer, W.: Preprocessing imprecise points for Delaunay triangulation: simplified and extended. Algorithmica 61(3), 674\u2013693 (2011). https:\/\/doi.org\/10.1007\/s00453-010-9430-0","journal-title":"Algorithmica"},{"doi-asserted-by":"crossref","unstructured":"Buchin, K., L\u00f6ffler, M., Ophelders, T., Popov, A., Urhausen, J., Verbeek, K.: Computing the Fr\u00e9chet distance between uncertain curves in one dimension. arXiv preprint (2021). https:\/\/arxiv.org\/abs\/2105.09922","key":"18_CR15","DOI":"10.1007\/978-3-030-83508-8_18"},{"doi-asserted-by":"publisher","unstructured":"Buchin, K., Ophelders, T., Speckmann, B.: SETH says: weak Fr\u00e9chet distance is faster, but only if it is continuous and in one dimension. In: Proceedings of the 30th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2019), pp. 2887\u20132901. SIAM, Philadelphia, PA, USA (2019). https:\/\/doi.org\/10.5555\/3310435.3310614","key":"18_CR16","DOI":"10.5555\/3310435.3310614"},{"unstructured":"Buchin, M., Sijben, S.: Discrete Fr\u00e9chet distance for uncertain points (2016). http:\/\/www.eurocg2016.usi.ch\/sites\/default\/files\/paper_72.pdf, presented at EuroCG 2016, Lugano, Switzerland","key":"18_CR17"},{"issue":"1","key":"18_CR18","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/s00454-012-9402-z","volume":"48","author":"A Driemel","year":"2012","unstructured":"Driemel, A., Har-Peled, S., Wenk, C.: Approximating the Fr\u00e9chet distance for realistic curves in near linear time. Discret. Comput. Geom. 48(1), 94\u2013127 (2012). https:\/\/doi.org\/10.1007\/s00454-012-9402-z","journal-title":"Discret. Comput. Geom."},{"key":"18_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"590","DOI":"10.1007\/978-3-642-45030-3_55","volume-title":"Algorithms and Computation (ISAAC 2013)","author":"C Fan","year":"2013","unstructured":"Fan, C., Luo, J., Zhu, B.: Tight approximation bounds for connectivity with a color-spanning set. In: Cai, L., Cheng, S.W., Lam, T.W. (eds.) Algorithms and Computation (ISAAC 2013). LNCS, vol. 8283, pp. 590\u2013600. Springer, Berlin (2013). https:\/\/doi.org\/10.1007\/978-3-642-45030-3_55"},{"unstructured":"Fan, C., Zhu, B.: Complexity and algorithms for the discrete Fr\u00e9chet distance upper bound with imprecise input. arXiv preprint (2018). https:\/\/arxiv.org\/abs\/1509.02576v2","key":"18_CR20"},{"key":"18_CR21","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/j.compenvurbsys.2013.09.004","volume":"47","author":"J Gudmundsson","year":"2014","unstructured":"Gudmundsson, J., Wolle, T.: Football analysis using spatio-temporal tools. Comput. Environ. Urban Syst. 47, 16\u201327 (2014). https:\/\/doi.org\/10.1016\/j.compenvurbsys.2013.09.004","journal-title":"Comput. Environ. Urban Syst."},{"issue":"1","key":"18_CR22","doi-asserted-by":"publisher","first-page":"3:1","DOI":"10.1145\/2532646","volume":"10","author":"S Har-Peled","year":"2014","unstructured":"Har-Peled, S., Raichel, B.: The Fr\u00e9chet distance revisited and extended. ACM Trans. Algorithms 10(1), 3:1\u20133:22 (2014). https:\/\/doi.org\/10.1145\/2532646","journal-title":"ACM Trans. Algorithms"},{"issue":"1","key":"18_CR23","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1142\/s0219720008003278","volume":"6","author":"M Jiang","year":"2008","unstructured":"Jiang, M., Xu, Y., Zhu, B.: Protein structure: structure alignment with discrete Fr\u00e9chet distance. J. Bioinform. Comput. Biol. 6(1), 51\u201364 (2008). https:\/\/doi.org\/10.1142\/s0219720008003278","journal-title":"J. Bioinform. Comput. Biol."},{"issue":"32","key":"18_CR24","doi-asserted-by":"publisher","first-page":"4173","DOI":"10.1016\/j.tcs.2011.01.039","volume":"412","author":"C Knauer","year":"2011","unstructured":"Knauer, C., L\u00f6ffler, M., Scherfenberg, M., Wolle, T.: The directed Hausdorff distance between imprecise point sets. Theor. Comput. Sci. 412(32), 4173\u20134186 (2011). https:\/\/doi.org\/10.1016\/j.tcs.2011.01.039","journal-title":"Theor. Comput. Sci."},{"issue":"7","key":"18_CR25","doi-asserted-by":"publisher","first-page":"2990","DOI":"10.1137\/090753620","volume":"39","author":"M van Kreveld","year":"2010","unstructured":"van Kreveld, M., L\u00f6ffler, M., Mitchell, J.S.B.: Preprocessing imprecise points and splitting triangulations. SIAM J. Comput. 39(7), 2990\u20133000 (2010). https:\/\/doi.org\/10.1137\/090753620","journal-title":"SIAM J. Comput."},{"unstructured":"L\u00f6ffler, M.: Data imprecision in computational geometry. Ph.D. thesis. Universiteit Utrecht (2009). https:\/\/dspace.library.uu.nl\/bitstream\/handle\/1874\/36022\/loffler.pdf","key":"18_CR26"},{"key":"18_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/11785293_35","volume-title":"Algorithm Theory","author":"M L\u00f6ffler","year":"2006","unstructured":"L\u00f6ffler, M., van Kreveld, M.: Largest and smallest tours and convex hulls for imprecise points. In: Arge, L., Freivalds, R. (eds.) Algorithm Theory. LNCS, vol. 4059, pp. 375\u2013387. Springer, Berlin (2006). https:\/\/doi.org\/10.1007\/11785293_35"},{"issue":"1","key":"18_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.20382\/jocg.v5i1a1","volume":"5","author":"M L\u00f6ffler","year":"2014","unstructured":"L\u00f6ffler, M., Mulzer, W.: Unions of onions: preprocessing imprecise points for fast onion decomposition. J. Comput. Geom. 5(1), 1\u201313 (2014). https:\/\/doi.org\/10.20382\/jocg.v5i1a1","journal-title":"J. Comput. Geom."},{"issue":"3","key":"18_CR29","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1016\/j.comgeo.2008.12.007","volume":"43","author":"M L\u00f6ffler","year":"2010","unstructured":"L\u00f6ffler, M., Snoeyink, J.S.: Delaunay triangulations of imprecise points in linear time after preprocessing. Comput. Geom. Theory Appl. 43(3), 234\u2013242 (2010). https:\/\/doi.org\/10.1016\/j.comgeo.2008.12.007","journal-title":"Comput. Geom. Theory Appl."},{"key":"18_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/978-3-540-92137-0_5","volume-title":"International Symposium on Intelligence Computation and Applications","author":"J Zheng","year":"2008","unstructured":"Zheng, J., Gao, X., Zhan, E., Huang, Z.: Algorithm of on-line handwriting signature verification based on discrete Fr\u00e9chet distance. In: Kang, L., Cai, Z., Yan, X., Liu, Y. (eds.) International Symposium on Intelligence Computation and Applications. LNCS, vol. 5370, pp. 461\u2013469. Springer, Berlin (2008). https:\/\/doi.org\/10.1007\/978-3-540-92137-0_5"}],"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-030-83508-8_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,18]],"date-time":"2022-02-18T11:27:18Z","timestamp":1645183638000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-83508-8_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030835071","9783030835088"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-83508-8_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"31 July 2021","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":"Workshop on Algorithms and Data Structures","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 August 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 August 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wads2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/projects.cs.dal.ca\/wads2021\/","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":"123","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":"38% - 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":"13","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)"}}]}}