Constrained free space diagrams: A tool for trajectory analysis

International Journal of Geographical Information Science

Volumn 24, Issue 7, 2010, Pages 1101-1125

  Buchin, Kevin ^a   Buchin, Maike ^b   Gudmundsson, Joachim ^c  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b UTRECHT UNIVERSITY   (Netherlands)

^c NICTA ^*  (Netherlands)

Author keywords

Movement patterns; Similarity measure; Single file movement; Trajectories

Indexed keywords

ALGORITHM; GEOMETRY; MOVEMENT; TRAJECTORY;

EID: 77953648837     PISSN: 13658816     EISSN: 13623087     Source Type: Journal    
DOI: 10.1080/13658810903569598     Document Type: Article

References (33)

1. Agarwal, P., et al., 2005. Near-linear time approximation algorithms for curve simplification. Algorithmica, 42 (3-4), 203-219.
2. Agrawal, R., et al., 1995. Fast similarity search in the presence of noise, scaling, and translation in time- series databases. Proc. 21st International Conference on Very Large Data Bases (VLDB), 490-501.
3. Alt, H., Behrends, B., and Blomer, J., 1995. Approximate matching of polygonal shapes. Annals of Mathematics and Artificial Intelligence, 3-4, 251-265.
4. Alt, H. and Godau, M., 1995. Computing the Fréchet distance between two polygonal curves. International Journal on Computational Geometry and Applications, 5, 75-91.
5. Alt, H. and Guibas, L., 1999. Discrete geometric shapes: matching, interpolation, and approximation. In: J.R. Sack and J. Urrutia, eds. Handbook of computational geometry. North-Holland, Amsterdam: Elsevier, 121-153.
6. Alt, H., Knauer, C., and Wenk, C., 2004. Comparison of distance measures for planar curves. Algorithmica, 38(2), 45-58.
7. Andersson, M., et al., 2008. Reporting leaders and followers among trajectories of moving point objects. GeoInformatica, 12(4), 497-528.
8. Benkert, M., et al., 2007. Finding popular places. Proc. 18th International Symposium on Algorithms and Computation (ISAAC), 776-787.
9. Benkert, M., et al., 2008. Reporting flock patterns. Computational Geometry - Theory & Applications, 41(3),111-125.
10. Buchin, K., Buchin, M., and Gudmundsson, J., 2008a. Detecting single file movement. Proc. 16th ACM SIGSPATIAL International Conference on Advances in geographic information systems (ACM GIS), 288-297.
11. Buchin, K., et al., 2008b. Detecting commuting patterns by clustering subtrajectories. Proc. 19th International Symposium on Algorithms and Computation (ISAAC), 644-655.
12. Buchin, K., Buchin, M., and Wang, Y., 2009a. Exact algorithms for partial curve matching via the Fréchet distance. Proc. 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 645-654.
13. Buchin, K., et al., 2009b. Finding Long and Similar Parts of Trajectories. Proc. 17th Annu. ACM Int. Symp. on Advances in Geographic Information Systems (ACM GIS'09), 296-305.
14. Cook IV, A. and Wenk, C. 2008a Geodesic Fréchet distance with polygonal obstacles. Technical report CS-TR-2008-0010, University of Texas at San Antonio.
15. Cook IV, A. and Wenk, C. 2008b Min-link shortest path maps and Fréchet distance. Technical report CS-TR-2008-0011, University of Texas at San Antonio.
16. nd International Conference on Knowledge Discovery and Data Mining (KDD), 226-231.
17. Fish, F.E., 1999. Energetics of swimming and flying in formation. Comments on Theoretical Biology, 5,283-304.
18. Gudmundsson, J., and van Kreveld, M., 2006. Computing longest duration flocks in trajectory data. 14th ACM International Symposium on Geographic Information Systems (ACM GIS), 35-42.
19. Gudmundsson, J., van Kreveld, M., and Speckmann, B., 2007. Efficient detection of motion patterns in spatio-temporal data sets. GeoInformatica, 11(2), 195-215.
20. Jensen, C.S., Lin, D., and Ooi, B.C., 2007. Continuous clustering of moving object. IEEE Transactions on Data Engineering, 19(9), 1161-1174.
21. Jeung, H., et al., 2008. Discovery of convoys in trajectory databases. Proceedings of the VLDB Endowment, 1(1), 1068-1080.
22. Kalnis, P., Mamoulis, N., and Bakiras, S., 2005. On discovering moving clusters in spatiotemporal data. Proc. 9th International Symposium on Advances in Spatial and Temporal Databases (SSTD), 364-381.
23. Kalpakis, K., Gada, D., and Puttagunta, V., 2001. Distance measures for effective clustering of ARIMA time-series. Proc. 1st IEEE International Conference on Data Mining, 273-280.
24. Laube, P., van Kreveld, M., and Imfeld, S., 2004. Finding REMO - detecting relative motion patterns in geospatial lifelines. Proc. 11th International Symposium on Spatial Data Handling (SDH), 201-214.
25. Laube, P. and Purves, R.S., 2006. An approach to evaluating motion pattern detection techniques in spatio-temporal data. Computers, Environment and Urban Systems, 30 (3), 347-374.
26. Lee, J.G., Han, J., and Whang, K.Y., 2007. Trajectory clustering: a partition-and-group framework. Proc. ACM SIGMOD International Conference on Management of Data, 593-604.
27. Nanni, M. and Pedreschi, D., 2006. Time-focused density-based clustering of trajectories of moving objects. Journal of Intelligent Information Systems, 27(3), 267-289.
28. Trajcevski, G., et al., 2007. Dynamics-aware similarity of moving objects trajectories. Proc. 15th Annu. ACM Int. Symp. on Advances in Geographic Information Systems (ACM GIS), 75-82.
29. Tremblay, Y., et al., 2006. Interpolation of animal tracking data in a fluid environment. Journal of Experimental Biology, 209, 128-140.
30. Turchin, P., 1998. Quantitative analysis of movement: measuring and modelling population redis- tribution in animals. Sunderland, MA: Sinauer Associates.
31. Veltkamp, R.C. and Hagedoorn, M., 2001. State-of-the-art in shape matching. In: M. Lew, ed. Principles of visual information retrieval. London: Springer, 87-119.
32. Verhein, F. and Chawla, S., 2006. Mining spatio-temporal association rules, sources, sinks, stationary regions and thoroughfares in object mobility databases. Proc. 11th International Conference on Database Systems for Advanced Applications (DASFAA), 187-201.
33. Vlachos, M., Gunopulos, D., and Kollios, G., 2002. Discovering similar multidimensional trajectories. Proc. 18th Internat. Conference on Data Engineering, 673-684.