Login / Signup
On the complexity of convex hull algorithms if rotational minima can be found very fast.
Ulrich Huckenbeck
Published in:
ZOR Methods Model. Oper. Res. (1988)
Keyphrases
</>
convex hull
computational complexity
worst case
computational geometry
computationally expensive
machine learning
feasible solution
training samples
recursive algorithm