{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T03:19:57Z","timestamp":1725851997923},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662495285"},{"type":"electronic","value":"9783662495292"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-662-49529-2_2","type":"book-chapter","created":{"date-parts":[[2016,3,21]],"date-time":"2016-03-21T08:09:41Z","timestamp":1458547781000},"page":"14-26","source":"Crossref","is-referenced-by-count":1,"title":["A Middle Curve Based on Discrete Fr\u00e9chet Distance"],"prefix":"10.1007","author":[{"given":"Hee-Kap","family":"Ahn","sequence":"first","affiliation":[]},{"given":"Helmut","family":"Alt","sequence":"additional","affiliation":[]},{"given":"Maike","family":"Buchin","sequence":"additional","affiliation":[]},{"given":"Eunjin","family":"Oh","sequence":"additional","affiliation":[]},{"given":"Ludmila","family":"Scharf","sequence":"additional","affiliation":[]},{"given":"Carola","family":"Wenk","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,3,22]]},"reference":[{"key":"2_CR1","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, 75\u201391 (1995)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"2_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1007\/978-3-540-92182-0_57","volume-title":"Algorithms and Computation","author":"K Buchin","year":"2008","unstructured":"Buchin, K., Buchin, M., Gudmundsson, J., L\u00f6ffler, M., Luo, J.: Detecting commuting patterns by clustering subtrajectories. In: Hong, S.-H., Nagamochi, H., Fukunaga, T. (eds.) ISAAC 2008. LNCS, vol. 5369, pp. 644\u2013655. Springer, Heidelberg (2008)"},{"issue":"3","key":"2_CR3","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1007\/s00453-012-9654-2","volume":"66","author":"K Buchin","year":"2013","unstructured":"Buchin, K., Buchin, M., van Kreveld, M., L\u00f6ffler, M., Silveira, R.I., Wenk, C., Wiratma, L.: Median trajectories. Algorithmica 66(3), 595\u2013614 (2013)","journal-title":"Algorithmica"},{"key":"2_CR4","unstructured":"Dumitrescu, A., Rote, G.: On the Fr\u00e9chet distance of a set of curves. In: Proceedings of the 16th Canadian Conference on Computational Geometry, CCCG 2004, Concordia University, Montr\u00e9al, Qu\u00e9bec, Canada, pp. 162\u2013165, 9\u201311 August 2004"},{"key":"2_CR5","unstructured":"Eiter, T., Mannila, H.: Computing discrete Fr\u00e9chet distance. Technical report, Technische Universit\u00e4t Wien (1994)"},{"issue":"1","key":"2_CR6","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)","journal-title":"ACM Trans. Algorithms"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"Sriraghavendra, E., Karthik, K., Bhattacharyya, C.: Fr\u00e9chet distance based approach for searching online handwritten documents. In: Proceedings of the Ninth International Conference on Document Analysis and Recognition, ICDAR 2007, vol. 1, pp. 461\u2013465. IEEE Computer Society (2007)","DOI":"10.1109\/ICDAR.2007.4378752"},{"key":"2_CR8","unstructured":"van Kreveld, M.J., L\u00f6ffler, M., Staals, F.: Central trajectories. In: 31st European Workshop on Computational Geometry (EuroCG), Book of Abstracts, pp. 129\u2013132 (2015)"},{"key":"2_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/978-3-642-13657-3_26","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"H Zhu","year":"2010","unstructured":"Zhu, H., Luo, J., Yin, H., Zhou, X., Huang, J.Z., Zhan, F.B.: Mining trajectory corridors using Fr\u00e9chet distance and meshing grids. In: Zaki, M.J., Yu, J.X., Ravindran, B., Pudi, V. (eds.) PAKDD 2010, Part I. LNCS, vol. 6118, pp. 228\u2013237. Springer, Heidelberg (2010)"}],"container-title":["Lecture Notes in Computer Science","LATIN 2016: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-49529-2_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T20:58:01Z","timestamp":1559422681000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-49529-2_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662495285","9783662495292"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-49529-2_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}