A sampling algorithm computing self-intersections of parametric surfaces

[1]  Nicholas M. Patrikalakis,et al.  Computation of Self-Intersections of Offsets of Bézier Surface Patches , 1997 .

[2]  Nicholas M. Patrikalakis,et al.  Analysis and applications of pipe surfaces , 1998, Comput. Aided Geom. Des..

[3]  Neil F. Stewart,et al.  Selfintersection of composite curves and surfaces , 1998, Computer Aided Geometric Design.

[4]  P. Volino,et al.  Collision and Self-Collision Detection :Efficient and Robust Solutions for Highly Deformable Surfaces , 1995 .

[5]  Mamoru Hosaka,et al.  Modeling of Curves and Surfaces in CAD/CAM , 1992, Computer Graphics — Systems and Applications.

[6]  Yuan-Shin Lee,et al.  Detection of loops and singularities of surface intersections , 1998, Comput. Aided Des..

[7]  Thomas W. Sederberg,et al.  Loop detection in surface patch intersections , 1988, Comput. Aided Geom. Des..

[8]  Jan B. Thomassen,et al.  Self-Intersection Problems and Approximate Implicitization , 2005 .

[9]  Michael E. Hohmeyer,et al.  A surface intersection algorithm based on loop detection , 1991, SMA '91.

[10]  Nicholas M. Patrikalakis,et al.  Topological and differential-equation methods for surface intersections , 1992, Comput. Aided Des..

[11]  Nicholas M. Patrikalakis,et al.  Surface-to-surface intersections , 1993, IEEE Computer Graphics and Applications.

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

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