On the topology of real algebraic plane curves
type: Item
instance of: scholarly article
title: On the topology of real algebraic plane curves
zbMATH Open document ID: 1205.14038
author: Sylvain Lazard
author: Marc Pouget
author: Fabrice Rouillier
author: Jin-San Cheng
author: Luis Peñaranda
published in: Mathematics in Computer Science
publication date: 2011-02-19T00:00:00Z
full work available at URL: Revision MCS.pdf
Mathematics Subject Classification ID: 14H50
Mathematics Subject Classification ID: 14P05
Mathematics Subject Classification ID: 13P10
Mathematics Subject Classification ID: 14F35
zbMATH DE Number: 5853526
describes a project that uses: Kronecker
describes a project that uses: insulate
describes a project that uses: SINGULAR
describes a project that uses: CGAL
describes a project that uses: ISOLATE
describes a project that uses: FGb
MaRDI profile type: Publication
OpenAlex ID: W2027411255
cites work: Cylindrical Algebraic Decomposition I: The Basic Algorithm
cites work: Q3345690
cites work: A polynomial-time algorithm for the topological type of real algebraic curve
cites work: Topology and arrangement computation of semi-algebraic planar curves
cites work: Q4796179
cites work: Braids, Links, and Mapping Class Groups. (AM-82)
cites work: Algorithms in real algebraic geometry
cites work: Q3996250
cites work: Improved projection for cylindrical algebraic decomposition
cites work: Q3714165
cites work: Constructing roadmaps of semi-algebraic sets. I: Completeness
cites work: The computational geometry algorithms library CGAL
cites work: Using Algebraic Geometry
cites work: On the topology of planar algebraic curves
cites work: Thom's lemma, the coding of real algebraic numbers and the computation of the topology of semi-algebraic sets
cites work: Q5301661
cites work: Q3579467
cites work: Computer Algebra in Scientific Computing
cites work: Q5301664
cites work: Real Algebraic Numbers: Complexity Analysis and Experimentation
cites work: Almost tight recursion tree bounds for the Descartes method
cites work: A new efficient algorithm for computing Gröbner bases \((F_4)\)
cites work: A Gröbner free alternative for polynomial system solving
cites work: An improved upper complexity bound for the topology computation of a real algebraic plane curve
cites work: Efficient topology determination of implicitly defined algebraic plane curves.
cites work: An efficient method for analyzing the topology of plane real algebraic curves.
cites work: Q4914763
cites work: A List of Challenges for Real Algebraic Plane Curve Visualization Software
cites work: Q3325833
cites work: Recent progress in exact geometric computation
cites work: Sylvester-Habicht sequences and fast Cauchy index computation
cites work: Local box adjacency algorithms for cylindrical algebraic decompositions
cites work: Q5292191
cites work: Generalized normal forms and polynomial system solving
cites work: Solving zero-dimensional systems through the rational univariate representation
cites work: Efficient isolation of polynomial's real roots.
cites work: The topological configuration of a real algebraic curve
cites work: Singular points of algebraic curves
cites work: Cylindrical algebraic decomposition using validated numerics
cites work: On the exact computation of the topology of real algebraic curves
cites work: Q4406533
cites work: Q4953977
cites work: Q3601542
DOI: 10.1007/S11786-010-0044-3
description: scientific article; zbMATH DE number 5853526