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. An efficient improvement of gift wrapping algorithm for computing the convex hull of a finite set of points in $\mathbb {R}^{n}$. Numerical Algorithms, 85(4):1499-1518, 2020. [doi]

@article{PhanHL20,
  title = {An efficient improvement of gift wrapping algorithm for computing the convex hull of a finite set of points in $\mathbb {R}^{n}$},
  author = {Thanh An Phan and Nam-Dung Hoang and Nguyen Kieu Linh},
  year = {2020},
  doi = {10.1007/s11075-020-00873-1},
  url = {https://doi.org/10.1007/s11075-020-00873-1},
  researchr = {https://researchr.org/publication/PhanHL20},
  cites = {0},
  citedby = {0},
  journal = {Numerical Algorithms},
  volume = {85},
  number = {4},
  pages = {1499-1518},
}