On the performance of the approximate parametrization algorithm for curves

摘要

In Pérez-Díaz et al. (2009) [5], the authors present an algorithm to parametrize approximately e -rational curves, and they show that the Hausdorff distance, w.r.t. the Euclidean distance, between the input and output curves is finite. In this paper, we analyze this distance for a family of curves randomly generated and we empirically find a reasonable upper bound of the Hausdorff distance between each input and output curve of the family.