A Computational Basis for Conic Arcs and Boolean Operations on Conic Polygons

We give an exact geometry kernel for conic arcs, algorithms for exact computation with low-degree algebraic numbers, and an algorithm for computing the arrangement of conic arcs that immediately leads to a realization of regularized boolean operations on conic polygons. A conic polygon, or polygon for short, is anything that can be obtained from linear or conic halfspaces (= the set of points where a linear or quadratic function is non-negative) by regularized boolean operations. The algorithm and its implementation are complete (they can handle all cases), exact (they give the mathematically correct result), and efficient (they can handle inputs with several hundred primitives).

[1]  Kurt Mehlhorn,et al.  A Separation Bound for Real Algebraic Expressions , 2001, ESA.

[2]  Timothy M. Chan.  Reporting Curve Segment Interse tions Using Restri ted Predi , 2000 .

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

[4]  S. Petitjean,et al.  Towards the Robust Intersection of Implicit Quadrics , 2002 .

[5]  Dinesh Manocha,et al.  ESOLID---A System for Exact Boundary Evaluation , 2002, SMA '02.

[6]  Kurt Mehlhorn,et al.  A platform for combinatorial and geometric computing , 1995 .

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

[8]  Mark de Berg,et al.  Computational geometry: algorithms and applications , 1997 .

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

[10]  Kurt Mehlhorn,et al.  Look — a Lazy Object-Oriented Kernel for geometric computation , 2000, SCG '00.

[11]  Alejandro A. Schäffer,et al.  Convex Hulls of Piecewise-Smooth Jordan Curves , 1987, J. Algorithms.

[12]  Lutz Kettner,et al.  On the design of CGAL the computational geometry algorithms library , 1998 .

[13]  Jean-Daniel Boissonnat,et al.  Robust Plane Sweep for Intersecting Segments , 2000, SIAM J. Comput..

[14]  Alexander A. Stepanov,et al.  Generic Programming , 1988, ISSAC.

[15]  Robert Bix,et al.  Conics and Cubics: A Concrete Introduction to Algebraic Curves , 1998 .

[16]  Geert-Jan Giezeman,et al.  On the design of CGAL a computational geometry algorithms library , 2000 .

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

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

[19]  P. Zimmermann,et al.  Efficient isolation of polynomial's real roots , 2004 .

[20]  Kurt Mehlhorn,et al.  The LEDA Platform of Combinatorial and Geometric Computing , 1997, ICALP.

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

[22]  Alkiviadis G. Akritas,et al.  Polynomial real root isolation using Descarte's rule of signs , 1976, SYMSAC '76.