{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T13:42:06Z","timestamp":1742996526147,"version":"3.40.3"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030247652"},{"type":"electronic","value":"9783030247669"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-24766-9_3","type":"book-chapter","created":{"date-parts":[[2019,7,30]],"date-time":"2019-07-30T23:09:48Z","timestamp":1564528188000},"page":"28-42","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Efficient Nearest-Neighbor Query and Clustering of Planar Curves"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3110-4702","authenticated-orcid":false,"given":"Boris","family":"Aronov","sequence":"first","affiliation":[]},{"given":"Omrit","family":"Filtser","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6388-9634","authenticated-orcid":false,"given":"Michael","family":"Horton","sequence":"additional","affiliation":[]},{"given":"Matthew J.","family":"Katz","sequence":"additional","affiliation":[]},{"given":"Khadijeh","family":"Sheikhan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,7,12]]},"reference":[{"issue":"3","key":"3_CR1","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1111\/1467-9469.00350","volume":"30","author":"C Abraham","year":"2003","unstructured":"Abraham, C., Cornillon, P.A., Matzner-Lober, E., Molinari, N.: Unsupervised curve clustering using b-splines. Scand. J. Stat. 30(3), 581\u2013595 (2003). https:\/\/doi.org\/10.1111\/1467-9469.00350","journal-title":"Scand. J. Stat."},{"key":"3_CR2","doi-asserted-by":"publisher","first-page":"898","DOI":"10.1137\/1.9781611975031.58","volume-title":"Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Peyman Afshani","year":"2018","unstructured":"Afshani, P., Driemel, A.: On the complexity of range searching among curves. In: Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 898\u2013917. SIAM (2018)"},{"issue":"2","key":"3_CR3","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s00453-001-0110-y","volume":"33","author":"PK Agarwal","year":"2002","unstructured":"Agarwal, P.K., Procopiuc, C.M.: Exact and approximation algorithms for clustering. Algorithmica 33(2), 201\u2013226 (2002). https:\/\/doi.org\/10.1007\/s00453-001-0110-y","journal-title":"Algorithmica"},{"issue":"2","key":"3_CR4","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":"3_CR5","doi-asserted-by":"publisher","unstructured":"Alewijnse, S.P.A., Buchin, K., Buchin, M., K\u00f6lzsch, A., Kruckenberg, H., Westenberg, M.A.: A framework for trajectory segmentation by stable criteria. In: Proceedings of the 22nd ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems. ACM Press, Dallas, November 2014. https:\/\/doi.org\/10.1145\/2666310.2666415","DOI":"10.1145\/2666310.2666415"},{"issue":"01n02","key":"3_CR6","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1142\/S0218195995000064","volume":"05","author":"H Alt","year":"1995","unstructured":"Alt, H., Godau, M.: Computing the Fr\u00e9chet distance between two polygonal curves. Intern. J. Comput. Geom. Appl. 05(01n02), 75\u201391 (1995). https:\/\/doi.org\/10.1142\/S0218195995000064","journal-title":"Intern. J. Comput. Geom. Appl."},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Aronov, B., Filtser, O., Horton, M., Katz, M.J., Sheikhan, K.: Efficient nearest-neighbor query and clustering of planar curves. arXiv preprint arXiv:1904.11026 (2019)","DOI":"10.1007\/978-3-030-24766-9_3"},{"issue":"6","key":"3_CR8","doi-asserted-by":"publisher","first-page":"747","DOI":"10.1016\/j.comgeo.2012.11.006","volume":"46","author":"M de Berg","year":"2013","unstructured":"de Berg, M., Cook, A.F., Gudmundsson, J.: Fast Fr\u00e9chet queries. Comput. Geom. 46(6), 747\u2013755 (2013). https:\/\/doi.org\/10.1016\/j.comgeo.2012.11.006","journal-title":"Comput. Geom."},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"de Berg, M., Gudmundsson, J., Mehrabi, A.D.: A dynamic data structure for approximate proximity queries in trajectory data. In: Proceedings of the 25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, p. 48. ACM (2017)","DOI":"10.1145\/3139958.3140023"},{"key":"3_CR10","unstructured":"Berndt, D.J., Clifford, J.: Using dynamic time warping to find patterns in timeseries. In: Papers from the AAAI Knowledge Discovery in Databases Workshop: Technical report WS-94-03, pp. 359\u2013370. AAAI Press, Seattle, July 1994"},{"key":"3_CR11","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 IEEE Symposium Foundations of Computer Science. IEEE, Philadelphia, October 2014. https:\/\/doi.org\/10.1109\/focs.2014.76","DOI":"10.1109\/focs.2014.76"},{"issue":"2","key":"3_CR12","first-page":"46","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). http:\/\/jocg.org\/index.php\/jocg\/article\/view\/261","journal-title":"J. Comput. Geom."},{"key":"3_CR13","doi-asserted-by":"publisher","first-page":"2922","DOI":"10.1137\/1.9781611975482.181","volume-title":"Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Kevin Buchin","year":"2019","unstructured":"Buchin, K., et al. Approximating $$(k, l)$$-center clustering for curves. In: Proceedings of the 30th Annual ACM-SIAM Symposium on Discrete Algorithms, San Diego, California, USA, 6\u20139 January 2019, pp. 2922\u20132938 (2019). https:\/\/doi.org\/10.1137\/1.9781611975482.181"},{"issue":"4","key":"3_CR14","doi-asserted-by":"publisher","first-page":"679","DOI":"10.1111\/j.1467-9868.2007.00605.x","volume":"69","author":"JM Chiou","year":"2007","unstructured":"Chiou, J.M., Li, P.L.: Functional clustering and identifying substructures of longitudinal data. J. Roy. Stat. Soc.: Ser. B (Stat. Methodol.) 69(4), 679\u2013699 (2007). https:\/\/doi.org\/10.1111\/j.1467-9868.2007.00605.x","journal-title":"J. Roy. Stat. Soc.: Ser. B (Stat. Methodol.)"},{"key":"3_CR15","doi-asserted-by":"publisher","unstructured":"Driemel, A., Har-Peled, S.: Jaywalking your dog\u2014computing the Fr\u00e9chet distance with shortcuts. In: Proceedings of the 23rd ACM-SIAM Symposium on Discrete Algorithms, pp. 318\u2013355. Society for Industrial and Applied Mathematics, Kyoto, January 2012. https:\/\/doi.org\/10.1137\/1.9781611973099.30","DOI":"10.1137\/1.9781611973099.30"},{"key":"3_CR16","doi-asserted-by":"publisher","unstructured":"Driemel, A., Krivo\u0161ija, A., Sohler, C.: Clustering time series under the Fr\u00e9chet distance. In: Proceedings of the 27th ACM-SIAM Symposium on Discrete Algorithms, pp. 766\u2013785. SIAM, January 2016. https:\/\/doi.org\/10.1137\/1.9781611974331.ch55","DOI":"10.1137\/1.9781611974331.ch55"},{"key":"3_CR17","unstructured":"Driemel, A., Silvestri, F.: Locality-sensitive hashing of curves. In: Proceedings of the 33rd International Symposium on Computational Geometry, SoCG 2017, Brisbane, Australia, pp. 37:1\u201337:16 (2017). http:\/\/drops.dagstuhl.de\/opus\/volltexte\/2017\/7203"},{"key":"3_CR18","unstructured":"Eiter, T., Mannila, H.: Computing discrete Fr\u00e9chet distance. Technical report CD-TR 94\/64, Christian Doppler Labor. f\u00fcr Expertensysteme, Technische Uni. Wien (1994)"},{"key":"3_CR19","doi-asserted-by":"publisher","unstructured":"Emiris, I.Z., Psarros, I.: Products of Euclidean metrics and applications to proximity questions among curves. In: Proceedings of the 34th International Symposium on Computational Geometry, SoCG 2018, 11\u201314 June 2018, Budapest, Hungary, pp. 37:1\u201337:13 (2018). https:\/\/doi.org\/10.4230\/LIPIcs.SoCG.2018.37. arXiv:1712.06471","DOI":"10.4230\/LIPIcs.SoCG.2018.37"},{"issue":"1","key":"3_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF03018603","volume":"22","author":"MM Fr\u00e9chet","year":"1906","unstructured":"Fr\u00e9chet, M.M.: Sur quelques points du calcul fonctionnel. Rendiconti del Circolo Matematico di Palermo 22(1), 1\u201372 (1906). https:\/\/doi.org\/10.1007\/BF03018603","journal-title":"Rendiconti del Circolo Matematico di Palermo"},{"key":"3_CR21","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/0304-3975(85)90224-5","volume":"38","author":"TF Gonzalez","year":"1985","unstructured":"Gonzalez, T.F.: Clustering to minimize the maximum intercluster distance. Theor. Comput. Sci. 38, 293\u2013306 (1985). https:\/\/doi.org\/10.1016\/0304-3975(85)90224-5","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"3_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3054132","volume":"50","author":"J Gudmundsson","year":"2017","unstructured":"Gudmundsson, J., Horton, M.: Spatio-temporal analysis of team sports. ACM Comput. Surv. 50(2), 1\u201334 (2017). https:\/\/doi.org\/10.1145\/3054132","journal-title":"ACM Comput. Surv."},{"key":"3_CR23","volume-title":"Mengenlehre","author":"F Hausdorff","year":"1927","unstructured":"Hausdorff, F.: Mengenlehre. Walter de Gruyter, Berlin (1927)"},{"issue":"3","key":"3_CR24","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/0166-218x(79)90044-1","volume":"1","author":"WL Hsu","year":"1979","unstructured":"Hsu, W.L., Nemhauser, G.L.: Easy and hard bottleneck location problems. Discr. Appl. Math. 1(3), 209\u2013215 (1979). https:\/\/doi.org\/10.1016\/0166-218x(79)90044-1","journal-title":"Discr. Appl. Math."},{"key":"3_CR25","doi-asserted-by":"publisher","unstructured":"Indyk, P.: Approximate nearest neighbor algorithms for Fr\u00e9chet distance via product metrics. In: Proceedings of the 8th Symposium on Computational Geometry, pp. 102\u2013106. ACM Press, Barcelona, June 2002. https:\/\/doi.org\/10.1145\/513400.513414","DOI":"10.1145\/513400.513414"},{"key":"3_CR26","doi-asserted-by":"publisher","DOI":"10.1201\/9781420035315.ch8","volume-title":"Handbook of Discrete and Computational Geometry, Second Edition","author":"Piotr Indyk","year":"2004","unstructured":"Indyk, P., Matou\u0161ek, J.: Low-distortion embeddings of finite metric spaces. In: Handbook of Discrete and Computational Geometry, 2 edn. Chapman and Hall\/CRC, April 2004. https:\/\/doi.org\/10.1201\/9781420035315.ch8"},{"issue":"2","key":"3_CR27","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1016\/j.dsp.2012.11.004","volume":"23","author":"H Niu","year":"2013","unstructured":"Niu, H., Wang, J.: Volatility clustering and long memory of financial time series and financial price model. Digit. Signal Process. 23(2), 489\u2013498 (2013). https:\/\/doi.org\/10.1016\/j.dsp.2012.11.004","journal-title":"Digit. Signal Process."},{"issue":"3","key":"3_CR28","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1145\/3828.3839","volume":"32","author":"DE Willard","year":"1985","unstructured":"Willard, D.E., Lueker, G.S.: Adding range restriction capability to dynamic data structures. J. ACM 32(3), 597\u2013617 (1985). https:\/\/doi.org\/10.1145\/3828.3839","journal-title":"J. ACM"}],"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-24766-9_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T17:52:34Z","timestamp":1710265954000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-24766-9_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030247652","9783030247669"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-24766-9_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"12 July 2019","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":"Edmonton, AB","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":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 August 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 August 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wads2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.wads.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}