Numerical proper reparametrization of parametric plane curves
From MaRDI portal
Publication:464649
DOI10.1016/J.CAM.2014.09.012zbMATH Open1302.65049arXiv1305.2461OpenAlexW1875802246WikidataQ57533579 ScholiaQ57533579MaRDI QIDQ464649FDOQ464649
Authors: 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)
Abstract: In this paper, we present an algorithm for reparametrizing algebraic plane curves from a numerical point of view. That is, we deal with mathematical objects that are assumed to be given approximately. More precisely, given a tolerance and a rational parametrization with perturbed float coefficients of a plane curve , we present an algorithm that computes a parametrization of a new plane curve such that is an {it --proper reparametrization} of . In addition, the error bound is carefully discussed and we present a formula that measures the "closeness" between the input curve and the output curve .
Full work available at URL: https://arxiv.org/abs/1305.2461
Recommendations
- Approximate parametrization of plane algebraic curves by linear systems of curves
- Numerical polynomial reparametrization of rational curves
- An algorithm to parametrize approximately space curves
- Finite piecewise polynomial parametrization of plane rational algebraic curves
- On the problem of proper reparametrization for rational curves and surfaces
Cites Work
- Improperly parametrized rational curves
- On the problem of proper reparametrization for rational curves and surfaces
- Title not available (Why is that?)
- An evolution-based approach for approximate parameterization of implicitly defined curves by polynomial parametric spline curves
- Polynomial algorithms in computer algebra
- The moving line ideal basis of planar rational curves
- Title not available (Why is that?)
- Title not available (Why is that?)
- The approximate GCD of inexact polynomials
- <tex>$QR$</tex>Factoring to Compute the GCD of Univariate Approximate Polynomials
- Numerical computation of bifurcations in large equilibrium systems in \textsc{Matlab}
- Distance bounds of \(\varepsilon\)-points on hypersurfaces
- On the numerical condition of algebraic curves and surfaces. I: Implicit equations
- A fast and numerically stable Euclidean-like algorithm for detecting relatively prime numerical polynomials
- Approximate parametrization of plane algebraic curves by linear systems of curves
- Automatic parameterization of rational curves and surfaces. III: Algebraic plane curves
- An algorithm to parametrize approximately space curves
- Title not available (Why is that?)
- Parametrization of approximate algebraic surfaces by lines
- Parametrization of approximate algebraic curves by lines
- Irreducible decomposition of curves
- Implicitization of rational parametric equations
- When are two numerical polynomials relatively prime?
- Parametric algebraic curves and applications. Session of the IMACS-ACA conference, University of New Mexico, Albuquerque, NM, USA, May 1995
- 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
- 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
- Towards factoring bivariate approximate polynomials
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Proper reparametrization for inherently improper unirational varieties
- Certified approximation of parametric space curves with cubic \(B\)-spline curves
- Finite piecewise polynomial parametrization of plane rational algebraic curves
- A predictor-corrector-type technique for the approximate parameterization of intersection curves
Cited In (7)
- Approximate parametrization of plane algebraic curves by linear systems of curves
- Characterizing the finiteness of the Hausdorff distance between two algebraic curves
- \textsf{ImUp}: a Maple package for uniformity-improved reparameterization of plane curves
- Inversion, degree, reparametrization and implicitization of improperly parametrized planar curves using \(\mu \)-basis
- Approximation of parametric curves by moving least squares method
- On the problem of proper reparametrization for rational curves and surfaces
- Choice of parametric representation in numerical approximation and encoding of curves
Uses Software
This page was built for publication: Numerical proper reparametrization of parametric plane curves
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q464649)