Dual b-rep-CSG collision detection for general polyhedra

While almost all collision detection algorithms have been linked to a particular object representation scheme, few attempts have been made using hybrid methods to exploit the advantages of multiple representations of objects. In this paper we present a collision detection algorithm based on a dual b-rep/CSG representation of concave polyhedra initially represented in b-rep. Our method naturally combines the use of bounding volumes, hierarchical subdivision, and space partitioning to perform the interference test.

[1]  Philip M. Hubbard,et al.  Collision Detection for Interactive Graphics Applications , 1995, IEEE Trans. Vis. Comput. Graph..

[2]  Carme Torras,et al.  3D collision detection: a survey , 2001, Comput. Graph..

[3]  Jarek Rossignac,et al.  Active zones in CSG for accelerating boundary evaluation, redundancy elimination, interference detection, and shading algorithms , 1988, TOGS.

[4]  F. H. Lin.  AN ADAPTIVE BOUNDING OBJECT BASED ALGORITHM FOR EFFICIENT AND PRECISE COLLISION DETECTION OF CSG-REPRESENTED VIRTUAL OBJECTS , 1996 .

[5]  Tom Duff,et al.  Interval arithmetic recursive subdivision for implicit functions and constructive solid geometry , 1992, SIGGRAPH.

[6]  Vadim Shapiro,et al.  Construction and optimization of CSG representations , 1991, Comput. Aided Des..

[7]  Bernard Chazelle,et al.  Convex Partitions of Polyhedra: A Lower Bound and Worst-Case Optimal Algorithm , 1984, SIAM J. Comput..

[8]  Joseph S. B. Mitchell,et al.  Efficient Collision Detection Using Bounding Volume Hierarchies of k-DOPs , 1998, IEEE Trans. Vis. Comput. Graph..

[9]  V. Shapiro.  Representations of semi-algebraic sets in finite algebras generated by space decompositions , 1991 .

[10]  P. A. Cundall,et al.  FORMULATION OF A THREE-DIMENSIONAL DISTINCT ELEMENT MODEL - PART I. A SCHEME TO DETECT AND REPRESENT CONTACTS IN A SYSTEM COMPOSED OF MANY POLYHEDRAL BLOCKS , 1988 .

[11]  Alejandro M. García-Alonso,et al.  Solving the collision detection problem , 1994, IEEE Computer Graphics and Applications.

[12]  Stephen Cameron,et al.  Approximation hierarchies and S-bounds , 1991, SMA '91.

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

[14]  Dinesh Manocha,et al.  Incremental Algorithms for Collision Detection Between Polygonal Models , 1997, IEEE Trans. Vis. Comput. Graph..

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

[16]  G. Alefeld,et al.  Introduction to Interval Computation , 1983 .

[17]  Brian Mirtich,et al.  V-Clip: fast and robust polyhedral collision detection , 1998, TOGS.

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

[19]  Ramon E. Moore.  Methods and applications of interval analysis , 1979, SIAM studies in applied mathematics.

[20]  Gino van den Bergen.  Efficient Collision Detection of Complex Deformable Models using AABB Trees , 1997, J. Graphics, GPU, & Game Tools.

[22]  Mark H. Overmars,et al.  Point Location in Fat Subdivisions , 1992, Inf. Process. Lett..

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

[24]  Yutaka Hori,et al.  Octree-based approach to real-time collision-free path planning for robot manipulator , 1996, Proceedings of 4th IEEE International Workshop on Advanced Motion Control - AMC '96 - MIE.

[25]  Christoph M. Hoffmann,et al.  Geometric and Solid Modeling: An Introduction , 1989 .

[26]  Leonidas J. Guibas,et al.  BOXTREE: A Hierarchical Representation for Surfaces in 3D , 1996, Comput. Graph. Forum.

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

[28]  Ming C. Lin,et al.  Collision Detection between Geometric Models: A Survey , 1998 .