Login / Signup
An efficient improvement of gift wrapping algorithm for computing the convex hull of a finite set of points in $\mathbb {R}^{n}$.
Thanh An Phan
Nam-Dung Hoang
Nguyen Kieu Linh
Published in:
Numer. Algorithms (2020)
Keyphrases
</>
convex hull
finite set of points
recursive algorithm
minimum distance
search space
dynamic programming
convex sets
convex polyhedra
simple polygon
np hard
feasible solution
machine learning
extreme points
mixed integer
computational geometry
search algorithm
reinforcement learning
similarity measure