Hanrahan–Krueger (Specular Reflection Texture Mapping)
Jump to navigation
Jump to search
Time Complexity
$O(n^{2} \log n)$
Space Complexity
()
Description
Approximate?
Approximate
Approximation Factor:
Randomized?
No, deterministic
Model of Computation
Year
1995