Cutting corners always works

DOI10.1016/0167-8396(87)90029-XMaRDI QIDQ1099019zbMATH OpenOpenAlexFDO

Authors Carl De Boor

Publication date 1987

Published in Computer Aided Geometric Design (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-8396(87)90029-x

zbMATH Keywords

Chaikin's algorithmcorner-cutting algorithmsde Rham's trisection algorithm

Mathematics Subject Classification ID

Spline approximation (41A15)

Recommendations

• Local corner cutting and the smoothness of the limiting curve
• Nonuniform corner cutting
• scientific article; zbMATH DE number 24413
• A geometric look at corner cutting
• Convergence analysis of corner cutting algorithms refining nets of functions

Cites work

• scientific article; zbMATH DE number 3129881 (Why is no real title available?)
• A Theoretical Development for the Computer Generation and Display of Piecewise Polynomial Surfaces
• Sur les courbes limités de polygones obtenus par trisection
• Sur une courbe plane

Cited in

(33)

• Corner cutting curves and a new characterization of Bézier and B-spline curves
• Hölder regularity of geometric subdivision schemes
• A non-uniform corner-cutting subdivision scheme with an improved accuracy
• Cutting corners on the sphere
• Convergence analysis of corner cutting algorithms refining nets of functions
• A geometric approach for Hermite subdivision
• On the degree elevation of B-spline curves and corner cutting
• scientific article; zbMATH DE number 727943 (Why is no real title available?)
• Mixed honeycomb pushing refinement
• Fractal properties of the generalized chaikin corner-cutting subdivision scheme
• Corner cutting systems
• Two essential properties of \((q, h)\)-Bernstein-Bézier curves
• Improved convergence analysis of Lasserre's measure-based upper bounds for polynomial minimization on compact sets
• Dimension elevation in Müntz spaces: a new emergence of the Müntz condition
• Curvature continuous corner cutting
• Corner cutting and augmentation: An area-preserving method for smoothing polygons and polylines
• Refining cubic parametric B-splines
• Cutting corners preserves Lipschitz continuity
• The subdivision algorithm for generating curves and its properties
• Analysis of uniform binary subdivision schemes for curve design
• Polynomial generation and quasi-interpolation in stationary non-uniform subdivision
• Nonuniform corner cutting
• Convergence of subdivision and degree elevation
• The Bernstein polynomial basis: a centennial retrospective
• Error analysis of corner cutting algorithms
• Uniform refinement of curves
• You can't paint yourself into a corner
• Generating surfaces by refinement of curves
• Recursive de Casteljau bisection and rounding errors
• Convergence and smoothness of tensor-product of two non-uniform linear subdivision schemes
• Local corner cutting and the smoothness of the limiting curve
• A shape preserving corner cutting algorithm with an enhanced accuracy
• Control point based exact description of curves and surfaces, in extended Chebyshev spaces

This page was built for publication: Cutting corners always works

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