Numerical proper reparametrization of parametric plane curves
From MaRDI portal
Publication:464649
DOI10.1016/j.cam.2014.09.012zbMath1302.65049arXiv1305.2461OpenAlexW1875802246WikidataQ57533579 ScholiaQ57533579MaRDI QIDQ464649
Li-Yong Shen, Sonia Pérez-Díaz
Publication date: 28 October 2014
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1305.2461
Related Items
Characterizing the finiteness of the Hausdorff distance between two algebraic curves, Approximation of parametric curves by moving least squares method, Inversion, degree, reparametrization and implicitization of improperly parametrized planar curves using \(\mu \)-basis
Uses Software
Cites Work
- Numerical computation of bifurcations in large equilibrium systems in \textsc{Matlab}
- Parametrization of approximate algebraic curves by lines
- Approximate parametrization of plane algebraic curves by linear systems of curves
- Proper reparametrization for inherently improper unirational varieties
- An evolution-based approach for approximate parameterization of implicitly defined curves by polynomial parametric spline curves
- Irreducible decomposition of curves
- Certified approximation of parametric space curves with cubic \(B\)-spline curves
- On the numerical condition of algebraic curves and surfaces. I: Implicit equations
- Finite piecewise polynomial parametrization of plane rational algebraic curves
- A predictor-corrector-type technique for the approximate parameterization of intersection curves
- Improperly parametrized rational curves
- Automatic parameterization of rational curves and surfaces. III: Algebraic plane curves
- Implicitization of rational parametric equations
- The moving line ideal basis of planar rational curves
- When are two numerical polynomials relatively prime?
- A fast and numerically stable Euclidean-like algorithm for detecting relatively prime numerical polynomials
- Parametric algebraic curves and applications. Session of the IMACS-ACA conference, University of New Mexico, Albuquerque, NM, USA, May 1995
- Polynomial algorithms in computer algebra
- Numerical methods for approximating digitized curves by piecewise circular arcs
- A symbolic-numerical approach to approximate parameterizations of space curves using graphs of critical points
- Rational quadratic approximation to real algebraic curves
- Inherently improper surface parametric supports
- An algorithm to parametrize approximately space curves
- Certified rational parametric approximation of real algebraic space curves with local generic position method
- A partial solution to the problem of proper reparametrization for rational surfaces
- A univariate resultant-based implicitization algorithm for surfaces
- On the problem of proper reparametrization for rational curves and surfaces
- Distance bounds of \(\varepsilon\)-points on hypersurfaces
- Parametrization of approximate algebraic surfaces by lines
- Towards factoring bivariate approximate polynomials
- The approximate GCD of inexact polynomials
- <tex>$QR$</tex>Factoring to Compute the GCD of Univariate Approximate Polynomials
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
