Read and understand very well the Hanrahan paper[19]. What is the time and space complexity of the basic (non-Multigridding) algorithm (in terms of s initial surfaces and n final patches).
