Repeated local operations for m-ary 2N-point Dubuc–Deslauriers subdivision schemes

We propose to implement the m-ary 2N-point Dubuc–Deslauriers subdivision scheme (DDSS) using a series of repeated local operations, which are based on a recursive formula between the newly inserted points of m-ary 2N-point DDSS and those of m  -ary (2N−2)(2N−2)-point and m  -ary (2N−4)(2N−4)-point DDSSs. Numerical analysis reveals the robustness of our method.