Nonuniform Simplification Algorithm of Unorganized 3D Points
Ling Lei · Jisuanji gongcheng · 2004
A nonuniform simplification algorithm of unorganized 3D points is presented. At first, the min-max box of the data set is divided into cubes with the same size. Then, for each cube with sampled points in it, the local normal change is calculated and thus the cloud points are nonuniformly simplified according to the user-specified normal change threshold. Finally, the experimental results show that the proposed algorithm is effective.