| 摘要 |
PROBLEM TO BE SOLVED: To divide an arbitrary graphic so that the divided areas can be made as uniform as possible. SOLUTION: An objective area to be divided and the number of division N are designated (a step S11). The total number of pixels Total occupying the objective area is obtained (a step S12). A parameter k is initialized into 1 (a step S13), and an ideal value St[k] of the k-th divided area Sk is calculated (a step S14). A decided value Sd[k] of the number of pixels of the k-th section Sk is decided based on the ideal value St[k] (a step S15). |
