Cylindrical algebraic decomposition II: an adjacency algorithm for the plane
SIAM Journal on Computing
Journal of Symbolic Computation
A polynomial-time algorithm for the topological type of a real algebraic curve
Journal of Symbolic Computation
ISSAC '89 Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation
Singular points of algebraic curves
Journal of Symbolic Computation
An improved upper complexity bound for the topology computation of a real algebraic plane curve
Journal of Complexity - Special issue for the Foundations of Computational Mathematics conference, Rio de Janeiro, Brazil, Jan. 1997
An efficient method for analyzing the topology of plane real algebraic curves
Selected papers presented at the international IMACS symposium on Symbolic computation, new trends and developments
A Gröbner free alternative for polynomial system solving
Journal of Complexity
SINGULAR — A computer algebra system for polynomial computations
Symbolic computation and automated reasoning
Improved projection for cylindrical algebraic decomposition
Journal of Symbolic Computation
Local box adjacency algorithms for cylindrical algebraic decompositions
Journal of Symbolic Computation
Efficient topology determination of implicitly defined algebraic plane curves
Computer Aided Geometric Design
A new efficient algorithm for computing Gröbner bases without reduction to zero (F5)
Proceedings of the 2002 international symposium on Symbolic and algebraic computation
Efficient isolation of polynomial's real roots
Journal of Computational and Applied Mathematics - Special issue: Proceedings of the international conference on linear algebra and arithmetic, Rabat, Morocco, 28-31 May 2001
On the exact computation of the topology of real algebraic curves
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Generalized normal forms and polynomial system solving
Proceedings of the 2005 international symposium on Symbolic and algebraic computation
Almost tight recursion tree bounds for the Descartes method
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Algorithms in Real Algebraic Geometry (Algorithms and Computation in Mathematics)
Algorithms in Real Algebraic Geometry (Algorithms and Computation in Mathematics)
On the complexity of real solving bivariate systems
Proceedings of the 2007 international symposium on Symbolic and algebraic computation
Fast and exact geometric analysis of real algebraic plane curves
Proceedings of the 2007 international symposium on Symbolic and algebraic computation
Exact and efficient 2D-arrangements of arbitrary algebraic curves
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Complete subdivision algorithms, II: isotopic meshing of singular algebraic curves
Proceedings of the twenty-first international symposium on Symbolic and algebraic computation
Topology and arrangement computation of semi-algebraic planar curves
Computer Aided Geometric Design
A descartes algorithm for polynomials with bit-stream coefficients
CASC'05 Proceedings of the 8th international conference on Computer Algebra in Scientific Computing
Visualizing Arcs of Implicit Algebraic Curves, Exactly and Fast
ISVC '09 Proceedings of the 5th International Symposium on Advances in Visual Computing: Part I
Connectivity queries on curves in Rn
ACM Communications in Computer Algebra
A worst-case bound for topology computation of algebraic curves
Journal of Symbolic Computation
Empirical study of an evaluation-based subdivision algorithm for complex root isolation
Proceedings of the 2011 International Workshop on Symbolic-Numeric Computation
Homeomorphic approximation of the intersection curve of two rational surfaces
Computer Aided Geometric Design
Journal of Computational and Applied Mathematics
On the complexity of solving a bivariate polynomial system
Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation
On the boolean complexity of real root refinement
Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation
Hi-index | 0.00 |
We revisit the problem of computing the topology and geometry of a real algebraic plane curve. The topology is of prime interest but geometric information, such as the position of singular and critical points, is also relevant. A challenge is to compute efficiently this information for the given coordinate system even if the curve is not in generic position. Previous methods based on the cylindrical algebraic decomposition (CAD) use sub-resultant sequences and computations with polynomials with algebraic coefficients. A novelty of our approach is to replace these tools by Gröbner basis computations and isolation with rational univariate representations. This has the advantage of avoiding computations with polynomials with algebraic coefficients, even in non-generic positions. Our algorithm isolates critical points in boxes and computes a decomposition of the plane by rectangular boxes. This decomposition also induces a new approach for computing an arrangement of polylines isotopic to the input curve. We also present an analysis of the complexity of our algorithm. An implementation of our algorithm demonstrates its efficiency, in particular on high-degree non-generic curves.