检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]郑州轻工业学院计算机与通讯工程学院,河南郑州450002
出 处:《计算机技术与发展》2006年第8期60-61,65,共3页Computer Technology and Development
摘 要:针对基于层次性断层数据的三维重构,提出了通过引入嵌套矩阵构造嵌套树,然后再通过构造最小生成树的方法来解决轮廓线相邻层次间的对应问题,并以两轮廓环相互覆盖区域的大小作为约束条件。该方法把基于覆盖的对应方法和全局轮廓对应方法结合起来,降低了重构时轮廓拓扑关系判断的复杂性,又能准确地确定轮廓对应关系。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.
分 类 号:TP391.41[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222