Topology and arrangement computation of semi-algebraic planar curves

DOI10.1016/j.cagd.2008.06.009zbMath1172.14343OpenAlexW2047906192MaRDI QIDQ735517

Julien Wintz, Lionel F. Alberti, Mourrain, Bernard

Publication date: 22 October 2009

Published in: Computer Aided Geometric Design (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cagd.2008.06.009

zbMATH Keywords

topologycurvesarrangementparametricimplicit

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Plane and space curves (14H50) Computational aspects of algebraic curves (14Q05) Semialgebraic sets and related spaces (14P10) Computer-aided design (modeling of curves and surfaces) (65D17) Topology of real algebraic varieties (14P25)

Related Items

A softly optimal Monte Carlo algorithm for solving bivariate polynomial systems over the integers, On deflation and multiplicity structure, Efficient computation of dual space and directional multiplicity of an isolated point, A certified numerical algorithm for the topology of resultant and discriminant curves, Identifying and approximating monotonous segments of algebraic curves using support function representation, On the complexity of computing the topology of real algebraic space curves, On the topology and isotopic meshing of plane algebraic curves, Exact symbolic-numeric computation of planar algebraic curves, \texttt{PTOPO}: computing the geometry and the topology of parametric curves, Algorithm for Connectivity Queries on Real Algebraic Curves, p-adic algorithm for bivariate Gröbner bases, On the isotopic meshing of an algebraic implicit surface, On the topology of real algebraic plane curves, On the Topology of the Intersection Curve of Two Real Parameterized Algebraic Surfaces, 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, On the complexity of computing with planar algebraic curves, Bounds for polynomials on algebraic numbers and application to curve topology

Uses Software

• Axel

Cites Work

• Efficient and exact manipulation of algebraic points and curves
• On the complexity of isolating real roots and computing with certainty the topological degree
• On the computation of an arrangement of quadrics in 3D
• Introduction to the solution of polynomial systems
• Guaranteed consistency of surface intersections and trimmed surfaces using a coupled topology resolution and domain decomposition scheme
• Subdivision methods for solving polynomial equations
• On the number of branches of a plane curve germ
• On the number of branches of an 1-dimensional semianalytic set
• Computing the topological degree of a mapping in \(R^n\)
• Algorithm for algebraic curve intersection
• Computation of the solutions of nonlinear polynomial systems
• A new approach to the surface intersection problem
• Efficient topology determination of implicitly defined algebraic plane curves.
• Investigation of a subdivision based algorithm for solving systems of polynomial equations.
• Computation of the topology of real algebraic space curves
• Almost tight recursion tree bounds for the Descartes method
• Algorithms for Reporting and Counting Geometric Intersections
• Mathematics of Surfaces XI
• Algorithms - ESA 2003
• Algorithms in real algebraic geometry
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item