Login / Signup

Octagonal and hexadecagonal cut algorithms for finding the convex hull of finite sets with linear time complexity.

Nam-Dung HoangNguyen Kieu LinhHoang Xuan Phu
Published in: Appl. Math. Comput. (2024)
Keyphrases
  • convex hull
  • worst case
  • learning algorithm
  • finite sets
  • image processing
  • dynamic programming
  • mixed integer
  • linearly separable
  • convex polyhedra