A polynomial-time algorithm for the topological type of real algebraic curve

From MaRDI portal
Publication:1115496

DOI10.1016/S0747-7171(88)80013-0zbMath0664.14017OpenAlexW1991344970MaRDI QIDQ1115496

Scott McCallum, Dennis S. Arnon

Publication date: 1988

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0747-7171(88)80013-0



Related Items

Algorithms to compute the topology of orientable real algebraic surfaces, Tracing surface intersections, The topological configuration of a real algebraic curve, 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, On the isotopic meshing of an algebraic implicit surface, On the topology of real algebraic plane curves, Topology of 2D and 3D rational curves, A subdivision method for computing nearest gcd with certification, Certified rational parametric approximation of real algebraic space curves with local generic position method, 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, A delineability-based method for computing critical sets of algebraic surfaces, Computation of the topology of real algebraic space curves, Evaluating the boundary and covering degree of planar Minkowski sums and other geometrical convolutions, On the complexity of computing with planar algebraic curves, Global minimization of rational functions and the nearest GCDs, Topology of real algebraic space curves, Computation of the topological type of a real Riemann surface, Two-view ``cylindrical decomposition of binary images, Guaranteed consistency of surface intersections and trimmed surfaces using a coupled topology resolution and domain decomposition scheme, On the asymptotic and practical complexity of solving bivariate systems over the reals, An efficient method for analyzing the topology of plane real algebraic curves., A worst-case bound for topology computation of algebraic curves, An exact and efficient approach for computing a cell in an arrangement of quadrics, Efficient topology determination of implicitly defined algebraic plane curves., Boundary evaluation algorithms for Minkowski combinations of complex sets using topological analysis of implicit curves



Cites Work