期刊文献+

三维重构中层次性断层数据的处理技术 被引量:1

Technical treatment of layering cross-sections data in 3D reconstruction
下载PDF
导出
摘要 针对基于层次性断层数据的三维重构,通过引入嵌套矩阵构造嵌套树,再通过构造最小生成树的方法来解决轮廓线相邻层次间的对应问题,并以两轮廓环相互覆盖区域的大小作为约束条件。该方法把基于覆盖的轮廓线对应法和基于全局的轮廓线对应方法结合起来,降低了重构时轮廓拓扑关系判断的复杂性,又能准确的确定轮廓线间的对应关系。 Aiming at 3D reconstruction based on layering cross-sections data, the idea that nested trees are built through the introduction of nested matrix is put forward. Then the minimum spanning tree is constructed in order to resolve the correspondence of contours between two adjacent cross-sections. What is more, while constructing the minimum spanning tree, mutual overlapping area is used as a constraining condition. The method combines the correspondences based on overlapping and that based on global, which not only reduces the complexity of topology judgment but also determines the correspondence of contours accurately.
作者 黄永丽 李晔
出处 《计算机工程与设计》 CSCD 北大核心 2008年第24期6407-6409,共3页 Computer Engineering and Design
基金 河南省自然科学基金项目(0611054800)
关键词 三维重构 嵌套树 嵌套矩阵 最小生成树 拓扑重构 3D reconstruction nested trees nested matrix minimum spanning tree topological reconstruction
  • 相关文献

参考文献6

  • 1石教英,蔡文立编著,科学计算可视化算法与系统[M].北京:科学出版社,1997
  • 2Haig T D.Border marriage:Matching of contours of serial sections[J].IEEE Proceedings,2001,138(5):371-376.
  • 3Ekoule A,Peyrin F, Odet C.A triangulation algorithm from arbitrary shaped multiple planar contours[J].ACM Transactions on Graphics, 1999,10(2): 182-199.
  • 4Bajaj Chaodrajit L.Arbitrary topology shape reconstruction from planar cross-sections [J]. Graphical Models and Image Processing,2003,58(6):524-543.
  • 5Meyers D, Skinner S,Sloan K.Surfaces from contours[J].AcM Trans on Graphics,2000,11 (3):228-258.
  • 6黄永丽,王海玲.三维重构中轮廓线间的连接和光滑问题的处理[J].计算机与数字工程,2006,34(7):45-48. 被引量:2

二级参考文献4

共引文献4

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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