Solution

ID: past-exam-of-the-mathematics-course-of-the-university-of-cambridge/2006/iii/paper-66/5/b/solution

Write the Laurent generating function of the one-step subdivision mask as
For quincunx subdivision, . A second step gives . Setting and , its fine-grid offset is , since . Hence the binary mask is the convolution of with its -transformed copy:
Expanding gives the centered binary propagation subdivision mask, with row and column offsets running from to :
The numerator entries sum to , so , appropriate for a binary surface refinement. More specifically, each of the four parity classes sums to one after division by , checking constant reproduction at every type of new lattice point.

New to topics? Read the docs here!