Determining the minimum translational distance between two convex polyhedra
- 1 January 1986
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 3, 591-596
- https://doi.org/10.1109/robot.1986.1087645
Abstract
Given two objects we define the minimal translational distance (MTD) between them to be the length of the shortest relative translation that results in the objects being in contact. MTD is equivalent to the distance between two objects if the objects are not intersecting; however MTD is also defined for intersecting objects and it then gives a measure of penetration. We show that the computation of MTD can be recast as a configuration space problem, and describe an algorithm for computing MTD for convex polyhedra. This research was conducted under the McDonnell Douglas Independent Research and Development Program.Keywords
This publication has 10 references indexed in Scilit:
- A collision detection algorithm based on velocity and distance boundsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1986
- A linear algorithm for determining the separation of convex polyhedraJournal of Algorithms, 1985
- A null-object detection algorithm for constructive solid geometryCommunications of the ACM, 1984
- Spatial Planning: A Configuration Space ApproachIEEE Transactions on Computers, 1983
- Finding the minimum distance between two convex polygonsInformation Processing Letters, 1981
- An algorithm for planning collision-free paths among polyhedral obstaclesCommunications of the ACM, 1979
- Interference detection among solids and surfacesCommunications of the ACM, 1979
- Finding the intersection of two convex polyhedraTheoretical Computer Science, 1978
- A procedure to determine intersections between polyhedral objectsInternational Journal of Parallel Programming, 1972
- A Procedure for Detecting Intersections of Three-Dimensional ObjectsJournal of the ACM, 1968