UNIFIED DISTANCE QUERIES IN A HETEROGENEOUS MODEL ENVIRONMENT

Computing the minimum distance between two models in a virtual scene is a fundamental operation useful in simulation, path planning, haptics, and modeling. In an environment with heterogeneous model representations, distance functions can be difficult to formulate and may require multiple specialized methods. In this paper, we demonstrate a generalized method for finding the distance between models with different representations and demonstrate it on a variety of models.

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

[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 distance queries with rectangular swept sphere volumes , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).

[4]  Elaine Cohen,et al.  Haptic rendering of surface-to-surface sculpted model interaction , 1999, SIGGRAPH Courses.

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

[6]  Elaine Cohen,et al.  Spatialized Normal Cone Hierarchies , 2000 .

[7]  Peter Willemsen,et al.  Six degree-of-freedom haptic rendering of complex polygonal models , 2003, 11th Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems, 2003. HAPTICS 2003. Proceedings..

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

[9]  John M. Snyder,et al.  Interval methods for multi-point collisions between time-dependent curved surfaces , 1993, 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]  D. Bara.  Curved surfaces and coherence for non-penetrating rigid body simulation , 1990 .

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

[13]  Ming C. Lin,et al.  Accurate and Fast Proximity Queries Between Polyhedra Using Convex Surface Decomposition , 2001, Comput. Graph. Forum.

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

[15]  Elaine Cohen,et al.  Spatialized normal come hierarchies , 2001, I3D '01.

[16]  Mark A. Ganter,et al.  Implicit Methods for Geometry Creation , 1998, Int. J. Comput. Geom. Appl..

[17]  Dinesh Manocha,et al.  Fast interference detection between geometric models , 1995, The Visual Computer.