A new approach to the surface intersection problem

Abstract Planar cut and surface intersection software is an important part of any computer aided design system. This paper presents two new ideas in the numerical solution of such problems. The first is the notion of topology resolution. In this process, the structure of the intersection curves, including the identification of closed interior loops, is determined prior to their actual numerical solution. The second idea is to compute the intersection curves as the numerical solution of a differential algebraic equation, yielding intersection curves which are (nearly) parametrized by arclength.

[1]  Eugene L. Allgower,et al.  The method of resultants for computing real solutions of polynomial systems , 1992 .

[2]  Linda R. Petzold,et al.  Numerical solution of boundary value problems in differential-algebraic systems , 1989 .

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

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

[5]  Robert E. Barnhill,et al.  Geometry Processing for Design and Manufacturing , 1992 .

[6]  Tomoyuki Nishita,et al.  Geometric hermite approximation of surface patch intersection curves , 1991, Comput. Aided Geom. Des..

[7]  Joe D. Warren,et al.  On computing the intersection of a pair of algebraic surfaces , 1989, Comput. Aided Geom. Des..

[8]  Tulga M. Ozsoy,et al.  Predictor-corrector type of intersection algorithm for C 2 parametric surfaces , 1988 .

[9]  Chandrajit L. Bajaj,et al.  Tracing surface intersections , 1988, Comput. Aided Geom. Des..

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

[11]  Les A. Piegl,et al.  Geometric method of intersecting natural quadrics represented in trimmed surface form , 1989 .

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

[13]  Chaman L. Sabharwal,et al.  Implementation of a divide-and-conquer method for intersection of parametric surfaces , 1985, Comput. Aided Geom. Des..

[14]  C. D. Boor,et al.  Collocation at Gaussian Points , 1973 .

[15]  James R. Miller,et al.  Geometric approaches to nonplanar quadric surface intersection curves , 1987, TOGS.

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

[17]  Robert P. Markot,et al.  Surface algorithms using bounds on derivatives , 1986, Comput. Aided Geom. Des..

[18]  Thomas A. Grandine.  Computing zeroes of spline functions , 1989, Comput. Aided Geom. Des..

[19]  K. Cheng.  Using plane vector fields to obtain all the intersection curves of two general surfaces , 1989 .

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

[21]  Dinesh Manocha,et al.  Algorithms for intersecting parametric and algebraic curves I: simple intersections , 1994, TOGS.

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