Login / Signup
On the combinatorial complexity of euclidean Voronoi cells and convex hulls of d-dimensional spheres.
Jean-Daniel Boissonnat
Menelaos I. Karavelas
Published in:
SODA (2003)
Keyphrases
</>
convex hull
computational geometry
euclidean distance
voronoi diagram
feasible solution
data sets
computer graphics
point sets
extreme points
decision trees
reinforcement learning
np hard
linear programming
hyperplane