By Topic

Determining the minimum translational distance between two convex polyhedra

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Cameron, S. ; McDonnell Douglas Research Laboratories, St. Louis, MO, USA ; Culley, R.

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.

Published in:

Robotics and Automation. Proceedings. 1986 IEEE International Conference on  (Volume:3 )

Date of Conference:

Apr 1986