Hanrahan–Krueger (Specular Reflection Texture Mapping)

From Algorithm Wiki

Revision as of 09:37, 10 April 2023 by Admin (talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

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

Reference

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Hanrahan–Krueger_(Specular_Reflection_Texture_Mapping)&oldid=47355"