A worst-case bound for topology computation of algebraic curves
DOI10.1016/J.JSC.2011.11.001zbMATH Open1244.14048OpenAlexW2059173068MaRDI QIDQ765857FDOQ765857
Authors: Michael Kerber, Michael Sagraloff 
Publication date: 22 March 2012
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jsc.2011.11.001
Recommendations
- An efficient method for analyzing the topology of plane real algebraic curves.
- Bounds for polynomials on algebraic numbers and application to curve topology
- Algorithm for Connectivity Queries on Real Algebraic Curves
- scientific article; zbMATH DE number 16645
- An improved upper complexity bound for the topology computation of a real algebraic plane curve
- On the complexity of computing with planar algebraic curves
- On the exact computation of the topology of real algebraic curves
- Publication:5749405
- \texttt{PTOPO}: computing the geometry and the topology of parametric curves
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Topology of real algebraic varieties (14P25) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Computational aspects of algebraic curves (14Q05) Effectivity, complexity and computational aspects of algebraic geometry (14Q20)
Cites Work
- On the exact computation of the topology of real algebraic curves
- Quantifier elimination and cylindrical algebraic decomposition. Proceedings of a symposium, Linz, Austria, October 6--8, 1993
- Algorithms in real algebraic geometry
- On the asymptotic and practical complexity of solving bivariate systems over the reals
- An improved upper complexity bound for the topology computation of a real algebraic plane curve
- Title not available (Why is that?)
- On nearest-neighbor graphs
- Title not available (Why is that?)
- Modern computer algebra
- An efficient algorithm for the stratification and triangulation of an algebraic surface
- An efficient method for analyzing the topology of plane real algebraic curves.
- Efficient topology determination of implicitly defined algebraic plane curves.
- Arrangement computation for planar algebraic curves
- Efficient real root approximation
- Fast and exact geometric analysis of real algebraic plane curves
- A generic algebraic kernel for non-linear geometric applications
- A polynomial-time algorithm for the topological type of real algebraic curve
- Title not available (Why is that?)
- Complete subdivision algorithms, II
- Title not available (Why is that?)
- On the topology of planar algebraic curves
Cited In (21)
- On the complexity of computing the topology of real algebraic space curves
- Computing the topology of a bounded non algebraic curve in the plane
- On the computation of the topology of plane curves
- A polynomial-time algorithm for the topological type of real algebraic curve
- Detecting similarity of rational plane curves
- On the Topology of the Intersection Curve of Two Real Parameterized Algebraic Surfaces
- On the Davenport-Mahler bound
- Separating linear forms and rational univariate representations of bivariate systems
- Root refinement for real polynomials using quadratic interval refinement
- On the complexity of computing with planar algebraic curves
- A generic position based method for real root isolation of zero-dimensional polynomial systems
- Algorithm for Connectivity Queries on Real Algebraic Curves
- On the complexity of the Descartes method when using approximate arithmetic
- On Isolating Roots in a Multiple Field Extension
- Nearly optimal refinement of real roots of a univariate polynomial
- A polynomial-time algorithm for the topological type of real algebraic curve - extended abstract
- Bounds for polynomials on algebraic numbers and application to curve topology
- Certified rational parametric approximation of real algebraic space curves with local generic position method
- From approximate factorization to root isolation with application to cylindrical algebraic decomposition
- Improving the topology computation of an arrangement of cubics
- Improved bounds for the CF algorithm
Uses Software
This page was built for publication: A worst-case bound for topology computation of algebraic curves
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q765857)
