Symmetry Intelligent Nesting Based on Graph
Jiang Shou-wei · Jisuanji gongcheng · 2008
A novel scheme using the Transitive Closure Graph(TCG) representation is proposed to explore the symmetry solution space in the placement problem, which usually abounds in complex constraints. General-symmetric-feasibility and special-symmetric-feasibility conditions of a TCG representation are used. The proposed TCG symmetry placement algorithm has been tested using several skins of trim. Experimental results show its superiority to both the conventional absolute coordinate representation and the symmetry sequence-pair approaches.