A unified framework for interpolating and approximating univariate subdivision (Q972164): Difference between revisions

Subdivision surface refinement schemes can be broadly classified into two categories: interpolating and approximating. Interpolating schemes are required to match the original position of vertices in the original mesh. Approximating schemes are not; they can and will adjust these positions as needed. It is shown that univariate subdivision schemes with odd-width masks of finite support can be derived one from the others by simple operations on the masks coefficients. This equivalence is done through the polynomial factors of the generating functions associated to the schemes. Under certain conditions, the polynomial associated to a interpolating subdivision scheme factorizes as a product of the polynomial associated to a interpolating subdivision scheme times another polynomial, called by the authors, the link polynomial. The result is applied in the context of binary and ternary stationary and non-stationary subdivision schemes showing that it also provides a constructive method for the definition of novel refinement algorithms.