The Storage of Tree Data Structure by Gradation and Classification and Application in CAD for Engineering Structure

The traditional storage of tree data structure is according to the relation of the elements' frant-and-back. Since it is difficult to define the frant-and-back relation of graphics units in CAD for Engineering structure, the application of the tree structure becomes inconvenient. The authors change the storing method for the tree structure into gradation and classification. And a graded equivalence relation of graphics units is brought forward, which grade the graphics units with the equivalence relation. By using this storing method, we can easily accomplish some operations, such as picking up the subtree with a certain character, deleting a node, insert a graded and classified node, etc. The example provided indicates that the storage by gradation and classification can speed up searching and process the data of the subtree by gradation and classification expediently. This kind of storing method for the tree structure is applicable for data which contain the graded equivalence relation.

The Storage of Tree Data Structure by Gradation and Classification and Application in CAD for Engineering Structure

The traditional storage of tree data structure is according to the relation of the elements' frant-and-back. Since it is difficult to define the frant-and-back relation of graphics units in CAD for Engineering structure, the application of the tree structure becomes inconvenient. The authors change the storing method for the tree structure into gradation and classification. And a graded equivalence relation of graphics units is brought forward, which grade the graphics units with the equivalence relation. By using this storing method, we can easily accomplish some operations, such as picking up the subtree with a certain character, deleting a node, insert a graded and classified node, etc. The example provided indicates that the storage by gradation and classification can speed up searching and process the data of the subtree by gradation and classification expediently. This kind of storing method for the tree structure is applicable for data which contain the graded equivalence relation.