| 基于散乱点云的快速体积计算法 |
| |
| 引用本文： | 胡晓彤,陶森柏.基于散乱点云的快速体积计算法[J].天津科技大学学报,2011,26(1):67-71. |
| |
| 作者姓名： | 胡晓彤 陶森柏 |
| |
| 作者单位： | 天津科技大学计算机科学与信息工程学院,天津,300222 |
| |
| 摘 要： | 三维可视化体积计算基本上都是先由散乱点云构建出表面网格模型,然后基于网格模型计算体积,存在计算量大、速度慢的缺点.针对此问题提出一种快速体积计算法,首先使用改进的增量式Delaunay三角剖分对散乱点云进行四面体剖分;然后利用K近邻计算散乱点的拟合曲面和最小生成树,得到各点的法向量;由各点法向量剔除体外四面体;最后计算各四面体体积之和从而得到总体积.实验表明,该算法不仅保证了计算准确度,而且较传统算法大大提高了效率.
|
| 关 键 词： | 散乱点云 四面体剖分 Delaunay三角剖分 法向量 K近邻 |
Algorithm of Rapid Volume Calculation Based on Scattered Point Cloud |
| |
| HU Xiao-tong,TAO Sen-bai.Algorithm of Rapid Volume Calculation Based on Scattered Point Cloud[J].Journal of Tianjin University of Science & Technology,2011,26(1):67-71. |
| |
| Authors: | HU Xiao-tong TAO Sen-bai |
| |
| Institution: | HU Xiao-tong,TAO Sen-bai(College of Computer Science and Information Engineering,Tianjin University of Science & Technology,Tianjin 300222,China) |
| |
| Abstract: | Visual volume calculation in 3D space basically is based on mesh model nowadays which is constructed from scattered point cloud.It exposes inferiority like huge calculation and low speed when volume is needed only.According to thata,n algorithm of rapid volume calculation was proposed.Firstt,he convex hull of point cloud was subdivided into tetrahedron with improved incremental Delaunay triangulation.Secondf,itting quadric surface and MST of points with KNN were calculated to get normal vectors.Thirdt,hose ... |
| |
| Keywords: | scattered point cloud tetrahedron subdivision Delaunay triangulation normal vector KNN |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
