Subdivision schemes with general dilation in the geometric and nonlinear setting (Q657438): Difference between revisions

Here the convergence and smoothness of subdivision rules operating on manifold-valued data, based on a general dilation matrix are studied. Specially the results cover irregular combinatorics. It is observed that for the regular grid case, the results are not restricted to isotropic dilation matrices. The nature of the results is that intrinsic subdivision rules which operate on geometric data inherit smoothness properties of their linear counterparts.