Sridharan, K and Stephanou, HE and Craig, KC and Keerthi, SS (1994) Distance measures on intersecting objects and their applications. In: Information processing letters, 51 (4). 181 -188 .
distance.pdf - Published Version
Restricted to Registered users only
Download (748Kb) | Request a copy
Let A and B be two objects. We define measures to characterize the penetration of A and B when A boolean AND B not equal 0. We then present properties of the measures and efficient algorithms to compute them for planar and polyhedral objects. We explore applications of the measures and present some experimental results.
|Item Type:||Journal Article|
|Additional Information:||Copyright of this article belongs to Elsevier Science.|
|Keywords:||Algorithms;Computational geometry;Depth of collision;Robotics|
|Department/Centre:||Division of Electrical Sciences > Computer Science & Automation (Formerly, School of Automation)|
|Date Deposited:||02 Jun 2011 04:37|
|Last Modified:||02 Jun 2011 04:37|
Actions (login required)