Topology and arrangement computation of semi-algebraic planar curves
From MaRDI portal
Publication:735517
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)
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.
Cites work
- scientific article; zbMATH DE number 47178 (Why is no real title available?)
- scientific article; zbMATH DE number 3497890 (Why is no real title available?)
- scientific article; zbMATH DE number 3540081 (Why is no real title available?)
- scientific article; zbMATH DE number 3572747 (Why is no real title available?)
- scientific article; zbMATH DE number 1220053 (Why is no real title available?)
- scientific article; zbMATH DE number 2149738 (Why is no real title available?)
- scientific article; zbMATH DE number 797447 (Why is no real title available?)
- scientific article; zbMATH DE number 1424290 (Why is no real title available?)
- scientific article; zbMATH DE number 5019917 (Why is no real title available?)
- scientific article; zbMATH DE number 5222656 (Why is no real title available?)
- scientific article; zbMATH DE number 2221424 (Why is no real title available?)
- A new approach to the surface intersection problem
- Algorithm for algebraic curve intersection
- Algorithms for Reporting and Counting Geometric Intersections
- Algorithms in real algebraic geometry
- Almost tight recursion tree bounds for the Descartes method
- An approximate arrangement algorithm for semi-algebraic curves
- Arrangements
- Computation of the solutions of nonlinear polynomial systems
- Computation of the topology of real algebraic space curves
- Computing the topological degree of a mapping in \(R^n\)
- Efficient and exact manipulation of algebraic points and curves
- Efficient topology determination of implicitly defined algebraic plane curves.
- Guaranteed consistency of surface intersections and trimmed surfaces using a coupled topology resolution and domain decomposition scheme
- Introduction to the solution of polynomial systems
- Investigation of a subdivision based algorithm for solving systems of polynomial equations.
- Jacobi curves: computing the exact topology of arrangements of non-singular algebraic curves
- Mathematics of Surfaces XI
- Modern computer algebra
- On the complexity of isolating real roots and computing with certainty the topological degree
- On the computation of an arrangement of quadrics in 3D
- On the number of branches of a plane curve germ
- On the number of branches of an 1-dimensional semianalytic set
- Subdivision methods for solving polynomial equations
- Subdivision methods for the topology of 2d and 3d implicit curves
Cited in
(30)- Certified rational parametric approximation of real algebraic space curves with local generic position method
- Efficient computation of dual space and directional multiplicity of an isolated point
- Algorithm for Connectivity Queries on Real Algebraic Curves
- scientific article; zbMATH DE number 4180345 (Why is no real title available?)
- A softly optimal Monte Carlo algorithm for solving bivariate polynomial systems over the integers
- On the Topology of the Intersection Curve of Two Real Parameterized Algebraic Surfaces
- Computing the topology of an arrangement of implicitly defined real algebraic plane curves
- Computing the topology of an arrangement of implicit and parametric curves given by values
- On the isotopic meshing of an algebraic implicit surface
- Computing the topology of a real algebraic plane curve whose defining equations are available only ``by values
- An \(\mathfrak{m}\)-adic algorithm for bivariate Gröbner bases
- A subdivision method for arrangement computation of semi-algebraic curves
- On the topology and isotopic meshing of plane algebraic curves
- Bounds for polynomials on algebraic numbers and application to curve topology
- A certified numerical algorithm for the topology of resultant and discriminant curves
- On the topology of real algebraic plane curves
- Subdivision methods for the topology of 2d and 3d implicit curves
- An approximate arrangement algorithm for semi-algebraic curves
- Exact symbolic-numeric computation of planar algebraic curves
- An improved complexity bound for computing the topology of a real algebraic space curve
- Arrangement computation for planar algebraic 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 deflation and multiplicity structure
- scientific article; zbMATH DE number 2221446 (Why is no real title available?)
- Isotopic meshing of a real algebraic space curve
- \texttt{PTOPO}: computing the geometry and the topology of parametric curves
- On the complexity of computing with planar algebraic curves
- Regularity Criteria for the Topology of Algebraic Curves and Surfaces
- p-adic algorithm for bivariate Gröbner bases
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)
