Complete, exact, and efficient computations with cubic curves

The Bentley-Ottmann sweep-line method can be used to compute thearrangement of planar curves provided a number of geometricprimitives operating on the curves are available. We discuss themathematics of the primitives for planar algebraic curves of degreethree or less and derive efficient realizations. As a result, weobtain a complete, exact, and efficient algorithm for computingarrangements of cubic curves. Conics and cubic splines are specialcases of cubic curves. The algorithm is complete in that it handles all possibledegeneracies including singularities. It is exact in that itprovides the mathematically correct result. It is efficient in thatit can handle hundreds of curves with a quarter million of segmentsin the final arrangement.

[1]  G. Fischer,et al.  Plane Algebraic Curves , 1921, Nature.

[2]  H. Hilton.  Plane algebraic curves , 1921 .

[3]  George E. Collins,et al.  Quantifier elimination for real closed fields by cylindrical algebraic decomposition , 1975 .

[4]  George E. Collins,et al.  Hauptvortrag: Quantifier elimination for real closed fields by cylindrical algebraic decomposition , 1975, Automata Theory and Formal Languages.

[5]  Thomas Ottmann,et al.  Algorithms for Reporting and Counting Geometric Intersections , 1979, IEEE Transactions on Computers.

[6]  G. E. Collins,et al.  Real Zeros of Polynomials , 1983 .

[7]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[8]  John Canny,et al.  The complexity of robot motion planning , 1988 .

[9]  Chandrajit L. Bajaj,et al.  Computations with Algebraic Curves , 1988, ISSAC.

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

[11]  Paul Pedersen.  Multivariate Sturm Theory , 1991, AAECC.

[12]  Keith O. Geddes,et al.  Algorithms for computer algebra , 1992 .

[13]  Kurt Mehlhorn,et al.  LEDA: a platform for combinatorial and geometric computing , 1997, CACM.

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

[15]  Gert Vegter,et al.  In handbook of discrete and computational geometry , 1997 .

[16]  David A. Cox,et al.  Ideals, Varieties, and Algorithms , 1997 .

[17]  Joachim von zur Gathen,et al.  Modern Computer Algebra , 1998 .

[18]  Iddo Hanniel,et al.  The Design and Implementation of Planar Maps in CGAL , 1999, WAE.

[19]  Dinesh Manocha,et al.  MAPC: a library for efficient and exact manipulation of algebraic points and curves , 1999, SCG '99.

[20]  Olivier Devillers,et al.  Algebraic methods and arithmetic filtering for exact predicates on circle arcs , 2000, SCG '00.

[21]  Micha Sharir,et al.  Arrangements and Their Applications , 2000, Handbook of Computational Geometry.

[22]  Iddo Hanniel,et al.  The design and implementation of panar maps in CGAL , 2000, JEAL.

[23]  Kurt Mehlhorn,et al.  A Strong and Easily Computable Separation Bound for Arithmetic Expressions Involving Radicals , 2000, Algorithmica.

[24]  Michael Seel.  Implementation of planar Nef polyhedra , 2001 .

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

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

[27]  R. Gregory Taylor,et al.  Modern computer algebra , 2002, SIGA.

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

[29]  Arno Eigenwillig.  Exact Arrangement Computation for Cubic Curves , 2003 .

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

[31]  Sylvain Pion,et al.  Towards and open curved kernel , 2004, SCG '04.

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