Guaranteed consistency of surface intersections and trimmed surfaces using a coupled topology resolution and domain decomposition scheme

Abstract We describe a method that serves to simultaneously determine the topological configuration of the intersection curve of two parametric surfaces and generate compatible decompositions of their parameter domains, that are amenable to the application of existing perturbation schemes ensuring exact topological consistency of the trimmed surface representations. To illustrate this method, we begin with the simpler problem of topology resolution for a planar algebraic curve F(x,y)=0 in a given domain, and then extend concepts developed in this context to address the intersection of two tensor-product parametric surfaces p(s,t) and q(u,v) defined on (s,t)∈[0,1]2 and (u,v)∈[0,1]2. The algorithms assume the ability to compute, to any specified precision, the real solutions of systems of polynomial equations in at most four variables within rectangular domains, and proofs for the correctness of the algorithms under this assumption are given.

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

[2]  Rida T. Farouki,et al.  Algorithms for polynomials in Bernstein form , 1988, Comput. Aided Geom. Des..

[3]  George E. Collins,et al.  Cylindrical Algebraic Decomposition I: The Basic Algorithm , 1984, SIAM J. Comput..

[4]  Stefan Arnborg,et al.  Algebraic decomposition of regular curves , 1986, SYMSAC '86.

[5]  George E. Collins,et al.  Cylindrical Algebraic Decomposition II: An Adjacency Algorithm for the Plane , 1984, SIAM J. Comput..

[6]  Patrizia M. Gianni,et al.  Algorithms for the Shape of Semialgebraic Sets. A New Approach , 1991, AAECC.

[7]  T. Sakkalis.  The topological configuration of a real algebraic curve , 1991, Bulletin of the Australian Mathematical Society.

[8]  Rida T. Farouki,et al.  Topologically consistent trimmed surface approximations based on triangular patches , 2004, Comput. Aided Geom. Des..

[9]  Gerald Farin,et al.  Curves and surfaces for computer aided geometric design , 1990 .

[10]  Marie-Françoise Roy,et al.  Complexity of the computation of cylindrical decomposition and topology of real algebraic curves using Thom's lemma , 1990 .

[11]  Scott McCallum,et al.  A polynomial-time algorithm for the topological type of a real algebraic curve , 1984 .

[12]  Laureano González-Vega,et al.  Efficient topology determination of implicitly defined algebraic plane curves , 2002, Comput. Aided Geom. Des..

[13]  T. Sederberg.  Implicit and parametric curves and surfaces for computer aided geometric design , 1983 .

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

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

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

[17]  Nicholas M. Patrikalakis,et al.  Computation of the solutions of nonlinear polynomial systems , 1993, Comput. Aided Geom. Des..

[18]  Rida T. Farouki,et al.  On the optimal stability of the Bernstein basis , 1996, Math. Comput..

[19]  Thomas A. Grandine,et al.  A new approach to the surface intersection problem , 1997, Comput. Aided Geom. Des..

[20]  Rida T. Farouki,et al.  Linear perturbation methods for topologically consistent representations of free-form surface intersections , 2004, Comput. Aided Geom. Des..

[21]  Dennis S. Arnon,et al.  Topologically reliable display of algebraic curves , 1983, SIGGRAPH.

[22]  H. Hong.  An efficient method for analyzing the topology of plane real algebraic curves , 1996 .