2011/03/24 by Eric Berberich, Berberich, Eric, Pavel Emeliyanenko +5 · 1 citation
Computer Science · Mathematics · #14P10 (Secondary) #14Q05 (Primary) #14h50 #Algebraic Geometry (math.AG) #Computational Geometry (cs.CG) #D.2.13 #FOS: Computer and information sciences #FOS: Mathematics #G.4 #Geometric Topology (math.GT) #I.1.2 #Mathematical Software (cs.MS) #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.1103.4697
19 pages, 3 figures, 5 tables, submitted to SNC 2011, data sets available for download: http://www.mpi-inf.mpg.de/departments/d1/projects/Geometry/DataSetsSNC-2011.zip
arxiv created 2011/03/24 · arxiv updated 2011/03/25
We present a new certified and complete algorithm to compute arrangements of real planar algebraic curves. Our algorithm 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 of the plane. Compared to previous approaches, we improve in two main aspects: Firstly, we significantly reduce the amount of exact operations, that is, our algorithms only uses resultant and gcd as purely symbolic operations. Secondly, we introduce a new hybrid method in the lifting step of our algorithm which combines the usage of a certified numerical complex root solver and information derived from the resultant computation. Additionally, we never consider any coordinate transformation and the output is also given with respect to the initial coordinate system. We implemented our algorithm as a prototypical package of the C++-library CGAL. Our implementation exploits graphics hardware to expedite the resultant and gcd computation. We also compared our implementation with the current reference implementation, that is, CGAL's curve analysis and arrangement for algebraic curves. For various series of challenging instances, our experiments show that the new implementation outperforms the existing one.