四分樹加速搜尋法應用於電腦刺繡路徑規劃

• Main Authors: Chih-Chiang Huang, 黃智強
• Other Authors: Wen-Yuan Chen
• Format: Others
• Language: zh-TW
• Published: 2016
• Online Access: http://ndltd.ncl.edu.tw/handle/88462854896309716103

碩士 === 國立勤益科技大學 === 電子工程系 === 104 === The goals of the develpoment of computerized embroidery machine are high-speed and multi-color. Reducing the number of jumpers could help to decrease the amount of thread. Therefore, this study would improve the problems of EZDesign Computer sewing such as embroidery jumper path, huge number and far distance. Algorithm is developed in MATLAB. Firstly, PISD is used to conduct the division of color because it is superior to the FGFCM with the rate of 92%. The method of Quad-Tree accelerating searching is used to search for the jumper coordinates between blocks. And comparing with the Based approach, it decreases the average of 87% on computing time. And then the results of using ACO and GA to carry out the path sort order compare with the results of EZDesign analog path, it is shown that 61.32% of jumpers are reduced.