首页> 外文期刊>Journal of computational methods in sciences and engineering >Simplification algorithm of denture point cloud based on feature preserving
【24h】

Simplification algorithm of denture point cloud based on feature preserving

机译:基于特征保留的义齿点云简化算法

获取原文
获取原文并翻译 | 示例
获取外文期刊封面目录资料

摘要

Due to the point cloud of oral scan denture has a large amount of data and redundant points. A point cloud simplification algorithm based on feature preserving is proposed to solve the problem that the feature preserving is incomplete when processing point cloud data and cavities occur in relatively flat regions. Firstly, the algorithm uses kd-tree to construct the point cloud spatial topological to search the k-Neighborhood of the sampling point. On the basis of that to calculate the curvature of each point, the angle between the normal vector, the distance from the point to the neighborhood centroid, as well as the standard deviation and the average distance from the point to the neighborhood on this basis, therefore, the detailed features of point cloud can be extracted by multi-feature extraction and threshold determination. For the non-characteristic region, the non-characteristic point cloud is spatially divided through Octree to obtain the K-value of K-means clustering algorithm and the initial clustering center point. The simplified results of non-characteristic regions are obtained after further subdivision. Finally, the extracted detail features and the reduced result of non-featured region will be merged to obtain the final simplification result. The experimental results show that the algorithm can retain the characteristic information of point cloud model better, and effectively avoid the phenomenon of holes in the simplification process. The simplified results have better smoothness, simplicity and precision, and are of high practical value.
机译:由于口腔扫描的点云,义齿具有大量的数据和冗余点。针对处理点云数据时特征保留不完整,在相对平坦区域出现空洞的问题,提出了一种基于特征保留的点云简化算法。首先,该算法利用kd-tree构建点云空间拓扑,搜索采样点的k-Neighborhood;在此基础上计算各点的曲率、法向量之间的夹角、点到邻域质心的距离,以及点到邻域的标准差和平均距离,从而通过多特征提取和阈值确定来提取点云的详细特征。对于非特征区域,通过Octree对非特征点云进行空间划分,得到K-means聚类算法的K值和初始聚类中心点。进一步细分后得到非特征区域的简化结果。最后,将提取的细节特征与非特征区域的简化结果进行合并,得到最终的简化结果。实验结果表明,该算法能够较好地保留点云模型的特征信息,有效避免了简化过程中的空洞现象。简化结果具有较好的平滑性、简单性和精确性,具有较高的实用价值。

著录项

获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号