Approximation by Conic Splines

Sunayana Ghosh, Sylvain Petitjean, Gert Vegter

    Research output: Contribution to journalArticleAcademic

    1 Citation (Scopus)
    22 Downloads (Pure)

    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 ε is c1ε^−1/4 + O(1), if the spline consists of parabolic arcs, and c2ε^−1/5 + O(1), if it is composed of general conic arcs of varying type. The constants c1 and c2 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.
    Original languageEnglish
    Pages (from-to)39-69
    Number of pages31
    JournalMathematics in computer science
    Volume1
    Issue number1
    DOIs
    Publication statusPublished - 2007

    Keywords

    • affine spiral
    • affine curvature
    • differential geometry
    • complexity
    • Hausdorff distance
    • conics
    • splines
    • approximation

    Fingerprint

    Dive into the research topics of 'Approximation by Conic Splines'. Together they form a unique fingerprint.

    Cite this