This paper presents an algorithm for exact contact prediction between moving objects bounded by curved surfaces. The algorithm uses hierarchies of oriented bounding boxes (HOBBs) and local numerical methods for finding contact. Objects need not be convex and are described using the B-rep scheme. The bounding faces are represented by nonuniform rational B-splines (NURBS). The collision time is sought in short time intervals during the motion, during which time is one of the problem variables. HOBBs are based on curvature regions of the surfaces. This criterion ensures that local numerical methods will converge to the contact points if they exist. The patches enclosed in overlapping leaf nodes are tested for contact by solving a system of nonlinear equations, based on the type of collision expected. The types of collision studied are cusp–cusp, cusp–ridge, cusp–face, ridge–ridge, ridge–face, and face–face collisions. The current algorithm is implemented and compared to an efficient polyhedral collision package, and results appear promising.

References

References
1.
Rossignac
,
J. R.
, and
Requicha
,
A. A. G.
, 1999, “
Solid Modeling
,” Wiley Encyclopedia of Electrical and Electronics Engineering.
2.
Snyder
,
J. M.
, 1995, “
An Interactive Tool for Placing Curved Surfaces Without Interpenetration
,” Proceedings of the 22nd Annual Conference on Computer Graphics and Interactive Techniques, pp.
209
218
.
3.
Jiménez
,
P.
,
Thomas
,
F.
, and
Torras
,
C.
, 2001, “
3D Collision Detection: A Survey
,”
Comput. Graphics
,
25
(
2
), pp.
269
285
.
4.
Schomer
,
E.
,
Reichel
,
J.
, and
Warken
,
T.
, 2002, “
Efficient Collision Detection for Curved Solid Objects
,” Proceedings 7th ACM Symposium on Solid Modeling and Applications, SM’02, June 17–21, pp.
321
328
.
5.
Lennerz
,
C.
, and
Schomer
,
E.
, 2002, “
Efficient Distance Computation for Quadratic Curves and Surfaces
,” Proceedings of Geometric Modeling and Processing. Theory and Applications, GMP 2002, pp.
1
10
.
6.
Choi
,
Y.-K.
,
Wang
,
W.
, and
Kim
,
M.-S.
, 2003, “
Exact Collision Detection of Two Moving Ellipsoids Under Rational Motions
,” 2003 IEEE International Conference on Robotics and Automation, September 14–19, vol. 1, pp.
349
354
.
7.
Baraff
,
D.
, 1990, “
Curved Surfaces and Coherence for Nonpenetrating Rigid Body Simulation
,”
Comput. Graphics
,
24
(
4
), pp.
19
28
.
8.
Duff
,
T.
, 1992, “
Interval Arithmetic and Recursive Subdivision for Implicit Functions and Constructive Solid Geometry
,” Proceedings of the 19th Annual Conference on Computer Graphics and Interactive Techniques, pp.
131
138
.
9.
Sclaroff
,
S.
and
Pentland
,
A.
, 1991, “
Generalized Implicit Functions for Computer Graphics
,”
Comput. Graphics
,
25
(
4
), pp.
247
250
.
10.
Pentland
,
A.
, and
Williams
,
J.
, 1989, “
Good Vibrations: Model Dynamics for Graphics and Animation
,” Proceedings of the 16th Annual Conference on Computer Graphics and Interactive Techniques, pp.
215
222
.
11.
Snyder
,
J. M.
,
Woodbury
,
A. R.
,
Fleischer
,
K.
,
Currin
,
B.
, and
Barr
,
A. H.
, 1993, “
Interval Methods for Multi-point Collisions Between Time-dependent Curved Surfaces
,” Proceedings of the 20th Annual Conference on Computer Graphics and Interactive Techniques, pp.
321
334
.
12.
Von Herzen
,
B.
,
Barr
,
A. H.
, and
Zatz
,
H. R.
, 1990, “
Geometric Collisions for Time-Dependent Parametric Surfaces
,”
Comput. Graphics
,
27
(
4
), pp.
39
48
.
13.
Krishnan
,
S.
,
Gopi
,
M.
,
Lin
,
M.
,
Manocha
,
D.
, and
Pattekar
,
A.
, 1998, “
rapid and Accurate Contact Determination Between Spline Models Using Shelltrees
,” Eurographics Proceeding, 98 vol. 17, no. 3.
14.
Krishnan
,
S.
,
Pattekar
,
A.
,
Lin
,
M.
, and
Manocha
,
D.
, 1998, “
Spherical shell: A higher order bounding volume for fast proximity queries
,” Proceedings of the 1998 Workshop on the Algorithmic Foundations of Robotics, pp.
287
296
.
15.
Lin
,
C. M.
, and
Manocha
,
D.
, 1997, “
Efficient Contact Determination in Dynamic Environment
,”
Int. J. Comput. Geom. Appl.
,
7
(
1–2
), pp.
123
151
.
16.
Lin
,
C. M.
, and
Canny
,
J. F.
, 1991, “
A Fast Algorithm for Incremental Distance Calculation
,” Proceedings of the 1991 IEEE International Conference on Robotics and Automation, vol.
2
, pp.
1008
1014
.
17.
Colin
,
T.
, and
Stephen
,
C.
, 1998, “
Computing Distances Between Nurbs-Defined Convex Objects
,” Proceedings IEEE International Conference on Robotics and Automation, vol.
4
, pp.
3685
3690
.
18.
Gilbert
,
E. G.
,
Johnson
,
D. W.
, and
Keerthi
,
S. S.
, 1988, “
A Fast Procedure for Computing the Distance Between Complex Objects in Three-dimensional Space
,”
IEEE J. Rob. Autom.
,
4
(
2
), pp.
193
203
.
19.
Gilbert
,
E. G.
, and
Foo
,
C.-P.
, 1990, “
Computing the Distance Between General Convex Objects in Three-dimensional Space
,”
IEEE Trans. Rob. Autom.
,
6
(
1
), pp.
53
61
.
20.
Rozas Merino
,
O.
, 1998, “Collision Detection in Mechanical Analysis With a Solid Model Based on a Boundary Representation of Nurbs Surfaces,” Ph.D. Dissertation, Universidad de Navarra, Spain, pp.
1
389
.
21.
Johnson
,
D.E.
, and
Cohen
,
E.
, 1998, “
A Framework for Efficient Minimum Distance Computations
,” Proceedings of 1998 IEEE International Conference on Robotics and Automation, vol.
4
, pp.
78
84
.
22.
Page
,
F.
, and
Guibault
,
F.
, 2003, “
Collision Detection Algorithm for Nurbs Surfaces in Interactive Applications
,” CCECE 2003 Canadian Conference on Electrical and Computer Engineering: Toward a Caring and Humane Technology, May 4–7, vol.
2
, pp.
1417
1420
.
23.
Uicker
,
J. J.
,
Ravani
,
B.
, and
Sheth
,
P. N.
,
“Matrix Methods in the Design Analysis of MultiBody Systems,”
Cambridge University Press
, Cambridge,
England
(in press).
24.
Deuflhard
,
P.
, 2004, “
Newton Methods for Nonlinear Problems: Affine Invariance and Adaptive Algorithms
,” Springer Series in Computational Mathematics, vol.
35
.
25.
Klein
,
J.
, and
Zachmann
,
G.
, 2005, “
The Expected Running Time of Hierarchical Collision Detection
,” SIGGRAPH ’05: ACM SIGGRAPH 2005 Posters, p.
117
.
You do not currently have access to this content.