螺旋刺绣路径的连接及优化

Path Linking and Optimization in Spiral Embroidery

首先将刺绣区域划分成拓扑连续的环域,根据环域之间的相互包含关系将它们组织成一个二叉树;然后通过遍历该二叉树来确定各环域的连接顺序,对需要穿越的环域将生成一条纵向连接路径;最后选择各环域的进出点来生成优化的横向连接路径.实验结果表明:生成的路径能满足螺旋刺绣的基本要求和优化要求.

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.