Parametrization of approximate algebraic curves by lines
Theoretical Computer Science - Algebraic and numerical algorithm
Distance bounds of ε-points on hypersurfaces
Theoretical Computer Science
Parametrization of approximate algebraic surfaces by lines
Computer Aided Geometric Design
Approximate parametrization of plane algebraic curves by linear systems of curves
Computer Aided Geometric Design
| Hi-index | 0.89 |
In Perez-Diaz 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.