Recently we have characterized the convergence of bivariate subdivision scheme with nonnegative mask whose support is convex by means of the so-called connectivity of a square matrix, which is derived by a given mask. The convergence in this case can be checked in linear time with respected to the size of a square matrix. This paper will focus on the characterization of such schemes with non-convex supports.

中文翻译：

---

支持非凸的具有非负掩码的收敛双变量细分方案

最近，我们描述了具有非负掩码的双变量细分方案的收敛性，其支持通过所谓的方阵的连通性是凸的，方阵是由给定掩码导出的。这种情况下的收敛性可以在相对于方阵大小的线性时间内进行检查。本文将重点关注具有非凸支持的此类方案的表征。