A geometric look at corner cutting

DOI10.1016/S0167-8396(96)00038-6zbMath0896.65011OpenAlexW2048630601MaRDI QIDQ1391709

D. Massart

Publication date: 22 July 1998

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

Full work available at URL: https://doi.org/10.1016/s0167-8396(96)00038-6

zbMATH Keywords

dualityconicsconvex curves\(C^{1}\)-interpolationHaase's algorithminterpolatory refinementmatrix subdivisionspherical and planar corner cutting

Mathematics Subject Classification ID

Computer-aided design (modeling of curves and surfaces) (65D17)

Related Items

Corner cutting and augmentation: An area-preserving method for smoothing polygons and polylines, Geometric conditions of non-self-intersecting NURBS surfaces, Convergence analysis of corner cutting algorithms refining nets of functions, Mixed honeycomb pushing refinement, Degree elevation of changeable degree spline, On the degree elevation of B-spline curves and corner cutting

Cites Work

• Sur une courbe plane
• Local corner cutting and the smoothness of the limiting curve
• Computing surfaces invariant under subdivision
• Interpolatory convexity-preserving subdivision schemes for curves and surfaces
• Dual Bézier curves and convexity preserving interpolation
• Convexity-preserving interpolatory subdivision
• Linear subdivision
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item