Jarvis (2-dimensional Convex Hull): Difference between revisions

From Algorithm Wiki
Jump to navigation Jump to search
(Created page with "== Time Complexity == $O(nh)$ == Space Complexity == $O({1})$ auxiliary? words (can be easily derived) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Real RAM == Year == 1973 == Reference == https://linkinghub-elsevier-com.ezproxy.canberra.edu.au/retrieve/pii/0020019073900203")
 
No edit summary
 
Line 5: Line 5:
== Space Complexity ==  
== Space Complexity ==  


$O({1})$ auxiliary? words
$O({1})$ words


(can be easily derived)
(can be easily derived)

Latest revision as of 08:54, 10 April 2023

Time Complexity

$O(nh)$

Space Complexity

$O({1})$ words

(can be easily derived)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Real RAM

Year

1973

Reference

https://linkinghub-elsevier-com.ezproxy.canberra.edu.au/retrieve/pii/0020019073900203