Warnock'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(np)$ == Space Complexity == $O(p+n)$? words? ((can be easily derived?)) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM? == Year == 1969 == Reference == https://dl-acm-org.ezproxy.canberra.edu.au/doi/book/10.5555/905316?dl=ACM")

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

Jump to navigation Jump to search

Time Complexity

$O(np)$

Space Complexity

$O(p+n)$? words?

((can be easily derived?))

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM?

Year

1969

Reference

https://dl-acm-org.ezproxy.canberra.edu.au/doi/book/10.5555/905316?dl=ACM

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