{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,19]],"date-time":"2026-05-19T07:13:13Z","timestamp":1779174793730,"version":"3.51.4"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2019,10,4]],"date-time":"2019-10-04T00:00:00Z","timestamp":1570147200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,10,4]],"date-time":"2019-10-04T00:00:00Z","timestamp":1570147200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U1636210"],"award-info":[{"award-number":["U1636210"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012166","name":"973 program","doi-asserted-by":"crossref","award":["2014CB340300"],"award-info":[{"award-number":["2014CB340300"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100015639","name":"Beijing Advanced Innovation Center for Big Data and Brain Computing","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100015639","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1007\/s00778-019-00575-8","type":"journal-article","created":{"date-parts":[[2019,10,4]],"date-time":"2019-10-04T06:39:34Z","timestamp":1570171174000},"page":"897-921","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":21,"title":["One-pass trajectory simplification using the synchronous Euclidean distance"],"prefix":"10.1007","volume":"28","author":[{"given":"Xuelian","family":"Lin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiahao","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4050-0443","authenticated-orcid":false,"given":"Shuai","family":"Ma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yimeng","family":"Zuo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chunming","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,10,4]]},"reference":[{"issue":"3","key":"575_CR1","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/s00778-005-0163-7","volume":"15","author":"H Cao","year":"2006","unstructured":"Cao, H., Wolfson, O., Trajcevski, G.: Spatio-temporal data reduction with deterministic error bounds. VLDBJ 15(3), 211\u2013228 (2006)","journal-title":"VLDBJ"},{"issue":"1","key":"575_CR2","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1142\/S0218195996000058","volume":"6","author":"W Chan","year":"1996","unstructured":"Chan, W., Chin, F.: Approximation of polygonal curves with minimum number of line segments or minimal error. Int. J. Comput. Geom. Appl. 6(1), 378\u2013387 (1996)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"575_CR3","doi-asserted-by":"crossref","unstructured":"Chen, Y., Jiang, K., Zheng, Y., Li, C., Yu, N.: Trajectory simplification method for location-based social networking services. In: LBSN, pp. 33\u201340 (2009)","DOI":"10.1145\/1629890.1629898"},{"issue":"5","key":"575_CR4","doi-asserted-by":"publisher","first-page":"2770","DOI":"10.1109\/TIP.2012.2186146","volume":"21","author":"M Chen","year":"2012","unstructured":"Chen, M., Xu, M., Fr\u00e4nti, P.: A fast multiresolution polygonal approximation algorithm for GPS trajectory simplification. IEEE Trans. Image Process. 21(5), 2770\u20132785 (2012)","journal-title":"IEEE Trans. Image Process."},{"issue":"5","key":"575_CR5","first-page":"698","volume":"17","author":"A Civilis","year":"2005","unstructured":"Civilis, A., Jensen, C.S., Pakalnis, S.: Techniques for efficient road-network-based tracking of moving objects. TKDE 17(5), 698\u2013712 (2005)","journal-title":"TKDE"},{"issue":"2","key":"575_CR6","doi-asserted-by":"publisher","first-page":"112","DOI":"10.3138\/FM57-6770-U75U-7727","volume":"10","author":"DH Douglas","year":"1973","unstructured":"Douglas, D.H., Peucker, T.K.: Algorithms for the reduction of the number of points required to represent a digitized line or its caricature. Can. Cartogr. 10(2), 112\u2013122 (1973)","journal-title":"Can. Cartogr."},{"key":"575_CR7","first-page":"9","volume":"8","author":"JG Dunham","year":"1986","unstructured":"Dunham, J.G.: Piecewise linear approximation of planar curves. PAMI 8, 9\u201367 (1986)","journal-title":"PAMI"},{"issue":"2","key":"575_CR8","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/s10707-014-0216-4","volume":"19","author":"R Gotsman","year":"2015","unstructured":"Gotsman, R., Kanza, Y.: A dilution-matching-encoding compaction of trajectories over road networks. GeoInformatica 19(2), 331\u20133364 (2015)","journal-title":"GeoInformatica"},{"issue":"2","key":"575_CR9","doi-asserted-by":"publisher","first-page":"11:1","DOI":"10.1145\/3015457","volume":"42","author":"Y Han","year":"2017","unstructured":"Han, Y., Sun, W., Zheng, B.: Compress: a comprehensive framework of trajectory compression in road networks. TODS 42(2), 11:1\u201311:9 (2017)","journal-title":"TODS"},{"key":"575_CR10","unstructured":"Heckbert, P.S., Garland, M.: Survey of polygonal surface simplification algorithms. In: SIGGRAPH (1997)"},{"key":"575_CR11","unstructured":"Hershberger, J., Snoeyink, J.: Speeding up the Douglas\u2013Peucker line-simplification algorithm. Technical Report, University of British Columbia (1992)"},{"issue":"2","key":"575_CR12","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/s00778-011-0262-6","volume":"24","author":"CC Hung","year":"2015","unstructured":"Hung, C.C., Peng, W., Lee, W.: Clustering and aggregating clues of trajectories for mining trajectory patterns and routes. VLDBJ 24(2), 169\u2013192 (2015)","journal-title":"VLDBJ"},{"key":"575_CR13","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/S0734-189X(86)80027-5","volume":"36","author":"H Imai","year":"1986","unstructured":"Imai, H., Iri, M.: Computational-geometric methods for polygonal approximations of a curve. Comput. Vis. Graph. Image Process. 36, 31\u201341 (1986)","journal-title":"Comput. Vis. Graph. Image Process."},{"issue":"7","key":"575_CR14","first-page":"841","volume":"10","author":"X Lin","year":"2017","unstructured":"Lin, X., Ma, S., Zhang, H., Wo, T., Huai, J.: One-pass error bounded trajectory simplification. PVLDB 10(7), 841\u2013852 (2017)","journal-title":"PVLDB"},{"key":"575_CR15","doi-asserted-by":"crossref","unstructured":"Liu, J., Zhao, K., Sommer, P., Shang, S., Kusy, B., Jurdak, R.: Bounded quadrant system: Error-bounded trajectory compression on the go. In: ICDE (2015)","DOI":"10.1109\/ICDE.2015.7113350"},{"issue":"11","key":"575_CR16","doi-asserted-by":"publisher","first-page":"2827","DOI":"10.1109\/TKDE.2016.2598171","volume":"28","author":"J Liu","year":"2016","unstructured":"Liu, J., Zhao, K., Sommer, P., Shang, S., Kusy, B., Lee, J.-G., Jurdak, R.: A novel framework for online amnesic trajectory compression in resource-constrained environments. IEEE Trans. Knowl. Data Eng. 28(11), 2827\u20132841 (2016)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"10","key":"575_CR17","first-page":"949","volume":"6","author":"C Long","year":"2013","unstructured":"Long, C., Wong, R.C.-W., Jagadish, H.: Direction-preserving trajectory simplification. PVLDB 6(10), 949\u2013960 (2013)","journal-title":"PVLDB"},{"key":"575_CR18","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/B978-0-444-70467-2.50012-6","volume":"6","author":"A Melkman","year":"1988","unstructured":"Melkman, A., O\u2019Rourke, J.: On polygonal chain approximation. Mach. Intell. Pattern Recognit. 6, 87\u201395 (1988)","journal-title":"Mach. Intell. Pattern Recognit."},{"key":"575_CR19","doi-asserted-by":"publisher","first-page":"765","DOI":"10.1007\/978-3-540-24741-8_44","volume-title":"Advances in Database Technology - EDBT 2004","author":"Nirvana Meratnia","year":"2004","unstructured":"Meratnia, N., de\u00a0By, R.A.: Spatiotemporal compression techniques for moving point objects. In: EDBT (2004)"},{"key":"575_CR20","volume-title":"The Principles of Physics","author":"R Metha","year":"1999","unstructured":"Metha, R., Mehta, V.K.: The Principles of Physics. S Chand, New Delhi (1999)"},{"key":"575_CR21","unstructured":"Mopsi routes 2014. \nhttp:\/\/cs.uef.fi\/mopsi\/routes\/dataset\/\n\n. Accessed 29 Nov 2017"},{"key":"575_CR22","doi-asserted-by":"crossref","unstructured":"Muckell, J., Hwang, J.-H., Lawson, C.T., Ravi, S.S.: Algorithms for compressing gps trajectory data: an empirical evaluation. In: ACM-GIS (2010)","DOI":"10.1145\/1869790.1869847"},{"issue":"3","key":"575_CR23","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1007\/s10707-013-0184-0","volume":"18","author":"J Muckell","year":"2014","unstructured":"Muckell, J., Olsen, P.W., Hwang, J.-H., Lawson, C.T., Ravi, S.S.: Compression of trajectory data: a comprehensive evaluation and new approach. GeoInformatica 18(3), 435\u2013460 (2014)","journal-title":"GeoInformatica"},{"issue":"11","key":"575_CR24","first-page":"3138","volume":"27","author":"A Nibali","year":"2015","unstructured":"Nibali, A., He, Z.: Trajic: an effective compression system for trajectory data. TKDE 27(11), 3138\u20133151 (2015)","journal-title":"TKDE"},{"issue":"4","key":"575_CR25","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1016\/0146-664X(82)90023-5","volume":"19","author":"J O\u2019Rourke","year":"1982","unstructured":"O\u2019Rourke, J., Chien, C.B., Olson, T., Naddor, D.: A new linear algorithm for intersecting convex polygons. Comput. Graph. Image Process. 19(4), 384\u2013391 (1982)","journal-title":"Comput. Graph. Image Process."},{"issue":"8","key":"575_CR26","doi-asserted-by":"publisher","first-page":"860","DOI":"10.1109\/T-C.1974.224041","volume":"23","author":"T Pavlidis","year":"1974","unstructured":"Pavlidis, T., Horowitz, S.L.: Segmentation of plane curves. IEEE Trans. Comput. 23(8), 860\u2013870 (1974)","journal-title":"IEEE Trans. Comput."},{"key":"575_CR27","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/3-540-48482-5_9","volume-title":"Advances in Spatial Databases","author":"Dieter Pfoser","year":"1999","unstructured":"Pfoser, D., Jensen, C.S.: Capturing the uncertainty of moving-object representations. In: SSD (1999)"},{"issue":"1","key":"575_CR28","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/s10707-014-0208-4","volume":"19","author":"IS Popa","year":"2014","unstructured":"Popa, I.S., Zeitouni, K., Oria, V., Kharrat, A.: Spatio-temporal compression of trajectories in road networks. GeoInformatica 19(1), 117\u2013145 (2014)","journal-title":"GeoInformatica"},{"key":"575_CR29","unstructured":"Potamias, M., Patroumpas, K., Sellis, T.K.: Sampling trajectory streams with spatiotemporal criteria. In: SSDBM (2006)"},{"key":"575_CR30","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1016\/S0146-664X(72)80017-0","volume":"1","author":"U Ramer","year":"1972","unstructured":"Ramer, U.: An iterative procedure for the polygonal approximation of plane curves. Comput. Graph. Image Process. 1, 244\u2013256 (1972)","journal-title":"Comput. Graph. Image Process."},{"key":"575_CR31","unstructured":"Reumann, K., Witkam, A.: Optimizing curve segmentation in computer graphics. In: International Computing Symposium (1974)"},{"issue":"1","key":"575_CR32","first-page":"3","volume":"4","author":"K-F Richter","year":"2012","unstructured":"Richter, K.-F., Schmid, F., Laube, P.: Semantic trajectory compression: representing urban movement in a nutshell. J. Spat. Inf. Sci. 4(1), 3\u201330 (2012)","journal-title":"J. Spat. Inf. Sci."},{"key":"575_CR33","doi-asserted-by":"crossref","unstructured":"Schmid, F., Richter, K., Laube, P.: Semantic trajectory compression. In: SSTD, pp. 411\u2013416 (2009)","DOI":"10.1007\/978-3-642-02982-0_30"},{"key":"575_CR34","doi-asserted-by":"crossref","unstructured":"Shamos, M.I., Dan, H.: Geometric intersection problems. In: Symposium on Foundations of Computer Science, pp. 208\u2013215 (1976)","DOI":"10.1109\/SFCS.1976.16"},{"issue":"1","key":"575_CR35","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1179\/000870406X93490","volume":"43","author":"W Shi","year":"2006","unstructured":"Shi, W., Cheung, C.: Performance evaluation of line simplification algorithms for vector generalization. Cartogr. J. 43(1), 27\u201344 (2006)","journal-title":"Cartogr. J."},{"key":"575_CR36","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1016\/0031-3203(80)90031-X","volume":"12","author":"J Sklansky","year":"1980","unstructured":"Sklansky, J., Gonzalez, V.: Fast polygonal approximation of digitized curves. Pattern Recognit. 12, 327\u2013331 (1980)","journal-title":"Pattern Recognit."},{"issue":"9","key":"575_CR37","first-page":"661","volume":"7","author":"R Song","year":"2014","unstructured":"Song, R., Sun, W., Zheng, B., Zheng, Y.: Press: a novel framework of trajectory compression in road networks. PVLDB 7(9), 661\u2013672 (2014)","journal-title":"PVLDB"},{"key":"575_CR38","unstructured":"Toussaint, G.T.: On the complexity of approximating polygonal curves in the plane. In: International Symposium on Robotics and Automation (IASTED) (1985)"},{"key":"575_CR39","doi-asserted-by":"crossref","unstructured":"Trajcevski, G., Cao, H., Scheuermanny, P., Wolfsonz, O., Vaccaro, D.: On-line data reduction and the quality of history in moving objects databases. In: MobiDE (2006)","DOI":"10.1145\/1140104.1140110"},{"key":"575_CR40","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1016\/0146-664X(78)90055-2","volume":"8","author":"CM Williams","year":"1978","unstructured":"Williams, C.M.: An efficient algorithm for the piecewise linear approximation of planar curves. Comput. Graph. Image Process. 8, 286\u2013293 (1978)","journal-title":"Comput. Graph. Image Process."},{"issue":"11","key":"575_CR41","first-page":"934","volume":"9","author":"D Zhang","year":"2018","unstructured":"Zhang, D., Ding, M., Yang, D., Liu, Y., Fan, J., Shen, H.T.: Trajectory simplification: an experimental study and quality analysis. PVLDB 9(11), 934\u2013946 (2018)","journal-title":"PVLDB"},{"key":"575_CR42","unstructured":"Zhao, Z., Saalfeld, A.: Linear-time sleeve-fitting polyline simplification algorithms. In: Proceedings of AutoCarto, pp. 214\u2013223 (1997)"},{"issue":"2","key":"575_CR43","first-page":"32","volume":"33","author":"Y Zheng","year":"2010","unstructured":"Zheng, Y., Xie, X., Ma, W.: GeoLife: a collaborative social networking service among user, location and trajectory. IEEE Data Eng. Bull. 33(2), 32\u201339 (2010)","journal-title":"IEEE Data Eng. Bull."},{"key":"575_CR44","doi-asserted-by":"crossref","unstructured":"Z\u00fcfle, A., Trajcevski, G., Pfoser, D., Renz, M., Rice, M.T., Leslie, T., Delamater, P.L., Emrich, T.: Handling uncertainty in geo-spatial data. In: ICDE (2017)","DOI":"10.1109\/ICDE.2017.212"}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-019-00575-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00778-019-00575-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-019-00575-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,2]],"date-time":"2020-10-02T23:13:32Z","timestamp":1601680412000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00778-019-00575-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,10,4]]},"references-count":44,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2019,12]]}},"alternative-id":["575"],"URL":"https:\/\/doi.org\/10.1007\/s00778-019-00575-8","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,10,4]]},"assertion":[{"value":"9 January 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 August 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 September 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 October 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}