On the performance of the approximate parametrization algorithm for curves

DOI10.1016/j.ipl.2011.11.008zbMath1237.68238arXiv1004.2148OpenAlexW1980357588MaRDI QIDQ413277

Sonia L. Rueda, Sendra, Juana

Publication date: 4 May 2012

Published in: Information Processing Letters (Search for Journal in Brave)

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

zbMATH Keywords

rational curvesperformance evaluationHausdorff distanceapproximate parametrization

Mathematics Subject Classification ID

Computer science aspects of computer-aided design (68U07) Plane and space curves (14H50) Computer-aided design (modeling of curves and surfaces) (65D17)

Related Items (3)

Bounding and estimating the Hausdorff distance between real space algebraic curves ⋮ Certified rational parametric approximation of real algebraic space curves with local generic position method ⋮ Characterizing the finiteness of the Hausdorff distance between two algebraic curves

Cites Work

• Unnamed Item
• Parametrization of approximate algebraic curves by lines
• Approximate parametrization of plane algebraic curves by linear systems of curves
• Distance bounds of \(\varepsilon\)-points on hypersurfaces
• Parametrization of approximate algebraic surfaces by lines

This page was built for publication: On the performance of the approximate parametrization algorithm for curves