关键词: k-邻域, 离散点云, 点云密度, 点云简化, 三角网格重构

Abstract:

This paper presents a simplification method for scattered point cloud based on the density of the points in k-nearest neighbors as well as a concrete algorithm and the effect of its implementation on triangulation. This method ensures that reconstruction of triangular mesh maintains the figure contour of an object, but also does well on the details of a local part. The examples show that the method in this paper is easy to implement, and holds high efficiency. Meanwhile, this method holds satisfied effect on the smoothness part, even on the part where the curvature varies greatly.

Key words: k-nearest neighbors, scattered point cloud, density of point cloud, simplification of point cloud, reconstruction of triangular mesh