Tight linear envelopes for splines

DOI10.1007/S002110100181MaRDI QIDQ5952131zbMATH OpenOpenAlexFDO

Authors David Lutterkort, Jörg Peters

Publication date 19 August 2002

Published in Numerische Mathematik (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s002110100181

zbMATH Keywords

B-splineBernstein-Bézier formboundcontrol polygonpiecewise linear envelopesecond differencespline

Mathematics Subject Classification ID

Spline approximation (41A15) Numerical computation using splines (65D07)

Review text

The authors show how to bound the maximal distance between a spline and its B-spline control polygon in terms of second differences of the control points and linear interpolants of special piecewise convex and nonnegative splines that depend only on the knot sequence. The bound yields a piecewise linear envelope enclosing spline and polygon. This envelope is particularly simple for unifom splines and splines in Bernstein-Bézier form and shrinks by a factor of 4 for each uniform subdivision step [cf. \textit{E. Cohen} and \textit{L. L. Schumaker}, Comput. Aided Geom. Des. 2, 229-235 (1985; Zbl 0597.65003) and \textit{W. Dahmen}, J. Comput. Appl. Math. 16, 145-158 (1986; Zbl 0596.65003)].

Recommendations

• Best bounds on the approximation of polynomials and splines by their control structure
• scientific article; zbMATH DE number 854629
• scientific article; zbMATH DE number 822279
• Managing the shape of planar splines by their control polygons
• Sharp, quantitative bounds on the distance between a polynomial piece and its Bézier control polygon

Cited in

(14)

• Estimating error bounds for quaternary subdivision schemes
• The distance of a subdivision surface to its control polyhedron
• Best bounds on the approximation of polynomials and splines by their control structure
• A formula for estimating the deviation of a binary interpolatory subdivision curve from its data polygon
• Sleves for planar spline curves
• Best bounds on the distance between 3-direction quartic box spline surface and its control net
• Error bounds for a convexity-preserving interpolation and its limit function
• Estimating error bounds for binary subdivision curves/surfaces
• Efficient one-sided linearization of spline geometry
• Envelopes of splines in the projective plane
• Optimized refinable enclosures of multivariate polynomial pieces
• A simple and efficient approximation of a Bézier piece by its cutdown polygon
• Error bounds for a class of subdivision schemes based on the two-scale refinement equation
• A bound on the approximation of a Catmull-Clark subdivision surface by its limit mesh

This page was built for publication: Tight linear envelopes for splines

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