In this paper, we present an efficient improvement of gift wrapping algorithm for determining the convex hull of a finite set of points in \(\mathbb {R}^{n}\) space, applying the best restricted area technique inspired from the Method of Orienting Curves (this method was used successfully in computational geometry by An and Trang in Numerical Algorithms 59, 347–357 (2012), Optimization 62, 975–988 (2013)). The numerical experiments on the sets of random points in two- and three-dimensional space show that the running time of our algorithm is faster than the gift wrapping algorithm and the newest modified one.

中文翻译：

---

礼品包装算法的高效改进，用于计算ℝn $ \ mathbb {R} ^ {n} $中有限点集的凸包

在本文中，我们提出了一种礼物包装算法的有效改进，该方法使用了从方法启发而来的最佳限制区域技术来确定\（\ mathbb {R} ^ {n} \）空间中一组有限点的凸包定向曲线的（被成功地用于在由和庄计算几何在该方法中数值算法 59，347-357（2012），优化 62，975-988（2013））。在二维和三维空间中的随机点集上的数值实验表明，我们的算法的运行时间比礼品包装算法和最新的改进算法快。