{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:24:45Z","timestamp":1760441085083},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2013,7]]},"DOI":"10.1007\/s00453-012-9654-2","type":"journal-article","created":{"date-parts":[[2012,5,4]],"date-time":"2012-05-04T20:29:16Z","timestamp":1336163356000},"page":"595-614","source":"Crossref","is-referenced-by-count":41,"title":["Median Trajectories"],"prefix":"10.1007","volume":"66","author":[{"given":"Kevin","family":"Buchin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maike","family":"Buchin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marc","family":"van Kreveld","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maarten","family":"L\u00f6ffler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rodrigo I.","family":"Silveira","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carola","family":"Wenk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lionov","family":"Wiratma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,5,5]]},"reference":[{"key":"9654_CR1","first-page":"43","volume-title":"Proc. 17th Canadian Conf. on Comput. Geom.","author":"P.K. Agarwal","year":"2005","unstructured":"Agarwal, P.K., de Berg, M., Gao, J., Guibas, L.J.: Staying in the middle: Exact and approximate medians in R1 and R2 for moving points. In: Proc. 17th Canadian Conf. on Comput. Geom., pp. 43\u201346 (2005)"},{"key":"9654_CR2","first-page":"5","volume-title":"Proc. 10th European Symp. on Algorithms","author":"P.K. Agarwal","year":"2002","unstructured":"Agarwal, P.K., Gao, J., Guibas, L.J.: Kinetic medians and kd-trees. In: Proc. 10th European Symp. on Algorithms, pp. 5\u201316 (2002)"},{"key":"9654_CR3","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/s00454-001-0019-x","volume":"26","author":"P.K. Agarwal","year":"2001","unstructured":"Agarwal, P.K., Guibas, L.J., Hershberger, J., Veach, E.: Maintaining the extent of a moving point set. Discrete Comput. Geom. 26, 353\u2013374 (2001)","journal-title":"Discrete Comput. Geom."},{"key":"9654_CR4","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1142\/S0218195997000211","volume":"7","author":"O. Aichholzer","year":"1997","unstructured":"Aichholzer, O., Alt, H., Rote, G.: Matching shapes with a reference point. Int. J. Comput. Geom. Appl. 7, 349\u2013363 (1997)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"9654_CR5","doi-asserted-by":"crossref","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":"9654_CR6","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1007\/PL00009502","volume":"23","author":"N. Amenta","year":"2000","unstructured":"Amenta, N., Bern, M.W., Eppstein, D., Teng, S.-H.: Regression depth and center points. Discrete Comput. Geom. 23, 305\u2013323 (2000)","journal-title":"Discrete Comput. Geom."},{"key":"9654_CR7","volume-title":"Basic Topology","author":"M.A. Armstrong","year":"1979","unstructured":"Armstrong, M.A.: Basic Topology. Springer, Berlin (1979)"},{"issue":"3","key":"9654_CR8","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1142\/S0218195911003652","volume":"21","author":"K. Buchin","year":"2011","unstructured":"Buchin, K., Buchin, M., Gudmundsson, J., L\u00f6ffler, M., Luo, J.: Detecting commuting patterns by clustering subtrajectories. Int. J. Comput. Geom. Appl. 21(3), 253\u2013282 (2011)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"9654_CR9","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/s00454-003-2949-y","volume":"31","author":"S. Cabello","year":"2004","unstructured":"Cabello, S., Liu, Y., Mantler, A., Snoeyink, J.: Testing homotopy for paths in the plane. Discrete Comput. Geom. 31, 61\u201381 (2004)","journal-title":"Discrete Comput. Geom."},{"issue":"3","key":"9654_CR10","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/j.comgeo.2009.02.008","volume":"43","author":"E.W. Chambers","year":"2010","unstructured":"Chambers, E.W., Colin de Verdi\u00e8re, E., Erickson, J., Lazard, S., Lazarus, F., Thite, S.: Homotopic Fr\u00e9chet distance between curves or, walking your dog in the woods in polynomial time. Comput. Geom. 43(3), 295\u2013311 (2010)","journal-title":"Comput. Geom."},{"key":"9654_CR11","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1007\/PL00009429","volume":"21","author":"F.Y.L. Chin","year":"1999","unstructured":"Chin, F.Y.L., Snoeyink, J., Wang, C.A.: Finding the medial axis of a simple polygon in linear time. Discrete Comput. Geom. 21, 405\u2013420 (1999)","journal-title":"Discrete Comput. Geom."},{"key":"9654_CR12","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/PL00009354","volume":"19","author":"T.K. Dey","year":"1998","unstructured":"Dey, T.K.: Improved bounds for planar k-sets and related problems. Discrete Comput. Geom. 19, 373\u2013382 (1998)","journal-title":"Discrete Comput. Geom."},{"issue":"3\u20134","key":"9654_CR13","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1057\/PALGRAVE.IVS.9500182","volume":"7","author":"S. Dodge","year":"2008","unstructured":"Dodge, S., Weibel, R., Lautensch\u00fctz, A.-K.: Towards a taxonomy of movement patterns. Inf. Vis. 7(3\u20134), 240\u2013252 (2008)","journal-title":"Inf. Vis."},{"key":"9654_CR14","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1142\/S0218195906002075","volume":"16","author":"S. Durocher","year":"2006","unstructured":"Durocher, S., Kirkpatrick, D.G.: The Steiner centre of a set of points: Stability, eccentricity, and applications to mobile facility location. Int. J. Comput. Geom. Appl. 16, 345\u2013372 (2006)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"9654_CR15","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1142\/S021819590800257X","volume":"18","author":"S. Durocher","year":"2008","unstructured":"Durocher, S., Kirkpatrick, D.G.: Bounded-velocity approximation of mobile Euclidean 2-centres. Int. J. Comput. Geom. Appl. 18, 161\u2013183 (2008)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"9654_CR16","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1016\/j.comgeo.2008.06.006","volume":"42","author":"S. Durocher","year":"2009","unstructured":"Durocher, S., Kirkpatrick, D.: The projection median of a set of points. Comput. Geom. 42, 364\u2013375 (2009)","journal-title":"Comput. Geom."},{"key":"9654_CR17","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-61568-9","volume-title":"Algorithms in Combinatorial Geometry","author":"H. Edelsbrunner","year":"1987","unstructured":"Edelsbrunner, H.: Algorithms in Combinatorial Geometry. Springer, Berlin (1987)"},{"key":"9654_CR18","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1137\/1.9781611973068.19","volume-title":"Proc. 20th Symp. on Discrete Algorithms","author":"D. Eppstein","year":"2009","unstructured":"Eppstein, D., Mumford, E.: Self-overlapping curves revisited. In: Proc. 20th Symp. on Discrete Algorithms, pp. 160\u2013169 (2009)"},{"key":"9654_CR19","first-page":"63","volume-title":"Proc. 5th Int. Conf. on Knowledge Discovery and Data Mining","author":"S. Gaffney","year":"1999","unstructured":"Gaffney, S., Smyth, P.: Trajectory clustering with mixtures of regression models. In: Proc. 5th Int. Conf. on Knowledge Discovery and Data Mining, pp. 63\u201372 (1999)"},{"key":"9654_CR20","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/s10707-006-0002-z","volume":"11","author":"J. Gudmundsson","year":"2007","unstructured":"Gudmundsson, J., van Kreveld, M., Speckmann, B.: Efficient detection of patterns in 2D trajectories of moving points. GeoInformatica 11, 195\u2013215 (2007)","journal-title":"GeoInformatica"},{"key":"9654_CR21","first-page":"529","volume-title":"Handbook of Discrete and Computational Geometry","author":"D. Halperin","year":"2004","unstructured":"Halperin, D.: Arrangements. In: Goodmann, J.E., O\u2019Rourke, J. (eds.) Handbook of Discrete and Computational Geometry, pp. 529\u2013562. Chapman & Hall\/CRC, Boca Raton (2004)"},{"issue":"4","key":"9654_CR22","doi-asserted-by":"crossref","first-page":"1341","DOI":"10.1137\/S0097539799362627","volume":"30","author":"S. Har-Peled","year":"2000","unstructured":"Har-Peled, S.: Taking a walk in a planar arrangement. SIAM J. Comput. 30(4), 1341\u20131367 (2000)","journal-title":"SIAM J. Comput."},{"key":"9654_CR23","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0925-7721(94)90010-8","volume":"4","author":"J. Hershberger","year":"1994","unstructured":"Hershberger, J., Snoeyink, J.: Computing minimum length paths of a given homotopy class. Comput. Geom. 4, 63\u201397 (1994)","journal-title":"Comput. Geom."},{"issue":"3","key":"9654_CR24","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1006\/jagm.1995.1017","volume":"18","author":"J. Hershberger","year":"1995","unstructured":"Hershberger, J., Suri, S.: A pedestrian approach to ray shooting: Shoot a ray, take a walk. J. Algorithms 18(3), 403\u2013431 (1995)","journal-title":"J. Algorithms"},{"key":"9654_CR25","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/BF02187683","volume":"1","author":"K. Kedem","year":"1986","unstructured":"Kedem, K., Livne, R., Pach, J., Sharir, M.: On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles. Discrete Comput. Geom. 1, 59\u201370 (1986)","journal-title":"Discrete Comput. Geom."},{"key":"9654_CR26","doi-asserted-by":"crossref","first-page":"1168","DOI":"10.1007\/978-0-387-35973-1_1401","volume-title":"Encyclopedia of GIS","author":"G. Kollios","year":"2008","unstructured":"Kollios, G., Vlachos, M., Gunopulos, D.: Discovering similar trajectories. In: Shekhar, S., Xiong, H. (eds.) Encyclopedia of GIS, pp. 1168\u20131173. Springer, Berlin (2008)"},{"key":"9654_CR27","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1016\/j.compenvurbsys.2005.09.001","volume":"30","author":"P. Laube","year":"2006","unstructured":"Laube, P., Purves, R.S.: An approach to evaluating motion pattern detection techniques in spatio-temporal data. Comput. Environ. Urban Syst. 30, 347\u2013374 (2006)","journal-title":"Comput. Environ. Urban Syst."},{"key":"9654_CR28","first-page":"593","volume-title":"Proc. ACM SIGMOD Int. Conf. on Management of Data","author":"J. Lee","year":"2007","unstructured":"Lee, J., Han, J., Whang, K.-Y.: Trajectory clustering: a partition-and-group framework. In: Proc. ACM SIGMOD Int. Conf. on Management of Data, pp. 593\u2013604 (2007)"},{"key":"9654_CR29","first-page":"1081","volume-title":"PVLDB \u201908","author":"J.-G. Lee","year":"2008","unstructured":"Lee, J.-G., Han, J., Li, X., Gonzalez, H.: TraClass: Trajectory classification using hierarchical region-based and trajectory-based clustering. In: PVLDB \u201908, pp. 1081\u20131094 (2008)"},{"key":"9654_CR30","volume-title":"Topology: A First Course","author":"J.R. Munkres","year":"1975","unstructured":"Munkres, J.R.: Topology: A First Course. Prentice-Hall, Englewood Cliffs (1975)"},{"key":"9654_CR31","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/s004540010022","volume":"26","author":"G. T\u00f3th","year":"2001","unstructured":"T\u00f3th, G.: Point sets with many k-sets. Discrete Comput. Geom. 26, 187\u2013194 (2001)","journal-title":"Discrete Comput. Geom."},{"key":"9654_CR32","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1016\/0925-7721(93)90007-S","volume":"3","author":"A.F. Stappen van\u00a0der","year":"1993","unstructured":"van\u00a0der Stappen, A.F., Halperin, D., Overmars, M.H.: The complexity of the free space for a robot moving amidst fat obstacles. Comput. Geom. 3, 353\u2013373 (1993)","journal-title":"Comput. Geom."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-012-9654-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,20]],"date-time":"2017-06-20T18:21:44Z","timestamp":1497982904000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-012-9654-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,5,5]]},"references-count":32,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,7]]}},"alternative-id":["9654"],"URL":"https:\/\/doi.org\/10.1007\/s00453-012-9654-2","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,5,5]]}}}