Chand-Kapur, Gift Wrapping (d-dimensional Convex Hull Convex Hull)

From Algorithm Wiki

Jump to navigation Jump to search

Time Complexity

$O(n*f_1)$

Space Complexity

words

()

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Real RAM

Year

1970

Reference

https://dl.acm.org/doi/pdf/10.1145/321556.321564

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Chand-Kapur,_Gift_Wrapping_(d-dimensional_Convex_Hull_Convex_Hull)&oldid=45067"