On the complexity of parametrizing curves
From MaRDI portal
Recommendations
Cited in
(22)- Automatic parameterization of rational curves and surfaces. III: Algebraic plane curves
- Symbolic parametrization of curves
- Computing all parametric solutions for blending parametric surfaces
- Polynomial parametrization of curves without affine singularities
- Normal parametrizations of algebraic plane curves
- Reconsidering algorithms for real parametric curves
- Resolution of space curves complexity
- Effective Pila-Wilkie bounds for unrestricted Pfaffian surfaces
- Radical parametrizations of algebraic curves by adjoint curves
- On the parametrization of an algebraic curve
- Computation of the singularities of parametric plane curves
- Recognizing and parametrizing curves isomorphic to a line
- Approximate implicit equations of parameterized germs of plane curve
- A Polynomial Time Complexity Bound for Computations on Curves
- On the geometry and the topology of parametric curves
- scientific article; zbMATH DE number 4196138 (Why is no real title available?)
- Paramétrisation des courbes multiples primitives
- Parameterizations of algebraic curves
- Approximate parametrization of plane algebraic curves by linear systems of curves
- On the complexity of curve fitting algorithms
- Plotting missing points and branches of real parametric curves
- Parametrization of algebraic curves defined by sparse equations
This page was built for publication: On the complexity of parametrizing curves
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2365251)