| 摘要 |
PURPOSE:To form the tree structure data of an object to be displayed with small data capacity by recursively repeating processing for dividing a divided space in which the calculated degree of complexity is a prescribed threshold or more into the prescribed number of divided spaces. CONSTITUTION:A cube including the whole object is set and processing is executed by defining the cube as the initial octant. Namely, the degree of complexity in the octant is regulated, and when the degree of complexity in the octant is a threshold K or less, a terminal (T) node is formed, pointers to all information groups expressing the state in the octant are set as the data of the node and then division is stopped. When the degree of complexity in the octant is the K or more, an unresolved (U) node is formed and eight octants set up that the length of each side is 1/2 the length of the sides of the original octant. Thus, the processing of respective octants is recursively repeated to form tree structure data. Provided that K is a constant parameter.
|
