Painter's algorithm/Newell's algorithm ( Shown Surface Determination)

From Algorithm Wiki

Revision as of 10:39, 15 February 2023 by Admin (talk | contribs) (Created page with "== 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")

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

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

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=Painter%27s_algorithm/Newell%27s_algorithm_(_Shown_Surface_Determination)&oldid=44669"