Convergence analysis of corner cutting algorithms refining nets of functions

In this paper we propose a corner cutting algorithm for nets of functions and prove its convergence using some approximation ideas first applied to the case of corner cutting algorithms refining points with weights proposed by Gregory and Qu. In the net case convergence is proved for the above mentioned weights satisfying an additional condition. The condition requires a bound on the supremum of the relative sizes of the cuts.