| 摘要 |
PURPOSE:To evade the increase of an arithmetic overhead at the subsequent processing stages by detecting the existence of a cycle, dividing the original line within a cycle and destroying the cycle. CONSTITUTION:When a cycle is destroyed, the cycle is destroyed by dividing polygons (original lines) and preparing plural 'slave' polygons. If the new present most likely polygon which is already entered in a stack is going to be fed in the stack, it proves that the cycle clearly exists and a processing for destroying the cycle must be executed. Then, whether the new present most likely polygon already exists in the stack or not and whether the cycle exists or not are judged (S133). If the result of the judgment is positive, the cycle exists. Therefore, the destruction of the cycle is tried. As a result, the success of the cycle destruction is made. Thus, the increase of an arithmetic overhead at the subsequent processing stages can be efficiently evaded. |
