Bound coherence for minimum distance computations

Minimum distance computations on complex geometry commonly employ hierarchies of bounding volumes that are pruned through establishment of upper and lower bounds. In this paper we describe a novel time coherence scheme which utilizes coherence on these bounds, rather than coherence derived from the geometry of the bounding volumes or from the geometry of the underlying model. This method is thus independent of the bounding volume and model representations. In tests, we find using this approach can more than double the speed of a noncoherent approach.

[1]  Dinesh Manocha,et al.  Efficient Contact Determination in Dynamic Environments , 1997, Int. J. Comput. Geom. Appl..

[2]  Sean Quinlan,et al.  Efficient distance computation between non-convex objects , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.

[3]  Dinesh Manocha,et al.  Fast contact determination in dynamic environments , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.

[4]  Ming C. Lin,et al.  Efficient collision detection for animation and robotics , 1993 .

[5]  David Baraff,et al.  Curved surfaces and coherence for non-penetrating rigid body simulation , 1990, SIGGRAPH.

[6]  John M. Snyder,et al.  An interactive tool for placing curved surfaces without interpenetration , 1995, SIGGRAPH.

[7]  James E. Bobrow,et al.  Optimal Robot Path Planning Using the Minimum-Time Criterion , 2022 .

[8]  鍾達良,et al.  An efficient collision detection algorithm for polytopes in virtual environments , 1996 .

[9]  Dinesh Manocha,et al.  OBBTree: a hierarchical structure for rapid interference detection , 1996, SIGGRAPH.

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

[11]  Stephen Cameron,et al.  Computing distances between NURBS-defined convex objects , 1998, Proceedings. 1998 IEEE International Conference on Robotics and Automation (Cat. No.98CH36146).

[12]  Yuichi Sato,et al.  Efficient collision detection using fast distance-calculation algorithms for convex and non-convex objects , 1996, Proceedings of IEEE International Conference on Robotics and Automation.

[13]  Elaine Cohen,et al.  A framework for efficient minimum distance computations , 1998, Proceedings. 1998 IEEE International Conference on Robotics and Automation (Cat. No.98CH36146).

[14]  Dinesh Manocha,et al.  I-COLLIDE: an interactive and exact collision detection system for large-scale environments , 1995, I3D '95.

[15]  Stephen Cameron,et al.  Enhancing GJK: computing minimum and penetration distances between convex polyhedra , 1997, Proceedings of International Conference on Robotics and Automation.

[16]  Oussama Khatib,et al.  Real-Time Obstacle Avoidance for Manipulators and Mobile Robots , 1985, Autonomous Robot Vehicles.