Please use this identifier to cite or link to this item: https://doi.org/10.1109/70.897801
Title: A fast growth distance algorithm for incremental motions
Authors: Ong, C.-J. 
Huang, E.
Hong, S.-M.
Keywords: Collison detection
Distance computation
Penetration distance
Issue Date: 2000
Source: Ong, C.-J., Huang, E., Hong, S.-M. (2000). A fast growth distance algorithm for incremental motions. IEEE Transactions on Robotics and Automation 16 (6) : 880-890. ScholarBank@NUS Repository. https://doi.org/10.1109/70.897801
Abstract: A fast algorithm is presented for computing the growth distance between a pair of convex objects in three-dimensional space. The growth distance is a measure of both separation and penetration between objects. When the objects are polytopes represented by their faces, the growth distance is determined by the solution of a Linear Program (LP). This article presents a new approach to the solution of the LP. Under appropriate conditions, the computational time is very small and does not depend on the total number of faces of the objects. Compared to the existing algorithm for growth distance, there is a time reduction of several orders of magnitude. This increase in speed is achieved by exploiting two resources: adjacency of the object faces and the computational coherence induced by incremental motions of the objects. Computational experiments show that the performance of the algorithm is in the same range as the fastest codes for the computation of the Euclidean separation distance. © 2000 IEEE.
Source Title: IEEE Transactions on Robotics and Automation
URI: http://scholarbank.nus.edu.sg/handle/10635/54132
ISSN: 1042296X
DOI: 10.1109/70.897801
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

3
checked on Dec 5, 2017

WEB OF SCIENCETM
Citations

2
checked on Nov 16, 2017

Page view(s)

50
checked on Dec 10, 2017

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.