Numerical proper reparametrization of parametric plane curves

DOI10.1016/J.CAM.2014.09.012MaRDI QIDQ464649zbMATHOpenAlexWikidataFDO

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)

Full work available at URL https://arxiv.org/abs/1305.2461

zbMATH Keywords

algorithmerror boundrational curveapproximately improperproper reparametrization

Mathematics Subject Classification ID

Computer-aided design (modeling of curves and surfaces) (65D17)

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 $epsilon>0$ and a rational parametrization $calP$ with perturbed float coefficients of a plane curve $calC$, we present an algorithm that computes a parametrization $calQ$ of a new plane curve $calD$ such that $calQ$ is an {it $epsilon$--proper reparametrization} of $calD$. In addition, the error bound is carefully discussed and we present a formula that measures the "closeness" between the input curve $calC$ and the output curve $calD$.

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

• scientific article; zbMATH DE number 2130855 (Why is no real title available?)
• scientific article; zbMATH DE number 1206418 (Why is no real title available?)
• scientific article; zbMATH DE number 1254271 (Why is no real title available?)
• scientific article; zbMATH DE number 1263413 (Why is no real title available?)
• scientific article; zbMATH DE number 491264 (Why is no real title available?)
• scientific article; zbMATH DE number 977905 (Why is no real title available?)
• scientific article; zbMATH DE number 3045739 (Why is no real title available?)
• <tex>$QR$</tex>Factoring to Compute the GCD of Univariate Approximate Polynomials
• A fast and numerically stable Euclidean-like algorithm for detecting relatively prime numerical polynomials
• A partial solution to the problem of proper reparametrization for rational surfaces
• 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 univariate resultant-based implicitization algorithm for surfaces
• An algorithm to parametrize approximately space curves
• An evolution-based approach for approximate parameterization of implicitly defined curves by polynomial parametric spline curves
• Approximate parametrization of plane algebraic curves by linear systems of curves
• Automatic parameterization of rational curves and surfaces. III: Algebraic plane curves
• Certified approximation of parametric space curves with cubic \(B\)-spline curves
• Certified rational parametric approximation of real algebraic space curves with local generic position method
• Distance bounds of \(\varepsilon\)-points on hypersurfaces
• Finite piecewise polynomial parametrization of plane rational algebraic curves
• Implicitization of rational parametric equations
• Improperly parametrized rational curves
• Inherently improper surface parametric supports
• Irreducible decomposition of curves
• Numerical computation of bifurcations in large equilibrium systems in \textsc{Matlab}
• Numerical methods for approximating digitized curves by piecewise circular arcs
• On the numerical condition of algebraic curves and surfaces. I: Implicit equations
• On the problem of proper reparametrization for rational curves and surfaces
• Parametric algebraic curves and applications. Session of the IMACS-ACA conference, University of New Mexico, Albuquerque, NM, USA, May 1995
• Parametrization of approximate algebraic curves by lines
• Parametrization of approximate algebraic surfaces by lines
• Polynomial algorithms in computer algebra
• Proper reparametrization for inherently improper unirational varieties
• Rational quadratic approximation to real algebraic curves
• The approximate GCD of inexact polynomials
• The moving line ideal basis of planar rational curves
• Towards factoring bivariate approximate polynomials
• When are two numerical polynomials relatively prime?

Cited in

(9)

• Approximation of parametric curves by moving least squares method
• Characterizing the finiteness of the Hausdorff distance between two algebraic curves
• Choice of parametric representation in numerical approximation and encoding of curves
• Approximate parametrization of plane algebraic curves by linear systems of curves
• Inversion, degree, reparametrization and implicitization of improperly parametrized planar curves using \(\mu \)-basis
• On the problem of proper reparametrization for rational curves and surfaces
• Numerical reparametrization of periodic planar curves via curvature interpolation
• \textsf{ImUp}: a Maple package for uniformity-improved reparameterization of plane curves
• Numerical polynomial reparametrization of rational curves

Describes a project that uses

Uses Software

• CASA
• MultRoot
• CL_MATCONTL
• CL_MATCONT

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)