2012/01/07 by Eric Berberich, Berberich, Eric, Pavel Emeliyanenko +5 · 1 citation
Computer Science · Engineering · Mathematics · #14P10 (Secondary) #14Q05 (Primary) #14h50 #Advanced Numerical Analysis Techniques #Algebraic Geometry (math.AG) #Computational Geometry (cs.CG) #Computational Geometry and Mesh Generation #D.2.13 #FOS: Computer and information sciences #FOS: Mathematics #G.4 #Geometric Topology (math.GT) #I.1.2 #Mathematical Software (cs.MS) #Polynomial and algebraic computation #Symbolic Computation (cs.SC) #acm:14P10 #acm:14Q05 #acm:14h50 #cs.CG #cs.MS #cs.SC #math.AG #math.GT #msc:14P10 #msc:14Q05 #msc:14h50
paper · pdf · doi:10.48550/arxiv.1201.1548
46 pages, 4 figures, submitted to Special Issue of TCS on SNC 2011. arXiv admin note: substantial text overlap with arXiv:1010.1386 and arXiv:1103.4697
arxiv created 2012/01/07 · openalex publication_date 2012/01/07 · arxiv updated 2012/01/13 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/01
We present a novel certified and complete algorithm to compute arrangements of real planar algebraic curves. It provides a geometric-topological analysis of the decomposition of the plane induced by a finite number of algebraic curves in terms of a cylindrical algebraic decomposition. From a high-level perspective, the overall method splits into two main subroutines, namely an algorithm denoted Bisolve to isolate the real solutions of a zero-dimensional bivariate system, and an algorithm denoted GeoTop to analyze a single algebraic curve. Compared to existing approaches based on elimination techniques, we considerably improve the corresponding lifting steps in both subroutines. As a result, generic position of the input system is never assumed, and thus our algorithm never demands for any change of coordinates. In addition, we significantly limit the types of involved exact operations, that is, we only use resultant and gcd computations as purely symbolic operations. The latter results are achieved by combining techniques from different fields such as (modular) symbolic computation, numerical analysis and algebraic geometry. We have implemented our algorithms as prototypical contributions to the C++-project CGAL. They exploit graphics hardware to expedite the symbolic computations. We have also compared our implementation with the current reference implementations, that is, LGP and Maple's Isolate for polynomial system solving, and CGAL's bivariate algebraic kernel for analyses and arrangement computations of algebraic curves. For various series of challenging instances, our exhaustive experiments show that the new implementations outperform the existing ones.