论文信息 - Computing the distance between general convex objects in three-dimensional space

Computing the distance between general convex objects in three-dimensional space

A methodology for computing the distance between objects in three-dimensional space is presented. The convex polytope is replaced by a general convex set, avoiding the errors caused by the usual polytope approximations and actually reducing the overall computational time. The basic algorithm is a simple extension of the polytope distance algorithm described by E.G. Gilbert et al. (1988). It utilizes the support mappings of the sets representing the objects. A calculus for evaluating these mappings that allows the extended algorithm to be applied to a rich family of nonpolytopal objects is presented. While the convergence of the algorithm is not finite, it is fast and an effective stopping condition that guarantees the accuracy of the numerical solution is available. Extensive numerical experiments support the claimed efficiency. >

Elmer G. Gilbert | Chek-Peng Foo | E. Gilbert | C. Foo

[1] R. Barr. An Efficient Computational Procedure for a Generalized Quadratic Programming Problem , 1969 .

[2] K. Narendra,et al. A New Iterative Procedure for the Minimization of a Quadratic Form on a Convex Set , 1970 .

[3] David G. Kirkpatrick,et al. A Linear Algorithm for Determining the Separation of Convex Polyhedra , 1985, J. Algorithms.

[4] James E. Bobrow,et al. A Direct Minimization Approach for Obtaining the Distance between Convex Polyhedra , 1989, Int. J. Robotics Res..

[5] E. Gilbert. An Iterative Procedure for Computing the Minimum of a Quadratic Form on a Convex Set , 1966 .

[6] S. Sathiya Keerthi,et al. A fast procedure for computing the distance between complex objects in three-dimensional space , 1988, IEEE J. Robotics Autom..