Convergence analysis of corner cutting algorithms refining nets of functions

DOI10.1016/j.matcom.2020.01.012OpenAlexW3006051007MaRDI QIDQ1998050

Lucia Romani, N. Richter-Dyn, Constanza Conti

Publication date: 6 March 2021

Published in: Mathematics and Computers in Simulation (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11585/726443

zbMATH Keywords

convergenceLipschitz continuityCoons transfinite interpolationcorner cutting for nets of functionscorner cutting for polygonal lines

Mathematics Subject Classification ID

Computing methodologies and applications (68Uxx)

Related Items (3)

A non-uniform corner-cutting subdivision scheme with an improved accuracy ⋮ Applied scientific computing XV: innovative modeling and simulation in sciences ⋮ A shape preserving corner cutting algorithm with an enhanced accuracy

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new method for the analysis of univariate nonuniform subdivision schemes
• Regularity of non-stationary subdivision: a matrix approach
• Blending based corner cutting subdivision scheme for nets of curves
• Analysis of subdivision schemes for nets of functions by proximity and controllability
• Nonuniform corner cutting
• Interpolatory blending net subdivision schemes of Dubuc-Deslauriers type
• Sur une courbe plane
• Sur les courbes limités de polygones obtenus par trisection
• Local corner cutting and the smoothness of the limiting curve
• Cutting corners always works
• Transfinite mappings and their application to grid generation
• A geometric look at corner cutting
• A family of non-uniform subdivision schemes with variable parameters for curve design
• Dual univariate \(m\)-ary subdivision schemes of de Rham-type
• On the regularity of de Rham curves

This page was built for publication: Convergence analysis of corner cutting algorithms refining nets of functions