{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T13:52:43Z","timestamp":1725630763707},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642249822"},{"type":"electronic","value":"9783642249839"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-24983-9_7","type":"book-chapter","created":{"date-parts":[[2011,11,7]],"date-time":"2011-11-07T05:07:20Z","timestamp":1320642440000},"page":"61-72","source":"Crossref","is-referenced-by-count":3,"title":["Fr\u00e9chet-Distance on Road Networks"],"prefix":"10.1007","author":[{"given":"Chenglin","family":"Fan","sequence":"first","affiliation":[]},{"given":"Jun","family":"Luo","sequence":"additional","affiliation":[]},{"given":"Binhai","family":"Zhu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"7_CR1","unstructured":"Alt, H., Buchin, M.: Semi-computability of the fr\u00e9chet distance between surfaces. In: EuroCG, pp. 45\u201348 (2005)"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Alt, H., Efrat, A., Rote, G., Wenk, C.: Matching planar maps. In: SODA, pp. 589\u2013598 (2003)","DOI":"10.1016\/S0196-6774(03)00085-3"},{"key":"7_CR3","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. Geometry Appl.\u00a05, 75\u201391 (1995)","journal-title":"Int. J. Comput. Geometry Appl."},{"key":"7_CR4","unstructured":"Brakatsoulas, S., Pfoser, D., Salas, R., Wenk, C.: On map-matching vehicle tracking data. In: VLDB 2005: Proceedings of the 31st International Conference on Very Large Data Bases, pp. 853\u2013864. VLDB Endowment (2005)"},{"issue":"1-2","key":"7_CR5","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.comgeo.2007.08.003","volume":"41","author":"K. Buchin","year":"2008","unstructured":"Buchin, K., Buchin, M., Wenk, C.: Computing the fr\u00e9chet distance between simple polygons. Comput. Geom. Theory Appl.\u00a041(1-2), 2\u201320 (2008)","journal-title":"Comput. Geom. Theory Appl."},{"issue":"1","key":"7_CR6","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1145\/7531.7537","volume":"34","author":"R. Cole","year":"1987","unstructured":"Cole, R.: Slowing down sorting networks to obtain faster sorting algorithms. J. ACM\u00a034(1), 200\u2013208 (1987)","journal-title":"J. ACM"},{"key":"7_CR7","unstructured":"Eiter, T., Mannila, H.: Computing discrete fr\u00e9chet distance. Technical report, Technische Universitat Wien (1994)"},{"key":"7_CR8","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1145\/195058.195092","volume-title":"STOC 1994: Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing","author":"P. Klein","year":"1994","unstructured":"Klein, P., Rao, S., Rauch, M., Subramanian, S.: Faster shortest-path algorithms for planar graphs. In: STOC 1994: Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, pp. 27\u201337. ACM, New York (1994)"},{"issue":"4","key":"7_CR9","doi-asserted-by":"publisher","first-page":"852","DOI":"10.1145\/2157.322410","volume":"30","author":"N. Megiddo","year":"1983","unstructured":"Megiddo, N.: Applying parallel computation algorithms in the design of serial algorithms. J. ACM\u00a030(4), 852\u2013865 (1983)","journal-title":"J. ACM"},{"issue":"3","key":"7_CR10","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1016\/j.comgeo.2005.01.004","volume":"37","author":"G. Rote","year":"2007","unstructured":"Rote, G.: Computing the fr\u00e9chet distance between piecewise smooth curves. Comput. Geom. Theory Appl.\u00a037(3), 162\u2013174 (2007)","journal-title":"Comput. Geom. Theory Appl."}],"container-title":["Lecture Notes in Computer Science","Computational Geometry, Graphs and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-24983-9_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,19]],"date-time":"2019-06-19T04:28:25Z","timestamp":1560918505000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-24983-9_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642249822","9783642249839"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-24983-9_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}