Painter's algorithm/Newell's algorithm ( Shown Surface Determination)
Jump to navigation
Jump to search
Time Complexity
$O(n*log(n)$+np)
Space Complexity
$O(p+n)$ words?
((can be easily derived))
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM?
Year
1972
Reference
https://www.cs.drexel.edu/~david/Classes/Papers/p443-newell.pdf