next up previous
Next: Programming Assignment 5: Due Up: Week 6: Hierarchical Methods Previous: Practice: Hierarchical Matrix Multiply

   
Homework 6: Due Week 7

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).



Comments: Brian Edward Smits
1998-06-08