A framework for efficient minimum distance computations

We present a framework for minimum distance computations that allows efficient solution of minimum distance queries on a variety of surface representations, including sculptured surfaces. The framework depends on geometric reasoning rather than numerical methods and can be implemented straightforwardly. We demonstrate performance that compares favorably to other polygonal methods and is faster than reported results for other methods on sculptured surfaces.

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

[2]  Philip M. Hubbard,et al.  Interactive collision detection , 1993, Proceedings of 1993 IEEE Research Properties in Virtual Reality Symposium.

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

[4]  James E. Bobrow,et al.  Optimal robot plant planning using the minimum-time criterion , 1988, IEEE J. Robotics Autom..

[5]  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.

[6]  R. B. Kelley,et al.  Spherical-object representation and fast distance computation for robotic applications , 1991, Proceedings. 1991 IEEE International Conference on Robotics and Automation.

[7]  Tor Dokken.  Finding intersections of B-spline represented geometries using recursive subdivision techniques , 1985, Comput. Aided Geom. Des..

[8]  Dinesh Manocha,et al.  Incremental algorithms for collision detection between solid models , 1995, Symposium on Solid Modeling and Applications.

[9]  John M. Snyder,et al.  Interval analysis for computer graphics , 1992, SIGGRAPH.

[10]  Alan H. Barr,et al.  Geometric collisions for time-dependent parametric surfaces , 1990, SIGGRAPH.

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

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

[13]  Herbert Edelsbrunner,et al.  Computing the Extreme Distances Between Two Convex Polygons , 1985, J. Algorithms.

[14]  Les A. Piegl,et al.  The NURBS Book , 1995, Monographs in Visual Communication.

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

[16]  Elaine COHEN,et al.  Rates of convergence of control polygons , 1985, Comput. Aided Geom. Des..

[17]  John M. Snyder,et al.  Interval methods for multi-point collisions between time-dependent curved surfaces , 1993, SIGGRAPH.

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

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

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

[21]  Anis Limaiem,et al.  Geometric algorithms for the intersection of curves and surfaces , 1995, Comput. Graph..

[22]  David G. Kirkpatrick,et al.  Determining the Separation of Preprocessed Polyhedra - A Unified Approach , 1990, ICALP.

[23]  Francis Y. L. Chin,et al.  Optimal Algorithms for the Intersection and the Minimum Distance Problems Between Planar Polygons , 1983, IEEE Transactions on Computers.

[24]  Brian Mirtich,et al.  Impulse-based dynamic simulation of rigid body systems , 1996 .

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

[26]  Elaine Cohen,et al.  Direct haptic rendering of sculptured models , 1997, SI3D.

[27]  Oussama Khatib,et al.  Real-Time Obstacle Avoidance for Manipulators and Mobile Robots , 1986 .

[28]  Sean Quinlan.  Real-time modification of collision-free paths , 1994 .

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

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