One novel slicing triangulation algorithm was proposed, which dose not need manual intervention and can triangulate both overlapping and non-overlapping points cloud highly efficiently. The algorithm contains two main stages: points cloud preprocessing and triangulation. In preprocessing phase, the information of KNN、vector and shape index are extracted from points’ location information; In triangulation stage, if one new basis point is picked out, one new patch will be created based on the orientation angle between the basis point and each other unprocessed point, then the patch is projected onto the basis point’s tangent plane and triangulated, after verifying triangles in 3D space, the triangulation results of the patch are saved. Final triangulation results are output until there is no new basis point available. The experiment results confirm the proposed algorithm is effective and highly-efficient.
