期刊文献+

面向四面体网格生成的Delaunay refinement器官表面重建 被引量:1

Organ Surface Re-meshing Based on Delaunay Refinement from Tetrahedralization
下载PDF
导出
摘要 为满足生物医学仿真系统对器官几何模型在Delaunay表面重构和四面体建模两方面的需求,提出一种面向四面体网格生成的Delaunay refinement表面重构算法.算法将从医学体数据中经过等值面提取和简化的初始表面作为输入和边界限定条件,为每个限定点计算局部特征尺寸并构建保护球,计算保护球与限定线段的交点并与限定点一起作为初始点集,生成Delaunay辅助四面体网格,引入一个迭代细分过程恢复边界,最终获得Delaunay重构表面.针对细分过程中的收敛性问题,文中给出了详细的理论证明和算法实例.此外,通过Delaunay四面体生成的对比实验表明该算法在Delaunay器官表面重构和四面体建模两方面兼具有效性和优越性. To meet the Delaunay surface triangle modeling and Delaunay tetrahedral modeling for medical simulation,a novel Delaunay refinement re-meshing algorithm was presented based on original organ surface from medical volume data.Firstly,the vertex protecting balls were constructed based on vertex local feature size,initial auxiliary tetrahedral mesh was generated by the vertices and points of intersection between protecting balls and boundary segments.Secondly,the boundary was recovered by iterative refinements and the new surface was constructed leaving the boundary triangles only.Aiming to prove the convergence of the algorithm,a certification was presented in detail and some experiment was also given out to prove the effectiveness.
出处 《小型微型计算机系统》 CSCD 北大核心 2012年第8期1816-1820,共5页 Journal of Chinese Computer Systems
基金 国家"八六三"高技术研究发展计划项目(2007AA022008)资助
关键词 DELAUNAY REFINEMENT 器官表面重构 局部特征尺寸 收敛性 delaunay refinement organ surface re-meshing local feature size convergence
  • 相关文献

参考文献3

二级参考文献37

  • 1段宝山,潘振宽.医学断层图像三维重建的辅助轮廓线法[J].计算机辅助设计与图形学学报,2005,17(8):1862-1866. 被引量:16
  • 2孙伟,张彩明,杨兴强.Marching Cubes算法研究现状[J].计算机辅助设计与图形学学报,2007,19(7):947-952. 被引量:25
  • 3Wang Z L,Teo J C M,Chui C K,et al.Computational biomechanical modelling of the lumbar spine using marching-cubes surface smoothened finite element voxel meshing[J].Computer Methods and Programs in Biomedicine.2005,80(1):25-35.
  • 4Nielson G M,Sung J.Interval volume tetrahedrization[C] //Proceedings of the 8th Conference on Visualization.Washington D C:IEEE Computer Society Press.1997:221-228.
  • 5Shewchuk J R.Constrained Delaunay tetrahedralizations and provably good boundary recovery[C] //Proceedings of the 11th International Meshing Roundtable.New York:Springer.2002:193-204.
  • 6Du Q,Wang D S.Recent progress in robust and quality Delaunay mesh generation[J].Journal of Computational and Applied Mathematics.2006.195(1):8 -23.
  • 7Bowyer A.Computing Dirichlet tessellations[J].The Computer Journal.1981,24(2):162-166.
  • 8Watson D F.Computing the n-dimensional Delaunay tessellation with application to Voronoi polytopes[J].The Computer Journal.1981,24(2):167-172.
  • 9Chand D R,Kapur S S.An algorithm for convex polytopes[J].Journal of the ACM.1970,17(1):78-86.
  • 10Lawson L C.Software for C^1 surface interpolation[M] //Rice J.Mathematical Software Ⅲ.New York:Academic Press.1977:161-194.

共引文献11

同被引文献4

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部