{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T16:59:17Z","timestamp":1759683557328,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,8,11]],"date-time":"2013-08-11T00:00:00Z","timestamp":1376179200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2013,8,11]]},"DOI":"10.1145\/2505821.2505835","type":"proceedings-article","created":{"date-parts":[[2013,9,3]],"date-time":"2013-09-03T11:57:17Z","timestamp":1378209437000},"page":"1-8","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":15,"title":["Fast and exact network trajectory similarity computation"],"prefix":"10.1145","author":[{"given":"Michael R.","family":"Evans","sequence":"first","affiliation":[{"name":"University of Minnesota, Minneapolis, MN"}]},{"given":"Dev","family":"Oliver","sequence":"additional","affiliation":[{"name":"University of Minnesota, Minneapolis, MN"}]},{"given":"Shashi","family":"Shekhar","sequence":"additional","affiliation":[{"name":"University of Minnesota, Minneapolis, MN"}]},{"given":"Francis","family":"Harvey","sequence":"additional","affiliation":[{"name":"University of Minnesota, Minneapolis, MN"}]}],"member":"320","published-online":{"date-parts":[[2013,8,11]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Discrete geometric shapes: Matching, interpolation, and approximation. Handbook of computational geometry, 1:121--153","author":"Alt Helmut","year":"1999","unstructured":"Helmut Alt and Leonidas J Guibas . Discrete geometric shapes: Matching, interpolation, and approximation. Handbook of computational geometry, 1:121--153 , 1999 . Helmut Alt and Leonidas J Guibas. Discrete geometric shapes: Matching, interpolation, and approximation. Handbook of computational geometry, 1:121--153, 1999."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_2_1","DOI":"10.1007\/978-3-540-30570-5_12"},{"key":"e_1_3_2_1_3_1","first-page":"1940","volume-title":"Communications and Control (ICECC), 2011 International Conference on","author":"Chen Jinyang","year":"2011","unstructured":"Jinyang Chen , Rangding Wang , Liangxu Liu , and Jiatao Song . Clustering of trajectories based on hausdorff distance. In Electronics , Communications and Control (ICECC), 2011 International Conference on , pages 1940 -- 1944 . IEEE, 2011 . Jinyang Chen, Rangding Wang, Liangxu Liu, and Jiatao Song. Clustering of trajectories based on hausdorff distance. In Electronics, Communications and Control (ICECC), 2011 International Conference on, pages 1940--1944. IEEE, 2011."},{"key":"e_1_3_2_1_4_1","volume-title":"Introduction to algorithms","author":"Cormen T. H.","year":"2001","unstructured":"T. H. Cormen . Introduction to algorithms . The MIT press , 2001 . T. H. Cormen. Introduction to algorithms. The MIT press, 2001."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_5_1","DOI":"10.1145\/2424321.2424388"},{"key":"e_1_3_2_1_6_1","volume-title":"Flows in Networks","author":"Ford D. R.","year":"2010","unstructured":"D. R. Ford and D. R. Fulkerson . Flows in Networks . Princeton University Press , Princeton, NJ, USA , 2010 . D. R. Ford and D. R. Fulkerson. Flows in Networks. Princeton University Press, Princeton, NJ, USA, 2010."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_7_1","DOI":"10.1007\/s00778-005-0152-x"},{"key":"e_1_3_2_1_9_1","first-page":"69","article-title":"Completeness and total boundedness of the hausdorff metric","volume":"1","author":"Henrikson Jeff","year":"1999","unstructured":"Jeff Henrikson . Completeness and total boundedness of the hausdorff metric . MIT Undergraduate Journal of Mathematics , 1 : 69 -- 79 , 1999 . Jeff Henrikson. Completeness and total boundedness of the hausdorff metric. MIT Undergraduate Journal of Mathematics, 1:69--79, 1999.","journal-title":"MIT Undergraduate Journal of Mathematics"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_10_1","DOI":"10.1145\/98524.98599"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_11_1","DOI":"10.1145\/142675.142700"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_12_1","DOI":"10.1007\/11568346_30"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_13_1","DOI":"10.1007\/11827252_22"},{"unstructured":"Josephine Marcotty. Federal Funding for Bike Routes Pays Off in Twin Cities. http:\/\/www.startribune.com\/local\/minneapolis\/150105625.html.  Josephine Marcotty. Federal Funding for Bike Routes Pays Off in Twin Cities. http:\/\/www.startribune.com\/local\/minneapolis\/150105625.html.","key":"e_1_3_2_1_14_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_15_1","DOI":"10.14778\/2002974.2002978"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_16_1","DOI":"10.1007\/978-3-642-12098-5_4"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_17_1","DOI":"10.1016\/0020-0190(91)90233-8"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_18_1","DOI":"10.1016\/j.jss.2008.11.832"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_19_1","DOI":"10.1109\/IDEAS.2006.48"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_20_1","DOI":"10.1007\/978-3-642-25437-6_2"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_21_1","DOI":"10.1109\/ICICSE.2009.18"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4614-1629-6","volume-title":"Computing with Spatial Trajectories","author":"Zheng Yu","year":"2011","unstructured":"Yu Zheng and Xiaofang Zhou . Computing with Spatial Trajectories . Springer Publishing Company, Inc orporated, 1st edition, 2011 . Yu Zheng and Xiaofang Zhou. Computing with Spatial Trajectories. Springer Publishing Company, Incorporated, 1st edition, 2011."}],"event":{"sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"],"acronym":"KDD' 13","name":"KDD' 13: The 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","location":"Chicago Illinois"},"container-title":["Proceedings of the 2nd ACM SIGKDD International Workshop on Urban Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2505821.2505835","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2505821.2505835","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:34:16Z","timestamp":1750232056000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2505821.2505835"}},"subtitle":["a case-study on bicycle corridor planning"],"short-title":[],"issued":{"date-parts":[[2013,8,11]]},"references-count":21,"alternative-id":["10.1145\/2505821.2505835","10.1145\/2505821"],"URL":"https:\/\/doi.org\/10.1145\/2505821.2505835","relation":{},"subject":[],"published":{"date-parts":[[2013,8,11]]},"assertion":[{"value":"2013-08-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}