Complete subdivision algorithms, I: intersection of Bezier curves

We give the first complete subdivision algorithm for the intersection of two Bezier curves F, G, possibly with tangential intersections. Our approach to robust subdivision algorithms is based on geometric separation bounds, and using a criterion for detecting non-crossing intersection of curves. Our algorithm is adaptive, being based only on exact bigfloat computations. In particular, we avoid manipulation of algebraic numbers and resultant computations. It is designed to be competitive with current algorithms on "nice" inputs. All standard algorithms assume F,G to be relatively prime—our algorithm needs a generalization of this.

[1]  S. Basu,et al.  Algorithms in real algebraic geometry , 2003 .

[2]  Kurt Mehlhorn,et al.  A Computational Basis for Conic Arcs and Boolean Operations on Conic Polygons , 2002, ESA.

[3]  Gershon Elber,et al.  Geometric modeling with splines - an introduction , 2001 .

[4]  In-Kwon Lee,et al.  Gaussian approximations of objects bounded by algebraic curves , 1990, Proceedings., IEEE International Conference on Robotics and Automation.

[5]  Chandrajit L. Bajaj,et al.  Algorithms for Planar Geometric Models , 1988, ICALP.

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

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

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

[9]  Y. Chen.  [The change of serum alpha 1-antitrypsin level in patients with spontaneous pneumothorax]. , 1995, Zhonghua jie he he hu xi za zhi = Zhonghua jiehe he huxi zazhi = Chinese journal of tuberculosis and respiratory diseases.

[10]  Chee-Keng Yap,et al.  Fundamental problems of algorithmic algebra , 1999 .

[11]  Nicholas M. Patrikalakis,et al.  Shape Interrogation for Computer Aided Design and Manufacturing , 2002, Springer Berlin Heidelberg.

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

[13]  S. Basu,et al.  Algorithms in Real Algebraic Geometry (Algorithms and Computation in Mathematics) , 2006 .

[14]  Gershon Elber,et al.  Geometric constraint solver using multivariate rational spline functions , 2001, SMA '01.

[15]  Elmar Schömer,et al.  An exact and efficient approach for computing a cell in an arrangement of quadrics , 2004, Comput. Geom..

[16]  Nicola Wolpert,et al.  Jacobi Curves : Computing the Exact Topology of Arrangements of Non-Singular Algebraic Curves , 2000 .

[17]  Rida T. Farouki.  Numerical Stability in Geometric Algorithms and Representations , 1988, IMA Conference on the Mathematics of Surfaces.

[18]  Elmar Schömer,et al.  Computing a 3-dimensional cell in an arrangement of quadrics: exactly and actually! , 2001, SCG '01.

[19]  Scott McCallum,et al.  A Polynomial-Time Algorithm for the Topological Type of a Real Algebraic Curve , 1984, J. Symb. Comput..

[20]  Raimund Seidel,et al.  On the exact computation of the topology of real algebraic curves , 2005, SCG.

[21]  Sylvain Pion,et al.  Interval arithmetic yields efficient dynamic filters for computational geometry , 1998, SCG '98.

[22]  Laureano González-Vega,et al.  An Improved Upper Complexity Bound for the Topology Computation of a Real Algebraic Plane Curve , 1996, J. Complex..

[23]  Ron Wein,et al.  High-Level Filtering for Arrangements of Conic Arcs , 2002, ESA.

[24]  Gert Vegter,et al.  Isotopic approximation of implicit curves and surfaces , 2004, SGP '04.

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