On the performance of the approximate parametrization algorithm for curves

DOI10.1016/J.IPL.2011.11.008zbMATH Open1237.68238arXiv1004.2148OpenAlexW1980357588MaRDI QIDQ413277FDOQ413277

Sonia Rueda, Juana Sendra

Publication date: 4 May 2012

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

Abstract: In [Computer Aided Geometric Design 27 (2010), 212-231] the authors present an algorithm to parametrize approximately $epsilon$-rational curves, and they show in 2 examples that the Hausdorff distance, w.r.t. to the Euclidean distance, between the input and output curves is small. In this paper, we analyze this distance for a whole family of curves randomly generated and we automatize the strategy used in [Computer Aided Geometric Design 27 (2010), 212-231]. We find a reasonable upper bound of the Hausdorff distance between each input and output curve of the family.

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

zbMATH Keywords

Hausdorff distanceperformance evaluationrational curvesapproximate 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)

Cites Work

• Title not available (Why is that?)
• Distance bounds of \(\varepsilon\)-points on hypersurfaces
• Approximate parametrization of plane algebraic curves by linear systems of curves
• Parametrization of approximate algebraic surfaces by lines
• Parametrization of approximate algebraic curves by lines

Cited In (11)

• OPTIMAL ADAPTIVE ALGORITHMS FOR FINDING THE NEAREST AND FARTHEST POINT ON A PARAMETRIC BLACK-BOX CURVE
• COMPUTATIONAL METHODS FOR DISCRETE PARAMETRIC ℓ₁ AND ℓ_∞ CURVE FITTING
• Bounding and estimating the Hausdorff distance between real space algebraic curves
• Characterizing the finiteness of the Hausdorff distance between two algebraic curves
• On the complexity of curve fitting algorithms
• Corrigendum to: ``A heuristic and evolutionary algorithm to optimize the coefficients of curve parametrizations.
• An algorithm to parametrize approximately space curves
• A symbolic-numerical approach to approximate parameterizations of space curves using graphs of critical points
• A curve-shaping approach for determining bounds on H/sub ∞/ performance under hard constraints
• Choice of parametric representation in numerical approximation and encoding of curves
• Certified rational parametric approximation of real algebraic space curves with local generic position method

   Recommendations

• An algorithm to parametrize approximately space curves 👍 👎
• Approximate parametrization of plane algebraic curves by linear systems of curves 👍 👎
• Computing the Hausdorff distance between two sets of parametric curves 👍 👎
• Rational Hausdorff divisors: a new approach to the approximate parametrization of curves 👍 👎
• Bounding the Hausdorff distance between implicitly defined and/or parametric curves 👍 👎

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q413277)