Certified rational parametric approximation of real algebraic space curves with local generic position method
From MaRDI portal
Publication:2437282
Abstract: In this paper, an algorithm to compute a certified rational parametric approximation for algebraic space curves is given by extending the local generic position method for solving zero dimensional polynomial equation systems to the case of dimension one. By certified, we mean the approximation curve and the original curve have the same topology and their Hausdauff distance is smaller than a given precision. Thus, the method also gives a new algorithm to compute the topology for space algebraic curves. The main advantage of the algorithm, inhering from the local generic method, is that topology computation and approximation for a space curve is directly reduced to the same tasks for two plane curves. In particular, the error bound of the approximation space curve is obtained from the error bounds of the approximation plane curves explicitly. Nontrivial examples are used to show the effectivity of the method.
Recommendations
- An algorithm to parametrize approximately space curves
- A symbolic-numerical approach to approximate parameterizations of space curves using graphs of critical points
- Certified approximation of parametric space curves with cubic \(B\)-spline curves
- Approximating Algebraic Space Curves by Circular Arcs
- Isotopic meshing of a real algebraic space curve
Cites work
- scientific article; zbMATH DE number 5764874 (Why is no real title available?)
- scientific article; zbMATH DE number 52177 (Why is no real title available?)
- scientific article; zbMATH DE number 3620034 (Why is no real title available?)
- scientific article; zbMATH DE number 977905 (Why is no real title available?)
- scientific article; zbMATH DE number 2149738 (Why is no real title available?)
- scientific article; zbMATH DE number 1446863 (Why is no real title available?)
- A polynomial-time algorithm for the topological type of real algebraic curve
- A predictor-corrector-type technique for the approximate parameterization of intersection curves
- A symbolic-numerical approach to approximate parameterizations of space curves using graphs of critical points
- A worst-case bound for topology computation of algebraic curves
- Algorithm for the parameterization of rational curves revisited
- Algorithms in real algebraic geometry
- An efficient method for analyzing the topology of plane real algebraic curves.
- Approximate parametrization of plane algebraic curves by linear systems of curves
- Automatic parameterization of rational curves and surfaces IV: algebraic space curves
- Certified approximation of parametric space curves with cubic \(B\)-spline curves
- Complete subdivision algorithms, II
- Computation of the topology of real algebraic space curves
- Efficient topology determination of implicitly defined algebraic plane curves.
- Enhancing Levin's method for computing quadric-surface intersections
- Exact symbolic-numeric computation of planar algebraic curves
- NURBS approximation of surface / surface intersection curves
- Near-optimal parameterization of the intersection of quadrics. I. The generic algorithm
- Near-optimal parameterization of the intersection of quadrics. II. A classification of pencils
- Near-optimal parameterization of the intersection of quadrics. III. Parameterizing singular intersections
- Numerical parameterization of curves and surfaces
- On local implicit approximation and its applications
- On the asymptotic and practical complexity of solving bivariate systems over the reals
- On the choice of pencils in the parametrization of curves
- On the computation of the topology of a non-reduced implicit space curve
- On the exact computation of the topology of real algebraic curves
- On the isotopic meshing of an algebraic implicit surface
- On the parameterization of algebraic curves
- On the performance of the approximate parametrization algorithm for curves
- On the topology of real algebraic plane curves
- Parameterization of algebraic space curves. Appendix
- Rational parametrizations of algebraic curves using a canonical divisor
- Rational quadratic approximation to real algebraic curves
- Root isolation for bivariate polynomial systems with local generic position method
- Root isolation of zero-dimensional polynomial systems with linear univariate representation
- Subdivision methods for the topology of 2d and 3d implicit curves
- Symbolic parametrization of curves
- The topological configuration of a real algebraic curve
- Topology and arrangement computation of semi-algebraic planar curves
- Topology of real algebraic space curves
- Tracing surface intersections
- Using signature sequences to classify intersection curves of two quadrics
- When Newton meets Descartes
Cited in
(13)- Computing the topology of a plane or space hyperelliptic curve
- On the complexity of computing the topology of real algebraic space curves
- \texttt{PTOPO}: computing the geometry and the topology of parametric curves
- The complexity of subdivision for diameter-distance tests
- Rational Hausdorff divisors: a new approach to the approximate parametrization of curves
- Numerical proper reparametrization of parametric plane curves
- Approximation of parametric curves by moving least squares method
- Certified approximation of parametric space curves with cubic \(B\)-spline curves
- Globally certified \(G^1\) approximation of planar algebraic curves
- Isotopic meshing of a real algebraic space curve
- Algorithm for Connectivity Queries on Real Algebraic Curves
- Piecewise rational approximation of square-root parameterizable curves using the Weierstrass form
- An improved complexity bound for computing the topology of a real algebraic space curve
This page was built for publication: Certified rational parametric approximation of real algebraic space curves with local generic position method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2437282)
