Z-buffering ( Shown Surface Determination)
Revision as of 10:39, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(np)$ == Space Complexity == $O(p+n)$ words? (https://www.geeksforgeeks.org/z-buffer-depth-buffer-method/#:~:text=Z%2Dbuffer%2C%20which%20is%20also,pixels%20times%20number%20of%20objects.) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM? == Year == 1974 == Reference == http://isgwww.cs.uni-magdeburg.de/graphics/misc/Wolfgang_Stra%C3%9Fer_Schnelle_Kurven-_un...")
Time Complexity
$O(np)$
Space Complexity
$O(p+n)$ words?
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM?
Year
1974