Open AccessA Quick Convex Hull Building Algorithm Based on Grid and Binary Tree
Author(s) -
Gao Yang,
Cheng Yuhu,
Wang Xuesong
Publication year - 2015
Publication title -
chinese journal of electronics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.267
H-Index - 25
eISSN - 2075-5597
pISSN - 1022-4653
DOI - 10.1049/cje.2015.04.015
Subject(s) - convex hull , binary tree , regular polygon , algorithm , hull , binary number , grid , tree (set theory) , computer science , convex combination , mathematics , convex optimization , combinatorics , geometry , materials science , arithmetic , composite material
A quick convex hull building algorithm using grid and binary tree is proposed for the minimum convex buidling of planar point set. Grids are used to assess and eliminate those interior points wihtout any contribution to convex hull building and points are sought in the boundary grid only so as to enhance the efficiency of algorithm. The minimum convex bull is built by taking such advantages of binary tree as quick, convenient and applicable for various point sets with different distributions, so as to resolve the description problem of concave point. The time complexity of the algorithm is low because of grid pre treatment. As the results of comparative expriment of random point and actual picture show, the proposed algorithm can obtain the best profile of 2D planar picture with minimum time, which is applicable for describing the shape of irregular convex‐concave objects.