检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]中南大学信息科学与工程学院,长沙410083 [2]湖南农业大学信息科学技术学院,长沙410128
出 处:《计算机辅助设计与图形学学报》2010年第6期984-989,共6页Journal of Computer-Aided Design & Computer Graphics
基 金:国家自然科学基金重大研究计划(90715043);国家自然科学基金(60673093;60803024);湖南省自然科学基金(07JJ3125)
摘 要:针对具有复杂遮挡关系的组合体三视图轮廓搜索不完备的问题,提出基于动态子视图划分的投影轮廓搜索算法.在应用传统角度判别法找出三视图中所有基环后,以基环为线索动态地划分单向子视图并搜索惯性环,对已找到的环进行二元组匹配,依据二元匹配组动态地划分双向子视图并搜索惯性环;从已找到的所有环中搜索基本形体的投影轮廓,通过拉伸或旋转构建基本形体,对基本形体应用正则布尔运算形成三维形体.实验结果表明,该算法可以完备地搜索出构成复杂组合体的基本形体投影轮廓,包括被遮挡的部分,保证了三维重建的正确性.An algorithm based on dynamic division of sub-views is proposed to find out profile loops of complicated three-views of complex solids with some elementary volumes concealed by the others.First,fundamental loops are searched using traditional turn-to-most-left method.Then,inertia loops are searched in unidirectional sub-views,which are divided from orthographic views using the fundamental loops as hints.Finally,bidirectional sub-views are divided using the double-matching-loops generated from the existing loops.The inertia loops are found out in the bidirectional sub-views.Using extrusion or rotation,the elementary volumes are generated from triple-matching-loops constructed from the loops found out previously,and Boolean operations are applied on the elementary volumes to generate the solution solid.Experiments show that the proposed algorithm can effectively and completely find out all profile loops of the elementary volumes of the complex solids,including the obscured ones,which ensures the correctness of the solution solid.
分 类 号:TP391[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.227