Abstract

On the basis of the concept of right-shell-tree and left-shell-tree, a fast convex hull algorithm for scattered points based on a binary tree is put forward. It can dynamically reduce the scale of scattered point rapidly by removing a number of non-convex hull vertexes while finding each convex hull vertex. Normally, it can achieve linear time complexity. The algorithm obviates the judging process of the convex hull vertices' connected relation. It is applicable to any complex scattered points, and simple and easy to achieve.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.