Corner cutting systems

If we can evaluate a curve by means of a corner cutting algorithm, we call the corresponding system of functions a corner cutting system. We prove that corner cutting systems are always monotonicity preserving. We obtain weak sufficient conditions for corner cutting systems. Optimal stability properties and properties concerning the supports of the basis functions of corner cutting systems are also analyzed.