摘要
针对基于层次性断层数据的三维重构,提出了通过引入嵌套矩阵构造嵌套树,然后再通过构造最小生成树的方法来解决轮廓线相邻层次间的对应问题,并以两轮廓环相互覆盖区域的大小作为约束条件。该方法把基于覆盖的对应方法和全局轮廓对应方法结合起来,降低了重构时轮廓拓扑关系判断的复杂性,又能准确地确定轮廓对应关系。
Aims at 3D reconstruction based on layering cross- sections data. It puts forward the idea that nested trees are built through the introduction of nested matrix. Then the minimum spanning tree is oonstructed in order to resolve the oorrespondence 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.
出处
《计算机技术与发展》
2006年第8期60-61,65,共3页
Computer Technology and Development
关键词
三维重构
嵌套树
嵌套矩阵
最小生成树
3D reconstruction
nested trees nested rnatrixlminimum spanning tree