Ward anisotropic (Specular Reflection Texture Mapping): Difference between revisions

From Algorithm Wiki
Jump to navigation Jump to search
(Created page with "== Time Complexity == $O(n^{1.67} log^{2} n)$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1989 == Reference ==")
 
No edit summary
 
Line 1: Line 1:
== Time Complexity ==  
== Time Complexity ==  


$O(n^{1.67} log^{2} n)$
$O(n^{1.{6}7} \log^{2} n)$


== Space Complexity ==  
== Space Complexity ==  

Latest revision as of 08:37, 10 April 2023

Time Complexity

$O(n^{1.{6}7} \log^{2} n)$

Space Complexity

()

Description

Approximate?

Approximate

Approximation Factor:

Randomized?

No, deterministic

Model of Computation

Year

1989

Reference