检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]清华大学自动化系,北京100084
出 处:《计算机辅助设计与图形学学报》2006年第7期1022-1027,共6页Journal of Computer-Aided Design & Computer Graphics
摘 要:首先将刺绣区域划分成拓扑连续的环域,根据环域之间的相互包含关系将它们组织成一个二叉树;然后通过遍历该二叉树来确定各环域的连接顺序,对需要穿越的环域将生成一条纵向连接路径;最后选择各环域的进出点来生成优化的横向连接路径.实验结果表明:生成的路径能满足螺旋刺绣的基本要求和优化要求.The whole embroidery region is first decomposed into a series of closed loops and organized into a bintree according to the inclusion relationships among loops. The loops are then linked together in an order conforming to the sequence of bintree traversal. Loops being cut through are connected by longitudinal linking paths, while latitudinal linking paths are generated to fulfil tool paths transit from the optimally choosen exit point of a loop to the entry point of its adjacent loop. Experiments show that the proposed approach is feasible and effective.
分 类 号:TP391[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.169