An improved upper complexity bound for the topology computation of a real algebraic plane curve
From MaRDI portal
Publication:2365422
DOI10.1006/jcom.1996.0032zbMath0862.68062OpenAlexW2075500668MaRDI QIDQ2365422
Laureano Gonzalez-Vega, M'hammed El Kahoui
Publication date: 23 March 1997
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jcom.1996.0032
Related Items (31)
A softly optimal Monte Carlo algorithm for solving bivariate polynomial systems over the integers ⋮ Solving bivariate systems using rational univariate representations ⋮ On the complexity of computing the topology of real algebraic space curves ⋮ On the topology and isotopic meshing of plane algebraic curves ⋮ Computing the topology of the image of a parametric planar curve under a birational transformation ⋮ Algorithm for Connectivity Queries on Real Algebraic Curves ⋮ p-adic algorithm for bivariate Gröbner bases ⋮ On the topology of real algebraic plane curves ⋮ On the different shapes arising in a family of plane rational curves depending on a parameter ⋮ Topology of 2D and 3D rational curves ⋮ On the Topology of the Intersection Curve of Two Real Parameterized Algebraic Surfaces ⋮ Computing the topology of a real algebraic plane curve whose defining equations are available only ``by values ⋮ Isotopic meshing of a real algebraic space curve ⋮ Separating linear forms and rational univariate representations of bivariate systems ⋮ A delineability-based method for computing critical sets of algebraic surfaces ⋮ Computation of the topology of real algebraic space curves ⋮ Determination of the tangents for a real plane algebraic curve ⋮ Bivariate triangular decompositions in the presence of asymptotes ⋮ From approximate factorization to root isolation with application to cylindrical algebraic decomposition ⋮ On the complexity of computing with planar algebraic curves ⋮ Topology of real algebraic space curves ⋮ Detecting algebraic curves in bad position ⋮ Certified numerical algorithm for isolating the singularities of the plane projection of generic smooth space curves ⋮ On the asymptotic and practical complexity of solving bivariate systems over the reals ⋮ Lexicographic Gröbner bases of bivariate polynomials modulo a univariate one ⋮ A worst-case bound for topology computation of algebraic curves ⋮ An efficient algorithm for the stratification and triangulation of an algebraic surface ⋮ Computing the topology of an arrangement of implicitly defined real algebraic plane curves ⋮ Efficient topology determination of implicitly defined algebraic plane curves. ⋮ Computation of the dual of a plane projective curve ⋮ Bounds for polynomials on algebraic numbers and application to curve topology
This page was built for publication: An improved upper complexity bound for the topology computation of a real algebraic plane curve
