On Computing the Time-varying Distance between Moving Bodies
Article No.: 29, Pages 1 - 28
Abstract
A moving body is a geometry that may translate and rotate over time. Computing the time-varying distance between moving bodies and surrounding static and moving objects is crucial to many application domains including safety at sea, logistics robots, and autonomous vehicles. Not only is it a relevant analytical operation in itself, but also it forms the basis of other operations, such as finding the nearest approach distance between two moving objects. Most moving objects databases represent moving objects using a point representation, and the computed temporal distance is thus inaccurate when working with large moving objects. This article presents an efficient algorithm to compute the temporal distance between a moving body and other static or moving geometries. We extend the idea of the V-Clip and Lin-Canney closest features algorithms of computational geometry to track the temporal evolution of the closest pair of features between two objects during their movement. We also present a working implementation of this algorithm in an open-source moving objects database and show, using a real-world example on AIS data, that this distance operator for moving bodies is only about 1.5 times as slow as the one for moving points while providing significant improvements in correctness and accuracy of the results.
References
[1]
Jean-Luc Chabert. 1999. Newton’s Methods. Springer, Berlin, 169–197.
[2]
Bernard Marie Chazelle. 1980. Computational Geometry and Convexity. Ph. D. Dissertation. Yale University.
[3]
F. Chin and Cao An Wang. 1983. Optimal algorithms for the intersection and the minimum distance problems between planar polygons. IEEE Transactions on Computers 32 (1983), 1203–1207.
[4]
J. A. Cotelo Lema, L. Forlizzi, R. H. Güting, E. Nardelli, and M. Schneider. 2003. Algorithms for moving objects databases. Computer Journal 46 (2003), 680–712.
[5]
Mark de Berg, Otfried Cheong, Marc van Kreveld, and Mark Overmars. 2008. Computational Geometry. Springer-Verlag, Berlin.
[6]
Angel P. Del Pobil, Miguel Angel Serna, and Juan Llovet. 1992. A new representation for collision avoidance and detection. In Proceedings 1992 IEEE International Conference on Robotics and Automation. 246–247.
[7]
H. Edelsbrunner. 1985. Computing the extreme distances between two convex polygons. Journal of Algorithms 6 (1985), 213–224.
[8]
Luca Forlizzi, Ralf Hartmut Güting, Enrico Nardelli, and Markus Schneider. 2000. A data model and data structures for moving objects databases. In Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data. 319–330.
[9]
Yunjun Gao, Chun Li, Gencai Chen, Qing Li, and Chun Chen. 2007. Efficient algorithms for historical continuous k nn query processing over moving object trajectories. In Proceedings of the Advances in Data and Web Management: Joint 9th Asia-Pacific Web Conference (APWeb’07), and 8th International Conference on Web-Age Information Management (WAIM’07). 188–199.
[10]
Leonidas J. Guibas, David Hsu, and Li Zhang. 2000. A hierarchical method for real-time distance computation among moving convex bodies. Computational Geometry: Theory and Applications 15 (2000), 51–68.
[11]
Ralf Hartmut Güting, Thomas Behr, and Jianqiu Xu. 2010. Efficient k-nearest neighbor search on moving object trajectories. The VLDB Journal 19 (2010), 687–714.
[12]
Florian Heinz and Ralf Güting. 2018. A data model for moving regions of fixed shape in databases. International Journal of Geographical Information Science 32 (2018), 1737–1769.
[13]
Stefan Hertel and Kurt Mehlhorn. 1983. Fast triangulation of simple polygons. In Foundations of Computation Theory. 207–218.
[14]
Philip M. Hubbard. 1993. Interactive collision detection. In Proceedings of 1993 IEEE Research Properties in Virtual Reality Symposium. 24–31.
[15]
J. Mark Keil. 1985. Decomposing a polygon into simpler components. SIAM Journal on Computing 14 (1985), 799–19.
[16]
Ming C. Lin and John F. Canny. 1991. A fast algorithm for incremental distance calculation. In Proceedings of the 1991 IEEE International Conference on Robotics and Automation. 1008–1014.
[17]
Ming C. Lin, Dinesh Manocha, Jon Cohen, and Stefan Gottschalk. 1997. Collision detection: Algorithms and applications. In Algorithms for Robotic Motion and Manipulation. A K Peters/CRC Press, 129–142. https://www.taylorfrancis.com/books/mono/10.1201/9781439864524/algorithms-robotic-motion-manipulation-jean-paul-laumond-mark-overmars
[18]
Ming C. Lin, Dinesh Manocha, and Young J. Kim. 2017. Collision and Proximity Queries. Chapman and Hall/CRC, 1029–1056.
[19]
Brian Mirtich. 1998. V-Clip: Fast and robust polyhedral collision detection. ACM Transactions on Graphics 17 (1998), 177–208.
[20]
OGC Open Geospatial Consortium. 2016. OGC Moving Features Access. http://docs.opengeospatial.org/is/16-120r3/16-120r3.html
[21]
I. F. D. Oliveira and R. H. C. Takahashi. 2020. An enhancement of the bisection method average performance preserving minmax optimality. ACM Transactions on Mathematical Software 47 (2020), 1–24.
[22]
Jae Sung Park, Chonhyon Park, and Dinesh Manocha. 2017. Efficient probabilistic collision detection for non-convex shapes. In 2017 IEEE International Conference on Robotics and Automation (ICRA’17). 1944–1951.
[23]
Madhav Ponamgi, Dinesh Manocha, and Ming C. Lin. 1995. Incremental algorithms for collision detection between solid models. In Proceedings of the 3rd ACM Symposium on Solid Modeling and Applications. 293–304.
[24]
Sean Quinlan. 1994. Efficient distance computation between non-convex objects. In Proceedings of the 1994 IEEE International Conference on Robotics and Automation. 3324–3329.
[25]
Andrew Rawson and Edward Rogers. 2015. Assessing the impacts to vessel traffic from offshore wind farms in the Thames Estuary. Zeszyty Naukowe Akademii Morskiej w Szczecinie 43 (2015), 99–107.
[26]
Yuichi Sato, Mitsunori Hirata, Tsugito Maruyama, and Yuichi Arita. 1996. Efficient collision detection using fast distance-calculation algorithms for convex and non-convex objects. In Proceedings of IEEE International Conference on Robotics and Automation. 771–778.
[27]
Maxime Schoemans, Mahmoud Sakr, and Esteban Zimányi. 2021. Implementing rigid temporal geometries in moving object databases. In Proceedings of the 37th IEEE International Conference on Data Engineering. 12.
[28]
Yufei Tao, Dimitris Papadias, and Qiongmao Shen. 2002. Continuous nearest neighbor search. In VLDB. 287–298.
[29]
Pavel Valtr. 1995. Probability that n random points are in convex position. Discrete & Computational Geometry 13 (1995), 637–643.
[30]
Cheng-lei Yang, Meng Qi, Xiangxu Meng, Xue-qing Li, and Jia-ye Wang. 2006. New fast algorithm for computing the distance between two disjoint convex polygons based on Voronoi diagram. Journal of Zhejiang University Science 7 (2006), 1522–1529.
[31]
Esteban Zimányi, Mahmoud Sakr, and Arthur Lesuisse. 2020. MobilityDB: A mobility database based on PostgreSQL and PostGIS. ACM Transactions on Database Systems 45 (2020), 42.
Index Terms
- On Computing the Time-varying Distance between Moving Bodies
Recommendations
Evaluation of probabilistic queries in moving objects databases
MobiDE '06: Proceedings of the 5th ACM international workshop on Data engineering for wireless and mobile accessThe representation of moving objects in spatial database systems has become an important research topic in recent years. As it is not realistic to track and store the location of objects at every time instant, one of the issues in this domain has to do ...
Efficient KNN processing over moving objects with uncertain velocity
GIS '07: Proceedings of the 15th annual ACM international symposium on Advances in geographic information systemsSpatio-temporal databases aim at combining the spatial and temporal characteristics of data. The continuous K-Nearest Neighbor (CKNN) query is an important type of spatio-temporal query that finds the K-Nearest Neighbors (KNNs) of a moving query object ...
Moving GeoPQL: a pictorial language towards spatio-temporal queries
Nowadays, two of the main challenges involving spatio-temporal databases concern the integration of their spatial and temporal features to store and query spatial objects changing over time, and the development of a simple and friendly language to query ...
Comments
Information & Contributors
Information
Published In
December 2023
218 pages
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 20 November 2023
Online AM: 19 August 2023
Accepted: 30 June 2023
Revised: 30 April 2023
Received: 12 September 2022
Published in TSAS Volume 9, Issue 4
Check for updates
Author Tags
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 120Total Downloads
- Downloads (Last 12 months)70
- Downloads (Last 6 weeks)4
Reflects downloads up to 09 Nov 2024
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in