Bernstein-type bases and corner cutting algorithms for \(C^1\) Merrien's curves (Q1424954)

The author continues the ideas of \textit{J.-L. Merrien} [Numer. Algorithms 2, 187--200 (1992; Zbl 0754.65011)] and of \textit{J.-L. Merrien} and \textit{P. Sablonnière} [Constructive Approximation 19, No. 2, 279--298 (2003; Zbl 1018.41012)]. In the above papers the monotonicity and the convexity of \(C^1\) interpolants generated by a subdivision algorithm introduced by Merrien are studied. For the \(C^1\) Merrien's curves, the author constructs the Bernstein-type basis and the control polygon. Next, corner-cutting algorithms for two specific families of curves are presented. The author studies the monoticity and the convexity of interpolants for the above families of curves. The convergence of algorithms is also proved.