{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:19:55Z","timestamp":1750220395229,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,11,2]],"date-time":"2021-11-02T00:00:00Z","timestamp":1635811200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100003246","name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","doi-asserted-by":"publisher","award":["628.011.005"],"award-info":[{"award-number":["628.011.005"]}],"id":[{"id":"10.13039\/501100003246","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,11,2]]},"DOI":"10.1145\/3474717.3483650","type":"proceedings-article","created":{"date-parts":[[2021,11,4]],"date-time":"2021-11-04T22:59:49Z","timestamp":1636066789000},"page":"41-52","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Route Reconstruction from Traffic Flow via Representative Trajectories"],"prefix":"10.1145","author":[{"given":"Bram","family":"Custers","sequence":"first","affiliation":[{"name":"TU Eindhoven"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wouter","family":"Meulemans","sequence":"additional","affiliation":[{"name":"TU Eindhoven"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bettina","family":"Speckmann","sequence":"additional","affiliation":[{"name":"TU Eindhoven"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kevin","family":"Verbeek","sequence":"additional","affiliation":[{"name":"TU Eindhoven"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,11,4]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Pearson Education","author":"Ahuja R. K.","year":"1993","unstructured":"R. K. Ahuja . Network Flows : Theory, Algorithms, and Applications . Pearson Education , 1993 . R. K. Ahuja. Network Flows: Theory, Algorithms, and Applications. Pearson Education, 1993."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0196-6774(03)00085-3"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218195995000064"},{"key":"e_1_3_2_1_4_1","volume-title":"Proc. KDD Workshop","volume":"370","author":"Berndt D.J.","year":"1994","unstructured":"D.J. Berndt and J. Clifford . Using dynamic time warping to find patterns in time series . In Proc. KDD Workshop , vol. 10(16), pages 359-- 370 , 1994 . D.J. Berndt and J. Clifford. Using dynamic time warping to find patterns in time series. In Proc. KDD Workshop, vol. 10(16), pages 359--370, 1994."},{"key":"e_1_3_2_1_5_1","first-page":"1","volume-title":"Proc. European Symp. on Alg., LIPIcs 57","author":"Bouts Q. W.","year":"2016","unstructured":"Q. W. Bouts , I. Kostitsyna , M. J. van Kreveld , W. Meulemans , W. Sonke , and K. Verbeek . Mapping polygons to the grid with small Hausdorff and Fr\u00e9chet distance . In Proc. European Symp. on Alg., LIPIcs 57 , pages 22: 1 -- 16 , 2016 . Q. W. Bouts, I. Kostitsyna, M. J. van Kreveld, W. Meulemans, W. Sonke, and K. Verbeek. Mapping polygons to the grid with small Hausdorff and Fr\u00e9chet distance. In Proc. European Symp. on Alg., LIPIcs 57, pages 22:1--16, 2016."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1099-128X(199709\/10)11:5<393::AID-CEM483>3.0.CO;2-L"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.3141\/2333-08"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/0191-2615(84)90012-2"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8667.2008.00531.x"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-45738-3_15"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2012.6195830"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2424321.2424402"},{"key":"e_1_3_2_1_13_1","first-page":"37","volume-title":"SSTD","author":"Hu H.","year":"2005","unstructured":"H. Hu and D.-L. Lee Gamma : A framework for moving object simulation In Proc . SSTD , pages 37 -- 65 , 2005 . H. Hu and D.-L. Lee Gamma: A framework for moving object simulation In Proc. SSTD, pages 37--65, 2005."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2017.2647967"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/08073812X"},{"key":"e_1_3_2_1_16_1","first-page":"75","volume-title":"Proc. Workshop on Alg. Eng. and Exp.","author":"Kloster K.","year":"2018","unstructured":"K. Kloster , P. Kuinke , M. P. O'Brien , F. Reidl , F. S. Villaamil , B. D. Sullivan , and A. van der Poel. A practical FPT algorithm for flow decomposition and transcript assembly . In Proc. Workshop on Alg. Eng. and Exp. , pages 75 -- 86 , 2018 . K. Kloster, P. Kuinke, M. P. O'Brien, F. Reidl, F. S. Villaamil, B. D. Sullivan, and A. van der Poel. A practical FPT algorithm for flow decomposition and transcript assembly. In Proc. Workshop on Alg. Eng. and Exp., pages 75--86, 2018."},{"key":"e_1_3_2_1_17_1","volume-title":"Proc. Canadian Conf. on Comput. Geom.","author":"L\u00f6ffler M.","year":"2017","unstructured":"M. L\u00f6ffler and W. Meulemans . Discretized approaches to schematization . In Proc. Canadian Conf. on Comput. Geom. , 2017 . M. L\u00f6ffler and W. Meulemans. Discretized approaches to schematization. In Proc. Canadian Conf. on Comput. Geom., 2017."},{"issue":"2","key":"e_1_3_2_1_18_1","first-page":"57","article-title":"The computational complexity of the m-center problems on the plane","volume":"64","author":"Masuyama S.","year":"1981","unstructured":"S. Masuyama , T. Ibaraki , and T. Hasegawa . The computational complexity of the m-center problems on the plane . IEICE Trans. , 64 ( 2 ): 57 -- 64 , 1981 . S. Masuyama, T. Ibaraki, and T. Hasegawa. The computational complexity of the m-center problems on the plane. IEICE Trans., 64(2):57--64, 1981.","journal-title":"IEICE Trans."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1653771.1653818"},{"key":"e_1_3_2_1_20_1","volume-title":"Planet dump","author":"StreetMap","year":"2020","unstructured":"Open StreetMap contributors. Planet dump retrieved from https:\/\/planet.osm.org. https:\/\/www.openstreetmap.org, 2020 . OpenStreetMap contributors. Planet dump retrieved from https:\/\/planet.osm.org. https:\/\/www.openstreetmap.org, 2020."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.trc.2007.05.002"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2006.05.043"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1137\/140978296"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/SSDBM.2006.11"},{"issue":"3","key":"e_1_3_2_1_25_1","first-page":"547","article-title":"Fast map matching, an algorithm integrating hidden Markov model with precomputation","volume":"32","author":"Yang C.","year":"2018","unstructured":"C. Yang and G. Gidofalvi . Fast map matching, an algorithm integrating hidden Markov model with precomputation . Int. J. of GIS , 32 ( 3 ): 547 -- 570 , 2018 . C. Yang and G. Gidofalvi. Fast map matching, an algorithm integrating hidden Markov model with precomputation. Int. J. of GIS, 32(3):547--570, 2018.","journal-title":"Int. J. of GIS"}],"event":{"name":"SIGSPATIAL '21: 29th International Conference on Advances in Geographic Information Systems","sponsor":["SIGSPATIAL ACM Special Interest Group on Spatial Information"],"location":"Beijing China","acronym":"SIGSPATIAL '21"},"container-title":["Proceedings of the 29th International Conference on Advances in Geographic Information Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3474717.3483650","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3474717.3483650","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:18:43Z","timestamp":1750191523000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3474717.3483650"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,2]]},"references-count":25,"alternative-id":["10.1145\/3474717.3483650","10.1145\/3474717"],"URL":"https:\/\/doi.org\/10.1145\/3474717.3483650","relation":{},"subject":[],"published":{"date-parts":[[2021,11,2]]},"assertion":[{"value":"2021-11-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}