Displaying an image based on layers of a layer tree
An image is generated by: mutually associating an object associated with image data as a tree structure that has the object as a node; allocating an order value to a child node group of each parent node; distributing image data of an object of interest to a layer on the basis of the depth of the tree structure and the order value allocated to each node in a subtree going up from a node corresponding to the object of interest to a root node; and superimposing the layers.
1. A non-transitory computer-readable storage medium storing an image processing program which causes a computer to perform operations, the operations comprising:
referring to an object database stored within a storage unit of the computer, the object database including objects associated with image data that are mutually associated as a tree structure having an object as a node and order values allocated to a child node group of each parent node of the tree structure;
distributing image data of an object of interest to a layer on a basis of a depth of a tree structure and an order value allocated to each node in a subtree going up from a node corresponding to the object of interest to a root node; wherein distributing the image data includes:
distributing image data of objects having a layer value L within a predetermined range to the same layer, the layer value L of the objects being calculated using the following formula:
L
=
A
·
∑
i
=
0
k
X
i
·
B
-
i
where “i” denotes a depth of a node, “X i ” denotes an order value of a node having a depth equal to “i”, each of “A” and “B” denotes a constant, and “k” denotes a depth of the node corresponding to the object of interest; and
generating an image by superimposing the layers.
2. The non-transitory computer-readable storage medium of claim 1 , wherein the constant B has a value greater than the maximum value of the order value.
3. The non-transitory computer-readable storage medium of claim 1 , wherein the constant A satisfies a relationship represented by:
A
≦
L
max
(
∑
i
=
0
k
X
i
·
B
-
i
)
max
where “Lmax” denotes the maximum number of layers to be processed and “(ΣX i ·B −i ) max” denotes the maximum value of “ΣX i ·B −i ”.
4. The non-transitory computer-readable storage medium of claim 1 ,
wherein the order values are changed dynamically.
5. The non-transitory computer-readable storage medium of claim 1 ,
wherein an attribute value of an object is allocated to a parent node of the tree structure, and a child node group of each parent node is formed of an object group having a common attribute value.
6. The non-transitory computer-readable storage medium of claim 5 ,
wherein the attribute value includes a background, a character, or an HUD.
7. A method performed by an image processing device, the method comprising:
referring to an object database stored within a storage unit of the computer, the object database including objects associated with image data that are mutually associated as a tree structure having an object as a node and order values allocated to a child node group of each parent node of the tree structure;
distributing image data of an object of interest to a layer on a basis of a depth of a tree structure and an order value allocated to each node in a subtree going up from a node corresponding to the object of interest to a root node; wherein distributing the image data includes:
distributing image data of objects having a layer value L within a predetermined range to the same layer, the layer value L of the objects being calculated using the following formula:
L
=
A
*
∑
i
=
0
k
X
i
*
B
-
i
where “i” denotes a depth of a node, “X i ” denotes an order value of a node having a depth equal to “i”, each of “A” and “B” denotes a constant, and “k” denotes a depth of the node corresponding to the object of interest; and
generating an image by superimposing the layers.
8. The method of claim 7 , wherein the constant B has a value greater than the maximum value of the order value.
9. The method of claim 7 , wherein the constant A satisfies a relationship represented by:
A
≦
L
max
(
∑
i
=
0
k
X
i
*
B
-
i
)
max
where “Lmax” denotes the maximum number of layers to be processed and “(ΣX i ·B −i ) max” denotes the maximum value of “ΣX i ·B −i ”.
10. The method of claim 7 , wherein the order values are changed dynamically.
11. The method of claim 7 , wherein an attribute value of an object is allocated to a parent node of the tree structure, and a child node group of each parent node is formed of an object group having a common attribute value.
12. The method of claim 11 , wherein the attribute value includes a background, a character, or an HUD.