2009•Computer-aided engineeringRequires access
Improved algorithm on determining convex hull of 3D point set
Zheng Liu
Open publisher page 0 citations
Abstract
To improve the computation efficiency of convex hull of 3D point set,an improved algorithm on determining convex hull of 3D point set is proposed by making full use of the extreme points and the character of the convex hull.Firstly,the extreme points in 3D point set are obtained to make up of the initial convex hull.Secondly,the internal points of the convex hull are eliminated according to the position relationship between the initial convex hull and the points.Finally,the external points are examined in turn,the point set,line set and face set that meet the requirements are acquired,and the convex hull is expanded to obtain the final point set,line set and face set of the convex hull.The comparison of time complexity analysis with normal algorithms and the experiments indicate that the algorithm has higher efficiency.