To simplify the point cloud while preserving small features
a novel algorithm based on clustering is proposed. The whole point could is divided into a series of initial sub-clusters with the 3-D grid subdivision method
and in each initial sub-cluster one representative point is selected as the centroid. The points other than those representatives are distributed to their nearest initial sub-cluster centroids according to Euclidean distance
and new clusters are generated. Traversing all new formed clusters
if the normal vector deviation of any two inner points is greater than the given threshold
the cluster is necessarily subdivided
then each cluster is processed iteratively by mean shift to obtain the local mode points
which are adopted to substitute the clusters. Some typical cases with various surface features
such as mobile shell
human-head sculpture and twisted drill
are chosen to verify this method. The result indicates that the new algorithm enables to reduce data directly and efficiently while maintaining the geometry of the original model
especially for the surfaces with sharp edges and complex additional features.
关键词
Keywords
references
LEE K H, WOO H, SUK T. Point data reduction using 3D grids [J]. Advanced Manufacturing Technology, 2001,18:201-210.
SONG H, FENG H Y. A global clustering approach to point cloud simplification with a specified data reduction ratio [J]. Computer-Aided Design, 2008,40:281-292.
HONG Jun, DING Yucheng, CAO Liang, et al. Data cloud direct reduction in reverse engineering [J]. Journal of Xi'an Jiaotong University, 2004,38(7):661-664.
WANG Renfang, ZHANG Sanyuan, YE Xiuzi. Similarity-based simplification of point sampled surfaces [J]. Journal of Zhejiang University, 2009,43(3):448-454.
COMANICIU D, MEER P. Mean shift: a robust approach toward feature space analysis [J]. IEEE Trans Pattern Analysis and Machine Intelligence, 2002, 24(5):603-619.
FUKUNAGA K, HOSTETLER L. The estimation of the gradient of a density function, with applications in pattern recognition [J]. IEEE Trans Info Theory, 1975,21:32-40.
BENTLEY J L. Multidimensional binary search trees used for associative searching [J]. Communications of the ACM, 1975,18(9):509-517.