{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T10:56:05Z","timestamp":1770980165194,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642157745","type":"print"},{"value":"9783642157752","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15775-2_40","type":"book-chapter","created":{"date-parts":[[2010,9,1]],"date-time":"2010-09-01T14:47:32Z","timestamp":1283352452000},"page":"463-474","source":"Crossref","is-referenced-by-count":6,"title":["Median Trajectories"],"prefix":"10.1007","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","reference":[{"key":"40_CR1","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. CCCG, pp. 43\u201346 (2005)"},{"key":"40_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/3-540-45749-6_5","volume-title":"Algorithms - ESA 2002","author":"P.K. Agarwal","year":"2002","unstructured":"Agarwal, P.K., Gao, J., Guibas, L.J.: Kinetic medians and kd-trees. In: M\u00f6hring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol.\u00a02461, pp. 5\u201316. Springer, Heidelberg (2002)"},{"key":"40_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.\u00a026, 353\u2013374 (2001)","journal-title":"Discrete Comput. Geom."},{"key":"40_CR4","doi-asserted-by":"publisher","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.\u00a023, 305\u2013323 (2000)","journal-title":"Discrete Comput. Geom."},{"key":"40_CR5","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.\u00a05369, pp. 644\u2013655. Springer, Heidelberg (2008)"},{"key":"40_CR6","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.\u00a031, 61\u201381 (2004)","journal-title":"Discrete Comput. Geom."},{"key":"40_CR7","doi-asserted-by":"publisher","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.\u00a021, 405\u2013420 (1999)","journal-title":"Discrete Comput. Geom."},{"key":"40_CR8","doi-asserted-by":"publisher","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.\u00a042, 364\u2013375 (2009)","journal-title":"Comput. Geom."},{"key":"40_CR9","doi-asserted-by":"publisher","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.\u00a016, 345\u2013372 (2006)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"40_CR10","doi-asserted-by":"publisher","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.\u00a018, 161\u2013183 (2008)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"40_CR11","doi-asserted-by":"crossref","unstructured":"Gaffney, S., Smyth, P.: Trajectory clustering with mixtures of regression models. In: Proc. 5th KDD, pp. 63\u201372 (1999)","DOI":"10.1145\/312129.312198"},{"key":"40_CR12","doi-asserted-by":"publisher","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\u00a011, 195\u2013215 (2007)","journal-title":"GeoInformatica"},{"key":"40_CR13","first-page":"529","volume-title":"Handbook of Discrete and Comput. Geom","author":"D. Halperin","year":"2004","unstructured":"Halperin, D.: Arrangements. In: Goodmann, J.E., O\u2019Rourke, J. (eds.) Handbook of Discrete and Comput. Geom, pp. 529\u2013562. Chapman & Hall\/CRC, Boca Raton (2004)"},{"issue":"4","key":"40_CR14","doi-asserted-by":"publisher","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.\u00a030(4), 1341\u20131367 (2000)","journal-title":"SIAM J. Comput."},{"key":"40_CR15","doi-asserted-by":"publisher","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.\u00a04, 63\u201397 (1994)","journal-title":"Comput. Geom."},{"key":"40_CR16","doi-asserted-by":"publisher","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.\u00a01, 59\u201370 (1986)","journal-title":"Discrete Comput. Geom."},{"key":"40_CR17","doi-asserted-by":"publisher","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. Comp., Env. and Urb. Syst.\u00a030, 347\u2013374 (2006)","journal-title":"Comp., Env. and Urb. Syst."},{"key":"40_CR18","doi-asserted-by":"crossref","unstructured":"Lee, J., Han, J., Whang, K.-Y.: Trajectory clustering: a partition-and-group framework. In: Proc. ACM SIGMOD Int. Conf. Man. of Data, pp. 593\u2013604 (2007)","DOI":"10.1145\/1247480.1247546"},{"key":"40_CR19","doi-asserted-by":"crossref","unstructured":"Lee, J.-G., Han, J., Li, X., Gonzalez, H.: TraClass: Trajectory classification using hierarchical region-based and trajectory-based clustering. In: PVLDB 2008, pp. 1081\u20131094 (2008)","DOI":"10.14778\/1453856.1453972"},{"key":"40_CR20","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1016\/0925-7721(93)90007-S","volume":"3","author":"A.F. Stappen van der","year":"1993","unstructured":"van der Stappen, A.F., Halperin, D., Overmars, M.H.: The complexity of the free space for a robot moving amidst fat obstacles. Comput. Geom.\u00a03, 353\u2013373 (1993)","journal-title":"Comput. Geom."}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15775-2_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,3]],"date-time":"2019-06-03T00:19:00Z","timestamp":1559521140000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15775-2_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642157745","9783642157752"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15775-2_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}