An efficient improvement of gift wrapping algorithm for computing the convex hull of a finite set of points in $\mathbb {R}^{n}$

An, Phan Thanh; Hoàng, Nam Dũng; Linh, Nguyen Kieu

doi:10.1007/s11075-020-00873-1

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

hi@scite.ai

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

An efficient improvement of gift wrapping algorithm for computing the convex hull of a finite set of points in $\mathbb {R}^{n}$

Cited by 3 publications

References 22 publications

A modified Graham’s convex hull algorithm for finding the connected orthogonal convex hull of a finite planar point set

A modified Graham’s convex hull algorithm for finding the connected orthogonal convex hull of a finite planar point set

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

Regular 2k-Directional Polygon Algorithm for Finding the Convex Hulls of big data sets in 2D

Contact Info

Product

Resources

About