Login / Signup
Finding the vertices of the convex hull, even unordered, takes Omega(n log n) time - a proof by reduction from epsilon-closeness.
Herman J. Haverkort
Published in:
CoRR (2018)
Keyphrases
</>
convex hull
simple polygon
finite set of points
feasible solution
convex polyhedra
mixed integer
lower bound
data points
point sets
worst case
training samples
data sets
linear inequalities
extreme points
video sequences
convex sets
computational geometry
image processing