| 摘要 |
PURPOSE:To process graphic data within a short period by entering two graphic data by quartile tree expression and operating them to execute the logical operation processing of two sets of graphic data. CONSTITUTION:At first, graphic forms A, B are entered by quartile tree expression. When each graph is divided into 2<2n> squares, the graphic form can be expressed by a quartile tree consisting of (n+1) hierarchies. However, the depth of 4 hierarchies is not included in all the branches, but cells are not included in the lower hierarchies when there exists a cell indicating the probability of 'black' or 'white'. Thereby, logical operation is applied only to respective cells corresponding to the lowermost hierarchy, i.e. the 4th hierarchy and the operated results are entered to cells in the 4th hierarchy corresponding to the 3rd quartile tree. The 3rd quartile tree corresponds to a graphic form C, but in this stage, only the cells in the 4th hierarchy are defined. Therefore, the 3rd quartile tree is completed on the basis of the cells in the 4th hierarchy.
|
