{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T15:52:08Z","timestamp":1762271528664},"reference-count":24,"publisher":"Elsevier BV","issue":"9","license":[{"start":{"date-parts":[[2011,11,1]],"date-time":"2011-11-01T00:00:00Z","timestamp":1320105600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/https\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2015,11,1]],"date-time":"2015-11-01T00:00:00Z","timestamp":1446336000000},"content-version":"vor","delay-in-days":1461,"URL":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/https\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Geometry"],"published-print":{"date-parts":[[2011,11]]},"DOI":"10.1016\/j.comgeo.2011.05.004","type":"journal-article","created":{"date-parts":[[2011,5,21]],"date-time":"2011-05-21T08:15:59Z","timestamp":1305965759000},"page":"465-476","source":"Crossref","is-referenced-by-count":38,"title":["Finding long and similar parts of trajectories"],"prefix":"10.1016","volume":"44","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":"Jun","family":"Luo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.comgeo.2011.05.004_br0010","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1007\/s00453-001-0096-5","article-title":"Efficiently approximating polygonal paths in three and higher dimensions","volume":"33","author":"Barequet","year":"2002","journal-title":"Algorithmica"},{"key":"10.1016\/j.comgeo.2011.05.004_br0020","doi-asserted-by":"crossref","unstructured":"T. Bernholt, F. Eisenbrand, T. Hofmeister, A geometric framework for solving subsequence problems in computational biology efficiently, in: Proc. 23rd ACM Symp. on Comput. Geom. (SOCG\u02bc07), 2007, pp. 310\u2013318.","DOI":"10.1145\/1247069.1247125"},{"key":"10.1016\/j.comgeo.2011.05.004_br0030","doi-asserted-by":"crossref","first-page":"1101","DOI":"10.1080\/13658810903569598","article-title":"Constrained free space diagrams: a tool for trajectory analysis","volume":"24","author":"Buchin","year":"2010","journal-title":"International Journal of Geographical Information Science"},{"key":"10.1016\/j.comgeo.2011.05.004_br0040","unstructured":"K. Buchin, M. Buchin, J. Gudmundsson, M. L\u00f6ffler, J. Luo, Detecting commuting patterns by clustering subtrajectories, Int. J. Comput. Geom. and Appl., Special Issue: Selected Papers from the 19th Int. Symp. on Algorithms and Computation (ISAAC\u02bc08), in press."},{"key":"10.1016\/j.comgeo.2011.05.004_br0050","doi-asserted-by":"crossref","unstructured":"K. Buchin, M. Buchin, Y. Wang, Exact algorithms for partial curve matching via the Fr\u00e9chet distance, in: Proc. 20th Annual ACM\u2013SIAM Symposium on Discrete Algorithms (SODA\u02bc09), 2009, pp. 645\u2013654.","DOI":"10.1137\/1.9781611973068.71"},{"key":"10.1016\/j.comgeo.2011.05.004_br0060","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/s00778-005-0163-7","article-title":"Spatio-temporal data reduction with deterministic error bounds","volume":"15","author":"Cao","year":"2006","journal-title":"VLDB Journal"},{"key":"10.1016\/j.comgeo.2011.05.004_br0070","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1137\/S0097539704440430","article-title":"An optimal algorithm for the maximum-density segment problem","volume":"34","author":"Chung","year":"2005","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.comgeo.2011.05.004_br0080","doi-asserted-by":"crossref","unstructured":"L. Chen, M. Tamer \u00d6zsu, V. Oria, Robust and fast similarity search for moving object trajectories, in: Proc. 2005 ACM SIGMOD Int. Conf. on Management of data (SIGMOD\u02bc05), 2005, pp. 491\u2013502.","DOI":"10.1145\/1066157.1066213"},{"key":"10.1016\/j.comgeo.2011.05.004_br0090","doi-asserted-by":"crossref","unstructured":"E. Frentzos, K. Gratsias, Y. Theodoridis, Index-based most similar trajectory search, in: Proc. IEEE 23rd Int. Conf. on Data Engineering, 2007, pp. 816\u2013825.","DOI":"10.1109\/ICDE.2007.367927"},{"key":"10.1016\/j.comgeo.2011.05.004_br0100","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1016\/j.jcss.2004.08.001","article-title":"Linear-time algorithms for computing maximum-density sequence segments with bioinformatics applications","volume":"70","author":"Goldwasser","year":"2005","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/j.comgeo.2011.05.004_br0110","doi-asserted-by":"crossref","unstructured":"J. Gudmundsson, J. Katajainen, D. Merrick, C. Ong, T. Wolle, Compressing spatio-temporal trajectories, in: Proc. Int. Symp. on Algorithms and Computation (ISAAC\u02bc07), 2007, pp. 763\u2013775.","DOI":"10.1007\/978-3-540-77120-3_66"},{"key":"10.1016\/j.comgeo.2011.05.004_br0120","first-page":"726","article-title":"Movement patterns in spatio-temporal data","author":"Gudmundsson","year":"2008"},{"key":"10.1016\/j.comgeo.2011.05.004_br0130","series-title":"Handbook of Discrete and Computational Geometry","first-page":"389","article-title":"Arrangements","author":"Halperin","year":"2004"},{"key":"10.1016\/j.comgeo.2011.05.004_br0140","doi-asserted-by":"crossref","unstructured":"E.J. Keogh, M.J. Pazzani, Scaling up dynamic time warping for datamining applications, in: Proc. 4th Asia\u2013Pacific Conf. on Knowledge Discovery and Data Mining (PADKK\u02bc00), 2000, pp. 285\u2013289.","DOI":"10.1145\/347090.347153"},{"key":"10.1016\/j.comgeo.2011.05.004_br0150","doi-asserted-by":"crossref","unstructured":"M. van Kreveld, J. Luo, The definition and computation of trajectory and subtrajectory similarity, in: Proc. 15th ACM Int. Symp. on Geographic Information Systems (ACM-GIS\u02bc07), 2007, pp. 44\u201347.","DOI":"10.1145\/1341012.1341068"},{"key":"10.1016\/j.comgeo.2011.05.004_br0160","doi-asserted-by":"crossref","first-page":"1081","DOI":"10.14778\/1453856.1453972","article-title":"TraClass: Trajectory classification using hierarchical region-based and trajectory-based clustering","volume":"1","author":"Lee","year":"2008","journal-title":"Proceedings of the VLDB Endowment"},{"key":"10.1016\/j.comgeo.2011.05.004_br0170","doi-asserted-by":"crossref","unstructured":"J. Lee, J. Han, K.-Y. Whang, Trajectory clustering: a partition-and-group framework, in: Proc. 2007 ACM SIGMOD International Conference on Management of Data (SIGMOD\u02bc07), 2007, pp. 593\u2013604.","DOI":"10.1145\/1247480.1247546"},{"key":"10.1016\/j.comgeo.2011.05.004_br0180","doi-asserted-by":"crossref","first-page":"570","DOI":"10.1016\/S0022-0000(02)00010-7","article-title":"Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysis","volume":"65","author":"Lin","year":"2002","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/j.comgeo.2011.05.004_br0190","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1007\/s10844-006-9953-7","article-title":"Time-focused clustering of trajectories of moving objects","volume":"27","author":"Nanni","year":"2006","journal-title":"J. Intell. Inf. Syst."},{"key":"10.1016\/j.comgeo.2011.05.004_br0200","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/s10109-005-0153-8","article-title":"Measuring similarity between geospatial lifelines in studies of environment health","volume":"7","author":"Sinha","year":"2005","journal-title":"J. Geographical Systems"},{"key":"10.1016\/j.comgeo.2011.05.004_br0210","doi-asserted-by":"crossref","unstructured":"G. Trajcevski, H. Ding, P. Scheuermann, R. Tamassia, D. Vaccaro, Dynamics-aware similarity of moving objects trajectories, in: Proc. 15th ACM Int. Symp. on Geographic Information Systems (ACM-GIS\u02bc07), 2007, pp. 1\u20138.","DOI":"10.1145\/1341012.1341027"},{"key":"10.1016\/j.comgeo.2011.05.004_br0220","first-page":"673","article-title":"Discovering similar multidimensional trajectories","author":"Vlachos","year":"2002"},{"key":"10.1016\/j.comgeo.2011.05.004_br0230","doi-asserted-by":"crossref","unstructured":"M. Vlachos, D. Gunopulos, G. Das, Rotation invariant distance measures for trajectories, in: Proc. 10th ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining (KDD\u02bc04), 2004, pp. 707\u2013712.","DOI":"10.1145\/1014052.1014144"},{"key":"10.1016\/j.comgeo.2011.05.004_br0240","doi-asserted-by":"crossref","unstructured":"Y. Yanagisawa, J. Akahani, T. Satoh, Shape-based similarity query for trajectory of mobile objects, in: Proc. 4th Int. Conf. on Mobile Data Management (MDM\u02bc03), 2003, pp. 63\u201377.","DOI":"10.1007\/3-540-36389-0_5"}],"container-title":["Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0925772111000344?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0925772111000344?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,12,2]],"date-time":"2018-12-02T18:54:57Z","timestamp":1543776897000},"score":1,"resource":{"primary":{"URL":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/https\/linkinghub.elsevier.com\/retrieve\/pii\/S0925772111000344"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,11]]},"references-count":24,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2011,11]]}},"alternative-id":["S0925772111000344"],"URL":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/https\/doi.org\/10.1016\/j.comgeo.2011.05.004","relation":{},"ISSN":["0925-7721"],"issn-type":[{"value":"0925-7721","type":"print"}],"subject":[],"published":{"date-parts":[[2011,11]]}}}