Method for intersecting algebraic surfaces with rational polynomial patches

Abstract The paper presents a hybrid algorithm for the computation of the intersection of an algebraic surface and a rational polynomial parametric surface patch. This algorithm is based on analytic representation of the intersection as an algebraic curve expressed in the Bernstein basis; automatic computation of the significant points of the curve using numerical techniques, subdivision and convexity properties of the Bernstein basis; partitioning of the intersection domain at these points; and tracing of the resulting monotonic intersection segments using coarse subdivision and faceting methods coupled with Newton techniques. The algorithm described in the paper treats intersections of arbitrary order algebraic surfaces with rational biquadratic and bicubic patches and introduces efficiency enhancements in the partitioning and tracing parts of the solution process. The algorithm has been tested with up to degree four algebraics and bicubic patches.

[1]  Joshua Z. Levin.  Mathematical models for determining the intersections of quadric surfaces , 1979 .

[2]  Tor Dokken.  Finding intersections of B-spline represented geometries using recursive subdivision techniques , 1985, Comput. Aided Geom. Des..

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

[4]  R. L. Magedson,et al.  Solutions of tangential surface and curve intersections , 1989 .

[5]  Carl S. Petersen.  Adaptive contouring of three-dimensional surfaces , 1984, Comput. Aided Geom. Des..

[6]  Ramon F. Sarraga,et al.  Algebraic methods for intersections of quadric surfaces in GMSOLID , 1983, Comput. Vis. Graph. Image Process..

[7]  Rida T. Farouki,et al.  Algebraic properties of plane offset curves , 1990, Comput. Aided Geom. Des..

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

[9]  Q. Peng,et al.  An algorithm for finding the intersection lines between two B-spline surfaces , 1984 .

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

[11]  George Anthony Kriezis.  Algorithms for rational spline surface intersections , 1990 .

[12]  Wayne Tiller,et al.  Applications of power series in computational geometry , 1986 .

[13]  Åke Björck,et al.  Numerical Methods , 1995, Handbook of Marine Craft Hydrodynamics and Motion Control.

[14]  Nicholas M. Patrikalakis,et al.  Surface Intersections for Geometric Modeling , 1990 .

[15]  Dieter Lasser,et al.  Intersection of parametric surfaces in the Bernstein—Be´zier representation , 1986 .

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

[17]  Nicholas M. Patrikalakis,et al.  Computation of algebraic and polynomial parametric surface intersections , 1987 .

[18]  A. Requicha,et al.  Piecewise-circular curves for geometric modeling , 1987 .

[19]  Rida T. Farouki,et al.  On the numerical condition of polynomials in Bernstein form , 1987, Comput. Aided Geom. Des..

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

[21]  R. Riesenfeld,et al.  Bounds on a polynomial , 1981 .

[22]  Rida T. Farouki,et al.  The characterization of parametric surface sections , 1986, Comput. Vis. Graph. Image Process..

[23]  Richard F. Riesenfeld,et al.  A Theoretical Development for the Computer Generation and Display of Piecewise Polynomial Surfaces , 1980, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[24]  Thomas W. Sederberg.  Planar piecewise algebraic curves , 1984, Comput. Aided Geom. Des..