| 摘要 |
<P>PROBLEM TO BE SOLVED: To efficiently and automatically find a packing inclusion circle satisfying a desired wire arrangement condition. <P>SOLUTION: A plurality of wire arrangement conditions are set (T1), a plurality of wires are initially arranged at random so as not to overlap mutually (T3) by repeating a predetermined number of trials, and in every initial arrangement, a packing inclusion circles for a plurality of wires is found while information about the packing inclusion circle and its position are computed (T5). Based on the information about the positions of a plurality of circles, it is determined whether the arrangement condition is satisfied or not (T6). Only when it is determined that the arrangement condition is satisfied, the information about the packing inclusion circle and the positions of a plurality of circles is displayed and outputted (T7). <P>COPYRIGHT: (C)2005,JPO&NCIPI |
