Miller; Stout (2-dimensional Convex Hull)

From Algorithm Wiki
Revision as of 11:36, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(logn)$ time using $O(n)$ processors == Space Complexity == $O(n)$ total? words () == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == EREW PRAM, possibly others (see paper) == Year == 1988 == Reference == https://cse.buffalo.edu/faculty/miller/Papers/IEEETC88a.pdf")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O(logn)$ time using $O(n)$ processors

Space Complexity

$O(n)$ total? words

()

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

EREW PRAM, possibly others (see paper)

Year

1988

Reference

https://cse.buffalo.edu/faculty/miller/Papers/IEEETC88a.pdf

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=Miller;_Stout_(2-dimensional_Convex_Hull)&oldid=44578"