Abstract
Trajectory data is becoming increasingly available and the size of the trajectories is getting larger. In this paper we study the problem of compressing spatio-temporal trajectories such that the most common queries can still be answered approximately after the compression step has taken place. In the process we develop an O(n logk n)-time implementation of the Douglas-Peucker algorithm in the case when the polygonal path of n vertices given as input is allowed to self-intersect.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Agarwal, P.K., Varadarajan, K.R.: Efficient algorithms for approximating polygonal chains. Discrete & Computational Geometry 23(2), 273–291 (2000)
Aronov, B., Bose, P., Demaine, E.D., Gudmundsson, J., Iacono, J., Langerman, S., Smid, M.: Data structures for halfplane proximity queries and incremental Voronoi diagrams. In: Correa, J.R., Hevia, A., Kiwi, M. (eds.) LATIN 2006. LNCS, vol. 3887, pp. 80–92. Springer, Heidelberg (2006)
Cao, H., Wolfson, O., Trajcevski, G.: Spatio-temporal data reduction with deterministic error bounds. In: Proceedings of the 2003 Joint Workshop on Foundations of Mobile Computing, pp. 33–42. ACM Press, New York (2003)
Cao, H., Wolfson, O., Trajcevski, G.: Spatio-temporal data reduction with deterministic error bounds. The VLDB Journal 15(3), 211–228 (2006)
Chan, W.S., Chin, F.: Approximation of polygonal curves with minimum number of line segments. In: Ibaraki, T., Iwama, K., Yamashita, M., Inagaki, Y., Nishizeki, T. (eds.) ISAAC 1992. LNCS, vol. 650, pp. 378–387. Springer, Heidelberg (1992)
Douglas, D.H., Peucker, T.K.: Algorithms for the reduction of the number of points required to represent a digitized line or its caricature. The Canadian Cartographer 10(2), 112–122 (1973)
Frank, A.U.: Socio-Economic Units: Their Life and Motion. In: Frank, A.U., Raper, J., Cheylan, J.P. (eds.) Life and motion of socio-economic units. GISDATA, vol. 8, pp. 21–34. Taylor & Francis, London (2001)
Gudmundsson, J., Laube, P., Wolle, T.: Encyclopedia of GIS. In: Movement Patterns in Spatio-Temporal Data, Springer (to appear)
Güting, R., Boehlen, M.H., Erwig, M., Jensen, C.S., Lorentzos, N., Nardelli, E., Schneider, M., Vazirgiannis, M.: A Foundation for representing and querying moving objects. ACM Transactions on Database Systems 25(1), 1–42 (2005)
Hershberger, J., Snoeyink, J.: Speeding up the Douglas-Peucker line-simplification algorithm. In: Proceedings of the 5th International Symposium on Spatial Data Handling, pp. 134–143. IGU Commission on GIS (1992)
Hershberger, J., Snoeyink, J.: Cartographic line simplification and polygon CSG formulæ in O(n log* n) time. Computational Geometry—Theory and Applications 11(3–4), 175–185 (1998)
Hulbert, I.A.R.: GPS and its use in animal telemetry: The next five years. In: Sibbald, A.M., Gordon, I.J. (eds.) Proceedings of the Conference on Tracking Animals with GPS, Aberdeen, UK, pp. 51–60. Macaulay Insitute (2001)
Imai, H., Iri, M.: Computational-geometric methods for polygonal approximations of a curve. Computer Vision, Graphics, and Image Processing 36(1), 31–41 (1986)
Kwan, M.P.: Interactive geovisualization of activity-travel patterns using three dimensional geographical information systems: A methodological exploration with a large data set. Transportation Research Part C 8(1–6), 185–203 (2000)
Melkman, A., O’Rourke, J.: On polygonal chain approximation. In: Computational Morphology, pp. 87–95. North-Holland, Amsterdam (1988)
Overmars, M., van Leeuwen, J.: Maintenance of configurations in the plane. Journal of Computer and System Sciences 23(2), 166–204 (1981)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gudmundsson, J., Katajainen, J., Merrick, D., Ong, C., Wolle, T. (2007). Compressing Spatio-temporal Trajectories. In: Tokuyama, T. (eds) Algorithms and Computation. ISAAC 2007. Lecture Notes in Computer Science, vol 4835. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77120-3_66
Download citation
DOI: https://doi.org/10.1007/978-3-540-77120-3_66
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77118-0
Online ISBN: 978-3-540-77120-3
eBook Packages: Computer ScienceComputer Science (R0)