Approximation by conic splines

Abstract : We show that the complexity of a parabolic or conic spline approximating a sufficiently smooth curve with non-vanishing curvature to within Hausdorff distance $\varepsilon$ is $c_1\varepsilon^{-\frac{1}{4}} + O(1)$, if the spline consists of parabolic arcs, and $c_2\varepsilon^{-\frac{1}{5}} + O(1)$, if it is composed of general conic arcs of varying type. The constants $c_1$ and $c_2$ are expressed in the Euclidean and affine curvature of the curve. We also show that the Hausdorff distance between a curve and an optimal conic arc tangent at its endpoints is increasing with its arc length, provided the affine curvature along the arc is monotone. This property yields a simple bisection algorithm for the computation of an optimal parabolic or conic spline.
Document type :
Journal articles
Mathematics in Computer Science, Springer, 2007, 1 (1), pp.39-69. <10.1007/s11786-007-0004-8>
Liste complète des métadonnées


https://hal.inria.fr/inria-00188456
Contributor : Sylvain Petitjean <>
Submitted on : Thursday, June 30, 2011 - 5:53:09 PM
Last modification on : Wednesday, March 15, 2017 - 12:13:01 PM
Document(s) archivé(s) le : Saturday, October 1, 2011 - 2:20:15 AM

File

conics.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Sunayana Ghosh, Sylvain Petitjean, Gert Vegter. Approximation by conic splines. Mathematics in Computer Science, Springer, 2007, 1 (1), pp.39-69. <10.1007/s11786-007-0004-8>. <inria-00188456>

Share

Metrics

Record views

356

Document downloads

127