A complete and non-overlapping tracing algorithm for closed loops

A procedure for tracing completely closed loops given implicitly by the intersection of two regular surfaces, without resorting to the parametric domain subdivisions or resulting in arc overlapping, is presented. Our primary hypothesis is that the rotation index, a global geometrical property, may be a useful complementary tool to the local differential geometrical properties for improving the efficiency of the well-known marching-based surface-surface intersection algorithms. To validate this hypothesis, we devised a novel approach for incrementally computing the rotation index of a closed plane curve given implicitly while the curve is traced. Moreover, we also proposed its integration in a marching procedure that employs adaptative circular steps.

[1]  Eric Klassen,et al.  Exploiting topological and geometric properties for selective subdivision , 1985, SCG '85.

[2]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[3]  Sueli I. Rodrigues Costa,et al.  On estimating local geometric properties of intersection curves , 2000, Proceedings 13th Brazilian Symposium on Computer Graphics and Image Processing (Cat. No.PR00878).

[4]  H. Piaggio.  Differential Geometry of Curves and Surfaces , 1952, Nature.

[5]  Xiuzi Ye,et al.  Differential geometry of intersection curves of two surfaces , 1999, Comput. Aided Geom. Des..

[6]  P. Giblin,et al.  Curves and Singularities , 1984 .

[7]  Robert E. Barnhill,et al.  A marching method for parametric surface/surface intersection , 1990, Comput. Aided Geom. Des..

[8]  Michael I. Jordan,et al.  Surface/surface intersection , 1987, Comput. Aided Geom. Des..

[9]  W. Klingenberg.  A course in differential geometry , 1978 .

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

[11]  C. Asteasu.  Intersection of arbitrary surfaces , 1988 .

[12]  Shin-Ting Wu,et al.  Marching along a regular surface/surface intersection with circular steps , 1999, Comput. Aided Geom. Des..

[13]  Tzvetan E. Stoyanov.  Marching along surfacesurface intersection curves with an adaptive step length , 1992, Comput. Aided Geom. Des..

[14]  Dinesh Manocha,et al.  An efficient surface intersection algorithm based on lower-dimensional formulation , 1997, TOGS.

[15]  D. Struik.  Lectures on classical differential geometry , 1951 .

[16]  Shin-Ting Wu,et al.  Complete and non-overlapping marching along a closed regular intersection curve , 2002, Comput. Graph..

[17]  H. Mukundan,et al.  Tracing surface intersections with validated ODE system solver , 2004, SM '04.

[18]  Gregor Müllenheim.  On determining start points for a surface/surface intersection algorithm , 1991, Comput. Aided Geom. Des..

[19]  T. Sederberg,et al.  Improved test for closed loops in surface intersections , 1989 .

[20]  M. Berger,et al.  Differential Geometry: Manifolds, Curves, and Surfaces , 1987 .