Topology and arrangement computation of semi-algebraic planar curves

DOI10.1016/J.CAGD.2008.06.009zbMATH Open1172.14343OpenAlexW2047906192MaRDI QIDQ735517FDOQ735517

Authors: Lionel F. Alberti, Bernard Mourrain, Julien Wintz 

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

Recommendations

• On the topology of planar algebraic curves
• Computing the topology of an arrangement of implicitly defined real algebraic plane curves
• Subdivision methods for the topology of 2d and 3d implicit curves
• Arrangement computation for planar algebraic curves
• Efficient topology determination of implicitly defined algebraic plane curves.

zbMATH Keywords

topologyimplicitparametricarrangementcurves

Mathematics Subject Classification ID

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

Cites Work

• Computing the topological degree of a mapping in \(R^n\)
• Title not available (Why is that?)
• Algorithms in real algebraic geometry
• Almost tight recursion tree bounds for the Descartes method
• Algorithms for Reporting and Counting Geometric Intersections
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the complexity of isolating real roots and computing with certainty the topological degree
• Introduction to the solution of polynomial systems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Investigation of a subdivision based algorithm for solving systems of polynomial equations.
• Modern computer algebra
• Title not available (Why is that?)
• On the number of branches of an 1-dimensional semianalytic set
• Title not available (Why is that?)
• Subdivision methods for solving polynomial equations
• Efficient topology determination of implicitly defined algebraic plane curves.
• Subdivision methods for the topology of 2d and 3d implicit curves
• A new approach to the surface intersection problem
• Computation of the topology of real algebraic space curves
• Mathematics of Surfaces XI
• Computation of the solutions of nonlinear polynomial systems
• Algorithm for algebraic curve intersection
• On the number of branches of a plane curve germ
• Jacobi curves: computing the exact topology of arrangements of non-singular algebraic curves
• Title not available (Why is that?)
• Efficient and exact manipulation of algebraic points and curves
• Title not available (Why is that?)
• On the computation of an arrangement of quadrics in 3D
• Title not available (Why is that?)
• An approximate arrangement algorithm for semi-algebraic curves
• Arrangements
• Guaranteed consistency of surface intersections and trimmed surfaces using a coupled topology resolution and domain decomposition scheme

Cited In (30)

• A subdivision method for arrangement computation of semi-algebraic curves
• On the complexity of computing the topology of real algebraic space curves
• \texttt{PTOPO}: computing the geometry and the topology of parametric curves
• Title not available (Why is that?)
• A softly optimal Monte Carlo algorithm for solving bivariate polynomial systems over the integers
• p-adic algorithm for bivariate Gröbner bases
• Computing the topology of a real algebraic plane curve whose defining equations are available only ``by values
• On the isotopic meshing of an algebraic implicit surface
• Title not available (Why is that?)
• Subdivision methods for the topology of 2d and 3d implicit curves
• Efficient computation of dual space and directional multiplicity of an isolated point
• Regularity Criteria for the Topology of Algebraic Curves and Surfaces
• On the Topology of the Intersection Curve of Two Real Parameterized Algebraic Surfaces
• Computing the topology of an arrangement of implicit and parametric curves given by values
• Arrangement computation for planar algebraic curves
• On the topology and isotopic meshing of plane algebraic curves
• On deflation and multiplicity structure
• Isotopic meshing of a real algebraic space curve
• On the complexity of computing with planar algebraic curves
• An approximate arrangement algorithm for semi-algebraic curves
• Identifying and approximating monotonous segments of algebraic curves using support function representation
• Algorithm for Connectivity Queries on Real Algebraic Curves
• Computing the topology of an arrangement of implicitly defined real algebraic plane curves
• An \(\mathfrak{m}\)-adic algorithm for bivariate Gröbner bases
• A certified numerical algorithm for the topology of resultant and discriminant curves
• On the topology of real algebraic plane curves
• An improved complexity bound for computing the topology of a real algebraic space curve
• 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
• Exact symbolic-numeric computation of planar algebraic curves

Uses Software

• Axel

This page was built for publication: Topology and arrangement computation of semi-algebraic planar curves

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q735517)