Numerical Reparametrization of Rational Parametric Plane Curves
classification
🧮 math.AG
cs.SC
keywords
curveplanealgorithmcurvesepsilongivennumericalparametrization
read the original 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 $\cal P$ with perturbed float coefficients of a plane curve $\cal C$, we present an algorithm that computes a parametrization $\cal Q$ of a new plane curve $\cal D$ such that ${\cal Q}$ is an {\it $\epsilon$--proper reparametrization} of $\cal D$. In addition, the error bound is carefully discussed and we present a formula that measures the "closeness" between the input curve $\cal C$ and the output curve $\cal D$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.