KR101637233B1 - Data processing method for converting tree structure to 3 dimensional structure and computer readable recording medium thereof - Google Patents

Abstract

A data processing method for converting a tree structure into a 3D structure comprises: a step for receiving data related to the tree structure including a plurality of nodes; a step for determining each 3D position coordinate of the nodes included in the tree structure; and a step for displaying the nodes on a 3D coordinate system based on the determined position coordinate. The nodes excluding a root node and a leaf node are circularly arranged on a same level according to an occupation angle arranged to a corresponding node. The occupation angle assigned to each node on the same level is determined by the number of child nodes. Therefore, the complex tree structure having levels and nodes is intuitionally displayed on the 3D.

Description

TECHNICAL FIELD [0001] The present invention relates to a data processing method for converting a tree structure into a three-dimensional format, and a computer readable recording medium storing a program for the same. BACKGROUND OF THE INVENTION [0001]

The present invention relates to a data processing method for transforming a tree structure into three dimensions and a computer-readable recording medium storing a program therefor. More particularly, the present invention relates to a data processing method for converting a tree structure into a three- Dimensional space, and the like.

Recently, due to the complexity and size of the organization, there has been an increasing demand for a conceptual diagram in which a plurality of nodes are formed in a top-down relationship such as an organization chart, a group relationship of a head office and affiliates. As a data structure for representing this vertical relationship, a tree structure that shapes a tree is generally used.

1 is a diagram illustrating a general tree structure 1000. Referring to FIG. 1, a root node 101 exists at a level 1 and another node 201, 211, 221, 301, 302 , ..., 321, 322, 323, 324, 401, 402, 403, and 404). For the root node 101, the nodes 201, 211, and 221 may be child nodes, and the root node 101 may be a parent node of the nodes 201, . The child nodes 201, 211, and 221 may have child nodes existing at level 3. Of the level 3 child nodes, only node 321 has child nodes at level 4, and the remaining nodes have no child nodes. A node without a child node can be named as a leaf node. In the illustrated tree structure, there are 12 leaf nodes at level 3 and one node 321 that is not a leaf node. In FIG. 1, the leaf node is a circular marker, and the nodes other than the leaf nodes, i.e., the parent nodes are shown as square marks. At level 4, there are four leaf nodes. That is, in the tree structure of FIG. 1, there are 16 total leaf nodes, and exist at level 3 and level 4. Also, among the nodes of the same level, the same node is called a sibling node. In the tree structure of FIG. 1, nodes of level 2 are all sibling nodes. However, a node of level 3 is not a sibling node, since the parent node exists in other nodes. For example, node 301 and node 303 are sibling nodes, but node 301 and node 312 are not sibling nodes.

As shown in FIG. 1, when the tree structure is displayed on a two-dimensional plane, the greater the depth of the tree structure, that is, the size of the highest level of the tree, or as the number of child nodes for the node increases, The area becomes enormous and complicated. That is, there is a limitation in expressing a tree structure that is complex and likely to change with limited resources.

The present invention is intended to provide a data processing method capable of expressing a tree structure such that nodes do not overlap within a resource limited to three dimensions.

The present invention is to provide a data processing method for arranging circles on the same level at different occupancy angles according to the number of child nodes of each node.

According to an embodiment of the present invention, there is provided a data processing method for converting a tree structure into a three-dimensional format, comprising: receiving data regarding a tree structure composed of a plurality of nodes; Determining three-dimensional position coordinates of nodes included in the tree structure; Among the nodes, the nodes other than the root node and the leaf node are arranged in a circle on the same level according to the occupancy angle assigned to the corresponding node, Determined in proportion to the number of nodes; And displaying the nodes in a three-dimensional coordinate system based on the determined position coordinates.

In one embodiment, determining each of the three-dimensional position coordinates of the nodes included in the tree structure comprises: determining a level interval and a radius for each level; Determining a location of a root node; Determining y coordinates of nodes included in the tree structure based on the position and level interval of the root node; Determining an occupancy angle of each node; And determining an x coordinate and a z coordinate of the nodes included in the tree structure, respectively, based on the determined occupancy angle and the radius according to the level.

In one embodiment, the occupancy angle assigned to the node may be determined by: < EMI ID = 1.0 >

…………………………… (수식 1)

... ... ... ... ... ... ... ... ... ... ... (Equation 1)

(Where _mn is the occupancy angle of the n-th node at the m-th level, c _mn is the number of child nodes of the n-th node at the m-th level, c _{m +} Number.)

According to another embodiment of the present invention, there is provided a data processing method for converting a tree structure into a three-dimensional format, comprising: receiving data regarding a tree structure composed of a plurality of nodes; Determining an occupancy angle of nodes included in the tree structure based on the number of child nodes; Determining coordinates of nodes included in the tree structure based on the determined occupancy angle; And displaying the nodes in a three-dimensional coordinate system based on the determined position coordinates.

In one embodiment, in the step of determining the occupancy angle of the nodes included in the tree structure, the occupancy angle of nodes having no leaf node can be determined by the following equation (1).

…………………………… (수식 1)

... ... ... ... ... ... ... ... ... ... ... (Equation 1)

(Where _mn is the occupancy angle of the n-th node at the m-th level, c _mn is the number of child nodes of the n-th node at the m-th level, c _{m +} Number.)

In one embodiment, in the step of determining the occupancy angle of the nodes included in the tree structure, the occupancy angle of the leaf node among the nodes having the leaf node can be determined by the following equation (2).

…………………………… (수식 2)

... ... ... ... ... ... ... ... ... ... ... (Equation 2)

(Where, θ is occupied _ml each, c _ml of m-th level of the leaf node is the total number of nodes of the m number of the second-level leaf nodes, c _{m + 1} is m + 1-th level.)

In one embodiment, in determining the occupancy angle of the nodes included in the tree structure, an occupancy angle of a node other than a leaf node among nodes having a leaf node may be determined according to Equation (3) have.

……………………… (수식 3)

... ... ... ... ... ... ... ... ... (Equation 3)

(Where, θ _mk, m occupy each of the k th node in the second level non-leaf nodes, c _ml are m number of the second-level leaf nodes, c _{m + 1} are m + 1 total number of nodes in the second level, c _mk Is the number of child nodes of the k-th node that is not the leaf node of the m-th level.)

In one embodiment, in the step of determining an occupancy angle of nodes included in the tree structure, an occupancy angle of a node having only a leaf node can be determined by the following equation (4).

…………………………… (수식 4)

... ... ... ... ... ... ... ... ... ... ... (Equation 4)

(Here, θ _p is the occupancy angle of the node having the leaf node only level, and c _p is the node number of the leaf node only level.)

In one embodiment, in the step of determining an occupancy angle of nodes included in the tree structure, an occupancy angle of a node having a leaf node can be determined by the following equation (5).

…………………………… (수식 5)

... ... ... ... ... ... ... ... ... ... ... (Equation 5)

(Where θ _f is the occupancy angle of the node with the level of the leaf node, and c _f is the number of nodes at the level with the leaf node).

In one embodiment, the step of displaying the nodes in a three-dimensional coordinate system based on the determined position coordinates comprises: displaying the nodes on respective determined position coordinates; And displaying the parent-child relationship of each node in a line.

In one embodiment, determining the coordinates of the nodes included in the tree structure based on the determined occupancy angle comprises: determining y coordinates of the nodes; Determining an x coordinate of each node according to Equation (6); And determining the z coordinate of each node by: < EMI ID = 7.0 >

…………………………… (수식 6)

... ... ... ... ... ... ... ... ... ... ... (Equation 6)

…………………………… (수식 7)

... ... ... ... ... ... ... ... ... ... ... (Equation 7)

(Here, x _n is the n-th x-coordinate of the node, z _n the n-th node, z coordinate, r is radius, θ _n is n occupy the second node each, θ ₀ in level by level initial angle.)

According to another embodiment of the present invention, there is provided a computer-readable recording medium having recorded thereon an electronic code for executing a data processing method for displaying a tree structure in a three-dimensional format on a computer, And determines the three-dimensional position coordinates of the nodes included in the tree structure, and determines the three-dimensional position coordinates of the nodes included in the tree structure, excluding the root node and the leaf node, Wherein an occupancy angle allocated to each node on the same level is determined in proportion to the number of child nodes, and wherein the occupancy angle of each node is determined based on the determined position coordinates, Execute the operation to display in the dimensional coordinate system on the computer.

In one embodiment, the occupancy angle assigned to the node may be determined by: < EMI ID = 1.0 >

…………………………… (수식 1)

... ... ... ... ... ... ... ... ... ... ... (Equation 1)

(Where _mn is the occupancy angle of the n-th node at the m-th level, c _mn is the number of child nodes of the n-th node at the m-th level, c _{m +} Number.)

According to the present invention, the tree structure can be expressed such that nodes do not overlap within a resource defined by three dimensions.

According to the present invention, it is possible to arrange circles on the same level at different occupancy angles according to the number of child nodes of each node.

Thus, a complex tree structure with many levels and nodes can be intuitively displayed on three dimensions.

1 is a diagram for explaining a general tree structure.
FIG. 2 is a diagram showing the tree structure of FIG. 1 in three dimensions according to an embodiment of the present invention.
FIG. 3 is a plan view of the three-dimensional nodes shown in FIG. 2 in the y direction.
4A is a diagram showing a root node among the nodes shown in FIG.
FIG. 4B is a view for explaining a method of determining an occupancy angle of nodes of level 2 among the nodes shown in FIG. 3. FIG.
FIG. 4C is a diagram for explaining a first embodiment for determining an occupancy angle of nodes of level 3 among the nodes shown in FIG. 3. FIG.
FIG. 4D is a diagram for explaining a second embodiment for determining an occupancy angle of nodes of level 3 among the nodes shown in FIG. 3. FIG.
FIG. 4E is a view for explaining the first embodiment for determining the occupancy angle of nodes of level 4 among the nodes shown in FIG. 3. FIG.
FIG. 4F is a diagram for explaining a first embodiment for determining an occupancy angle of nodes of level 4 among the nodes shown in FIG. 3. FIG.
FIG. 5 is a diagram for explaining a method for determining the position of the nodes shown in FIG. 2 in the y-axis direction.
6 is a diagram for explaining a method for determining a position of a node on an xz plane based on a determined occupancy angle.
7 is a diagram showing an example of a data processing method for converting a tree structure into a three-dimensional format according to an embodiment of the present invention.
FIG. 8 is a diagram illustrating an example of a method for determining three-dimensional position coordinates of nodes included in a tree structure in the method of FIG.
9A is a diagram showing a first embodiment of a method for determining an occupancy angle of nodes included in a tree structure in the method of FIG.
FIG. 9B is a diagram showing a second embodiment of a method for determining an occupancy angle of nodes included in a tree structure in the method of FIG. 8. FIG.

Hereinafter, preferred embodiments of the present invention will be described in detail with reference to the accompanying drawings. Note that, in the drawings, the same components are denoted by the same reference symbols as possible. In the following description, only parts necessary for understanding the operation according to the present invention will be described, and descriptions of other parts will be omitted in order to avoid obscuring the gist of the present invention. Further, the present invention is not limited to the embodiments described herein but may be embodied in other forms. It is to be understood, however, that the invention may be embodied in many other specific forms without departing from the spirit or essential characteristics thereof.

FIG. 2 is a diagram showing the tree structure of FIG. 1 in three dimensions according to an embodiment of the present invention.

Referring to Fig. 2, there is shown a perspective view 2000 of the tree structure of Fig. 1 displayed on three dimensions. At the top of the tree structure, the root node 101 of level 1 is shown and the nodes 201, 211 and 221 of level 2 are shown at the bottom of the root node 101. In FIG. 2, the leaf node is a circular marker, and the nodes other than the leaf nodes, i.e., the parent nodes are shown as square marks. In addition, levels 3 nodes are shown at the lower level nodes 201, 211, and 221, and levels 4 nodes are shown at the lower level. For convenience of illustration, the reference symbols of the nodes other than the node 321 among the nodes of the level 3 and the nodes of the level 4 are omitted. However, the nodes of the tree structure shown in FIG. 2 and the parent-child relationship are the same as the tree structure of FIG.

Referring to FIG. 2, nodes having the same level have the same y-coordinate. Also, if the level is different, the y-coordinate changes. The nodes other than the root node 101 are arranged on the same circumference as the nodes of the same level. In the illustration of Fig. 2, the radius of the circumference in which the nodes are located varies from level to level. In Fig. 2, as the level increases, i. E. The y coordinate decreases, the radius of the circumference where the nodes are located increases. The radius of the circumference where the nodes of level 3 (..., 321, ...) are arranged is larger than the radius of the circumference of the circumference where the nodes of level 2 201, 211, 221 are arranged. Also, in the embodiment of FIG. 2, the radius of the circumference, which increases as the level increases, is shown to increase in proportion to the level size. That is, the radius of the circumference where the nodes of level 3 are arranged is twice the radius of the circumference where the nodes of level 2 are arranged, and the radius of the circumference where the nodes of level 4 are arranged is the radius of the circumference It is three times.

Also, in FIG. 2, as the level increases, the intervals of the y coordinates at which the nodes are arranged are shown to be the same. In other words, the y coordinate difference between the level 1 node 101 and the level 2 nodes 201, 211, 221 is the level 2 nodes 201, 211, 221 and the level 3 nodes ... 321 , ...). The difference in y coordinate between the level 2 nodes 201, 211 and 221 and the level 3 nodes (..., 321, ...) corresponds to the level 3 nodes (..., 321, y coordinate difference.

As described above, in the embodiment of FIG. 2, as the level increases, the radius of the circumference where the nodes are arranged increases in proportion to the level, and the intervals of the y coordinates where the nodes are arranged are the same as the level increases. As a result, the tree structure 2000 of FIG. 2 may be in the form of a cone. Depending on the embodiment, the radial rate of increase of the circumference or the spacing of the y-coordinates at which the nodes are arranged may vary. Thus, the tree structure may be in the form of a bell or a sharp horn. In the data processing method for converting the tree structure into the three-dimensional format according to the embodiment of the present invention, the radius increase rate of the circumference according to the interval and the level of the y coordinate depending on the level is not limited by the above- Can be determined according to the method. The method of determining the radius increase rate of the circumference according to the interval and the level of the y coordinate according to the level will be described later in more detail with reference to FIG.

FIG. 3 is a plan view of the three-dimensional nodes shown in FIG. 2 in the y direction.

Referring to FIG. 3, the root node 101 is located at the center, and nodes 2, 201, 211, and 221 of level 2 exist around the circumference of the root node 101, ...), and there are nodes of level 4 around it. 1, the nodes of level 2 are all parent nodes, and the nodes of level 3 except for node 321 are all leaf nodes. In addition, the nodes of level 4 are all leaf nodes and child nodes of node 321. In Fig. 3, the leaf node is a circular marker, and the nodes other than the leaf nodes, i.e., the parent nodes are shown as square marks.

Referring to FIG. 3, it can be seen that the occupancy angles of the nodes 201, 211 and 221 of level 2 are not the same. As used herein, an "occupancy angle" may be a number that indicates how many arcs a particular node occupies on the circumference where nodes of the same level are located. Since the length of the arc on the same circumference is proportional to the magnitude of the angle, the degree to which a particular node occupies the circumference can be proportional to the angle. The larger the occupancy angle, the shorter the distance between the node and the neighboring node, and the smaller the occupancy angle, the longer the distance between the node and the neighboring node.

According to the data processing method for converting the tree structure into the three-dimensional format according to the embodiment of the present invention, the occupancy angle allocated to each node on the same level is determined in proportion to the number of child nodes of the corresponding node. Referring to FIG. 3, five child nodes of the node 201, four child nodes of the node 211, and four child nodes of the node 221 are included. Therefore, the occupancy angle of the node 201 is larger than that of the nodes 211 and 221. As a result, the node 201 is indicated as being located relatively far away from the nodes 211 and 221. Visually, when the occupancy angle is large and is distant from other nodes, it can be recognized that the number of child nodes of the corresponding node is large even if the number of child nodes is not directly counted. Therefore, according to the data processing method for converting the tree structure according to the present invention into the three-dimensional format, even in a complicated tree structure having a large number of nodes and levels, intuitively, the relationship with the parent- The node can be easily recognized. Therefore, the tree structure can be displayed on three dimensions more intuitively. A specific method for determining the occupancy angle of each node will be described later with reference to Figs. 4A to 4F.

4A is a diagram showing a root node among the nodes shown in FIG.

Referring to FIG. 4A, it can be seen that the root node 101 is located on the center O ₁ of the circumference. Since only the root node 101 exists in level 1, there is no need to compute the occupancy angle in relation to other nodes. Thus, the occupancy angle of the root node 101 can be determined 360 degrees, and the radius of the circumference can be calculated as zero. Therefore, the root node 101 can have the node position as the coordinate (0, 0) which is the origin (O ₁ ) in the xz plane on the determined y coordinate.

FIG. 4B is a view for explaining a method of determining an occupancy angle of nodes of level 2 among the nodes shown in FIG. 3. FIG.

Referring to FIG. 4B, nodes 201, 211 and 221 of level 2 are arranged on the circumference on the radius r ₂ on the xz plane. The x, z coordinates of the center O ₂ of the circumference may be the same as the center O ₁ of the circumference of FIG. 4A. That is, the x and z coordinates of the centers (O ₁ , O ₂ ) of the circumference are the same, and only the y coordinate may be different. The nodes 201, 211, and 221 have respective occupancy angles (? ₁ ,? ₂ ,? ₃ ,? ₄ ). As described above, the occupancy angles (? ₁ ,? ₂ ,? ₃ ,? ₄ ) of each of the nodes 201, 211, and 221 can be determined based on the number of child nodes of the corresponding node. In one embodiment, occupancy angles (? ₁ ,? ₂ ,? ₃ ,? ₄ ) of each of the nodes 201, 211, and 221 may be determined in proportion to the number of child nodes of the corresponding node.

The number of the child nodes 301, 302, ..., 305 of the node 201 is 5 and the number of the child nodes 311, 312, ..., 314 of the node 211 is 5, The number of child nodes 321, 322, ..., and 324 of the node 221 is four. Therefore, if the occupancy angle is determined in proportion to the number of child nodes, it can be determined as follows.

In the above results, the occupancy angle is expressed in degrees. The distance between the node 201 and the node 211 or the distance between the node 201 and the node 221 is larger than the occupancy angle of the node 211 because the occupancy angle of the node 201 is larger than the occupation angle of the nodes 211 and 221. [ And the node 221, as shown in FIG. As described above, in the data processing method for converting the tree structure into the three-dimensional format according to the embodiment of the present invention, the occupancy angle of each node can be determined in proportion to the number of child nodes. If the above result is more generally expressed, the occupancy angle of each node determined in proportion to the number of child nodes can be expressed as Equation 1 below.

…………………………… (수식 1)

... ... ... ... ... ... ... ... ... ... ... (Equation 1)

M _m is the occupancy angle of the n-th node at the m-th level, c _mn is the number of child nodes of the n-th node at the m-th level, c _{m +} The number of nodes.

As described above, the occupancy angle of the node in the tree structure can be determined in proportion to the number of child nodes. However, according to the above method, Equation 1 can be applied only when there is no leaf node at the corresponding level. If there is a leaf node at that level, the leaf node has zero child nodes, so the occupancy angle is calculated as zero. If nodes with an occupancy angle of 0 exist in order, they are superimposed on the circumference, which can interfere with the intuitive perception of the tree structure. Referring back to FIG. 1, since there is no leaf node in level 2, i.e., nodes 201, 211, and 221 of level 2 are all the parent nodes of any node, the occupancy angle can be calculated by applying equation (1). The occupation angle calculation in the case where the leaf node exists at the corresponding level will be described later with reference to FIG. 4C to FIG. 4F.

FIG. 4C is a diagram for explaining a first embodiment for determining an occupancy angle of nodes of level 3 among the nodes shown in FIG. 3. FIG.

Referring to FIG. 4C, the nodes of level 3 (..., 321, ...) are arranged on the circumference on the radius r ₃ on the xz plane. The x, z coordinates of the center O ₃ of the circumference may be the same as the center O ₁ of the circumference of FIG. 4A and the center O ₂ of the circumference of FIG. 4B. That is, the x and z coordinates of the centers (O ₁ , O ₂ , O ₃ ) of the circumference are the same, and only the y coordinate may be different.

In Fig. 4C, leaf nodes are circular markers, and non-leaf nodes, i.e. parent nodes, are shown as square marks. As shown, among nodes of level 3, leaf nodes are included, and one parent node 321 is also included.

As described above, since the level 3 includes a leaf node, it may interfere with intuitively recognizing the tree structure when the occupancy angle is determined based on the above expression (1). Therefore, in the first embodiment of the present invention, the occupancy angle of each node can be determined such that occupancy angles of all the nodes of the same level are the same. According to this embodiment, since the number of nodes of level 3 is 13 in FIG. 4C, the occupancy angle of all nodes of level 3 can be determined as follows.

The above equation can be generally expressed as the following equation (5).

…………………………… (수식 5)

... ... ... ... ... ... ... ... ... ... ... (Equation 5)

In Equation 5, θ _f is the occupancy angle of the node having the level of the leaf node, and c _f is the number of nodes of the level having the leaf node. According to the above-described embodiment, since nodes having child nodes and nodes having no child nodes exist at the level where the leaf node exists, the nodes having the leaf nodes are evenly distributed irrespective of the number of child nodes. It can be determined that the occupancy angle is distributed. Referring to FIG. 4C, it can be seen that all nodes have the same occupancy angle regardless of whether they are leaf nodes or not.

FIG. 4D is a diagram for explaining a second embodiment for determining an occupancy angle of nodes of level 3 among the nodes shown in FIG. 3. FIG.

FIG. 4D shows that the occupancy angle of the leaf nodes is different from the occupancy angle of the node 321, not the leaf node, as in FIG. 4C. In order to more intuitively recognize the tree structure displayed on the three-dimensional level, in the case of a level where leaf nodes and non-leaf nodes are mixed, it is possible to calculate an occupancy angle by assigning weights to child nodes have. Referring to FIG. 4D and FIG. 1, since the number of leaf nodes of level 3 is 12 and the number of child nodes of node 321 is 4, the occupancy angle of the leaf node and the occupancy angle of node 321 are Can be calculated as follows.

In the above formula,? _Leaf is the occupancy angle of the leaf node of level 3, and? ₃₂₁ is the occupancy angle of the node 321. [ Therefore, at the level where leaf nodes and non-leaf nodes are mixed, it is possible to calculate the occupancy angle by assigning weights to child nodes other than the leaf nodes.

According to the above method of calculating the occupancy angle, the occupancy angle of the leaf node can be expressed by the following equation (2) at the level where the leaf node and the node other than the leaf node coexist.

…………………………… (수식 2)

... ... ... ... ... ... ... ... ... ... ... (Equation 2)

In Equation 2, θ _ml is the occupancy angle of the leaf node at the mth level, c _ml is the number of leaf nodes at the mth level, and c _{m + 1} is the number of all nodes at the (m + 1) th level.

Also, at a level where leaf nodes and non-leaf nodes are mixed, the occupancy angle of a node other than the leaf node can be expressed by the following equation (3).

……………………… (수식 3)

... ... ... ... ... ... ... ... ... (Equation 3)

In the Formula 3, θ _mk, m occupy each of the k th node in the second level non-leaf nodes, c _ml are m number of the second-level leaf nodes, c _{m + 1} are m + 1 total number of nodes in the second level, c _mk is the number of child nodes of the k-th node, not the leaf node of the m-th level.

FIG. 4E is a view for explaining the first embodiment for determining the occupancy angle of nodes of level 4 among the nodes shown in FIG. 3. FIG.

4E, level 4 nodes 401, 402, 403, 404 are disposed on a circumference on a radius r ₄ on the xz plane. X, z coordinates of the center of the circumference (O ₄₎ may be the same and also the circumferential center of the 4a (O _1), also the circumferential center of the 4b (O ₂₎ and the circumferential center of the Figure 4c (O ₃₎ . That is, the x and z coordinates of the centers of the circumference (O ₁ , O ₂ , O ₃ , and O ₄ ) are the same, and only the y coordinates may be different.

At level 4 only leaf nodes are present. Since these leaf nodes do not have child nodes, the occupancy angle can not be calculated based on the above-mentioned equation (1). In the first embodiment of the present invention, the occupancy angle of the node at the level where only the leaf node exists can be calculated based on the following equation (4).

…………………………… (수식 4)

... ... ... ... ... ... ... ... ... ... ... (Equation 4)

Here, θ _p is an occupancy angle of a node having only a leaf node, and c _p is the number of nodes having only a leaf node. According to Equation (4), the occupancy angle of nodes of level 4 (401, 402, 403, 404) can be calculated at 90 degrees.

FIG. 4F is a diagram for explaining a first embodiment for determining an occupancy angle of nodes of level 4 among the nodes shown in FIG. 3. FIG.

Referring to FIG. 4F, at the level 4 where only the leaf nodes 401, 402, 403, 404 exist, the occupancy angles can be assigned so that the sum of the total occupancy angles does not become 360 degrees. Referring to FIGS. 4F and 4D together, the sum of the occupancy angles of the leaf nodes 401, 402, 403 and 404 of FIG. 4F may be the same as the occupancy angle of the node 321 of FIG. 4D. According to the above-described method, by arranging the leaf nodes 401, 402, 403, and 404 at the level where only the leaf node is present to be included in the occupancy angle of the parent node 321, So that more intuitive display is possible. In this case, the position on the x-z plane of the leaf nodes 401, 402, 403, 404 of Fig. 4F may also be specified to be included in the occupancy angle of the parent node 321 of Fig. This is to more intuitively indicate the parent-child relationship of the leaf nodes 401, 402, 403, 404 and its parent node 321.

In the above method, the occupancy angle of the leaf node at the level where only the leaf node exists can be determined as shown in the following equation (8).

………… (수식 8)

... ... ... ... (Equation 8)

In Equation (8) _{,? Mk} is the occupancy angle of the k-th node at the m-th level, c _{(m-1) l} is the number of leaf nodes at the _{m- (M-1) k} is the number of child nodes of the k-th node that is not the leaf node at the _(m-1) -th level.

According to Equation (8), the occupancy angle of the leaf nodes of the level 4 is 22.5 degrees and the sum of the occupancy angles is 90 degrees, which is the occupancy angle of the parent node 321 calculated according to the embodiment shown in FIG. same.

FIG. 5 is a diagram for explaining a method for determining the position of the nodes shown in FIG. 2 in the y-axis direction.

Referring to FIG. 5, a cross-sectional view of the tree structure 2000 shown in FIG. 2 in the z-axis direction is shown, and the representation of each node is omitted for convenience of illustration. The root node is present in a position (O _1), the level 2 nodes are present on a circumference having a radius (r ₂₎ around the position (O _2). The nodes of level 3 are on the circumference with radius (r ₃ ) around position O ₃ and the nodes of level 4 are on the circumference with radius (r ₄ ) around position (O ₄ ) do.

In the embodiment of Fig. 5, the distances d2, d3 and d4 between the levels are the same, and the radius per level satisfies the following relationship.

r ₃ = 2 x r ₂ , r ₄ = 3 x r ₂

That is, the radius per level increases in proportion to the level difference from the origin. The above two conditions, that is, distances (d2, d3, d4) and a radius by a level between the level by the conditions of the _{(r 2, r 3, r} 4), a tree structure according to an embodiment of the present invention is a three-dimensional It has a conical shape in space.

5, the y-coordinates of nodes according to an embodiment of the present invention can be determined by the following equation (9).

…………………………… (수식 9)

... ... ... ... ... ... ... ... ... ... ... (Equation 9)

Where y _m is the y coordinate of the mth level node, and d _k is the distance between the k th level and the k-1 th level. Depending on the embodiment, the values of d _k may all be the same. _If the value of d _k is all equal to d, then the y coordinates of the nodes can be determined as in Equation 10 below.

…………………………… (수식 10)

... ... ... ... ... ... ... ... ... ... ... (Equation 10)

6 is a diagram for illustratively illustrating a method of determining a position on a x-z plane of a node based on a determined occupancy angle.

Referring to FIG. 6, a circumference having a radius r around the origin O is shown. Depending on the level, the y coordinate of the origin (O) and the size of the radius (r) may vary. In Fig. 6, &thetas; ₀ represents an initial angular position by level. Depending on the embodiment, < RTI ID = 0.0 > ₀ < / RTI > ₀ can have a predetermined value to arbitrarily determine the position of the first node for each level.

Referring to FIG. 6, the position (P ₁ ) of the first node is located at the center of the occupancy angle (? ₁ ) of the first node. So as to occupy the same circumferential angle on both sides around the node position on the circumference. Thus, each location of the first node becomes _{(θ 0 + θ 1/2} ). Thus, x-coordinate of the first node is _{rcos (θ 0 + θ 1/} 2) a, z coordinates _{r × sin (θ 0 + θ} 1/2).

In a similar way, the angular position of the location of the second node (P ₂₎ is _{(θ 0 + θ 1 + θ} 2/2). Thus, x-coordinate of the second node is a _{r × cos (θ 0 + θ} 1 + θ 2/2), z coordinate is a _{r × sin (θ 0 + θ} 1 + θ 2/2). The position of the third node on the xz plane can be similarly obtained.

According to the above method, the position on the x-z plane can be obtained by the following expressions (6) and (7).

…………………………… (수식 6)

... ... ... ... ... ... ... ... ... ... ... (Equation 6)

…………………………… (수식 7)

... ... ... ... ... ... ... ... ... ... ... (Equation 7)

In the formula 6 and 7, x _n is the x coordinate, z _n the n-th node is the z coordinate, r of the n-th node is radius, θ _n of the level of occupancy of each, θ ₀ in the n-th node is the initial angle Levels .

As described above with reference to Figs. 4A to 6, the occupancy angle of the node included in each level can be obtained, and the x, y, and z coordinates of each node can be obtained based on the occupancy angle.

7 is a diagram showing an example of a data processing method for converting a tree structure into a three-dimensional format according to an embodiment of the present invention.

Referring to FIG. 7, a data processing method for converting a tree structure into a three-dimensional structure according to an embodiment of the present invention includes a step (S110) of receiving data on a tree structure composed of a plurality of nodes, (S130) of determining three-dimensional position coordinates of the nodes included in the structure (S130), and displaying the nodes on the three-dimensional coordinate system based on the determined position coordinates (S150). In step S130 of determining the three-dimensional position coordinates of the nodes included in the tree structure, the nodes other than the root node and the leaf nodes of the nodes, respectively, And an occupancy angle allocated to each node on the same level is determined in proportion to the number of child nodes. In step S150, the nodes may be displayed on the determined position coordinates, and the parent-child relationship of each node may be represented by a line.

FIG. 8 is a diagram illustrating an example of a method for determining three-dimensional position coordinates of nodes included in a tree structure in the method of FIG.

Referring to FIG. 8, in order to determine three-dimensional position coordinates of nodes included in the tree structure, a level interval and a radius for each level are determined (S210), the position of the root node is determined (S230) The y coordinate of the nodes included in the tree structure is determined based on the position and the level interval in step S230, the occupancy angle of each node is determined in step S270, and based on the determined occupancy angle and the radius according to the level, The x coordinate and the z coordinate of the nodes included in the tree structure are respectively determined (S290).

In step S210 of determining the level interval and the radius for each level, the distance difference between each level and the radius of each circumference of each level can be determined as described with reference to FIG. In step S230 of determining the y coordinate of the nodes included in the tree structure based on the position of the root node and the level interval, the y coordinate of the nodes can be determined by the following equation (9) .

…………………………… (수식 9)

... ... ... ... ... ... ... ... ... ... ... (Equation 9)

Where y _m is the y coordinate of the mth level node, and d _k is the distance between the k th level and the k-1 th level.

In the step S270 of determining the occupancy angle of each node, the occupancy angle can be determined as described with reference to Figs. 4A to 4F. In the step S290 of determining the x coordinate and the z coordinate of the nodes included in the tree structure based on the determined occupancy angle and the radius for each level, the x coordinate and the z coordinate of the node are calculated by the following equations (6) Can be determined.

…………………………… (수식 6)

... ... ... ... ... ... ... ... ... ... ... (Equation 6)

…………………………… (수식 7)

... ... ... ... ... ... ... ... ... ... ... (Equation 7)

In the formula 6 and the formula 7, x _n is the n-th x-coordinate of the node, z _n the n-th node, z coordinates, r is radius, θ _n is n occupy each, θ ₀ in the first node of the level of the initial angular Levels to be.

9A is a diagram showing a first embodiment of a method for determining an occupancy angle of nodes included in a tree structure in the method of FIG.

Referring to FIG. 9A, it is determined whether the corresponding node is a root node (S310). If the node is the root node, the occupancy angle is determined 360 degrees (S315). If the node is not a root node, it is determined whether there is a leaf node at the same level (S320). If there is no leaf node at the same level, the occupancy angle is determined according to the following equation (S325).

…………………………… (수식 1)

... ... ... ... ... ... ... ... ... ... ... (Equation 1)

Where _mn is the occupancy angle of the n-th node at the m-th level, c _mn is the number of child nodes of the n-th node at the m-th level, c _{m + 1} is the number of all nodes at the m + to be.

If there is a leaf node at the same level, the occupancy angle is determined according to the following equation (S330).

…………………………… (수식 5)

... ... ... ... ... ... ... ... ... ... ... (Equation 5)

Here, θ _f is the occupancy angle of the node having the level of the leaf node, and c _f is the number of nodes having the level of the leaf node.

In step S325, the occupancy angle of the node can be determined according to the method described with reference to FIG. 4B. In step S330, the occupancy angle of the node can be determined according to the method described with reference to FIG.

FIG. 9B is a diagram showing a second embodiment of a method for determining an occupancy angle of nodes included in a tree structure in the method of FIG. 8. FIG.

Referring to FIG. 9B, it is determined whether the corresponding node is a root node (S410). If the node is the root node, the occupancy angle is determined 360 degrees (S415). If the node is not a root node, it is determined whether there is a leaf node at the same level (S420). If there is no leaf node at the same level, the occupancy angle is determined according to the following equation (S325).

…………………………… (수식 1)

... ... ... ... ... ... ... ... ... ... ... (Equation 1)

Where _mn is the occupancy angle of the n-th node at the m-th level, c _mn is the number of child nodes of the n-th node at the m-th level, c _{m + 1} is the number of all nodes at the m + to be.

If there is a leaf node at the same level, it is determined whether there is only a leaf node at the same level (S430). If there is only a leaf node at the same level, the occupancy angle is determined according to the following equation (S435).

…………………………… (수식 4)

... ... ... ... ... ... ... ... ... ... ... (Equation 4)

Here, θ _p is an occupancy angle of a node having only a leaf node, and c _p is the number of nodes having only a leaf node.

If the leaf nodes and the non-leaf nodes coexist at the same level, it is determined whether the corresponding node is a leaf node (S440). If the node is a leaf node, the occupancy angle is determined according to the following equation (S445).

…………………………… (수식 2)

... ... ... ... ... ... ... ... ... ... ... (Equation 2)

Here, θ _ml is the occupancy angle of the leaf node at the mth level, c _ml is the number of leaf nodes at the mth level, and c _{m + 1} is the number of all nodes at the (m + 1) th level.

If the corresponding node is not a leaf node, an occupancy angle is determined according to the following equation (S450).

……………………… (수식 3)

... ... ... ... ... ... ... ... ... (Equation 3)

Here, θ _mk is m number, c _mk for all the nodes of the occupation angle of the k-th node is not a leaf node in the second level, c _ml are m number, c _{m + 1} of the second level leaf nodes, m + 1-th level, is the number of child nodes of the k-th node other than the leaf node of the m-th level.

In step S425, the occupancy angle of the node can be determined according to the method described with reference to Fig. 4B. In step S435, the occupancy angle of the node can be determined according to the method described with reference to Fig. 4E. In steps S445 and S450, the occupancy angle of the node can be determined according to the method described with reference to FIG. 4D.

As described above, if there is only a leaf node at the corresponding level, the occupancy angle of the leaf node may be determined based on Equation 4 as described with reference to Fig. 4E, and based on Equation 8 as described with reference to Fig. The occupancy angle of the leaf node may be determined. Therefore, in step S435, instead of the method of determining the occupancy angle according to equation (4), the occupancy angle may be determined according to the following equation (8).

………… (수식 8)

... ... ... ... (Equation 8)

In Equation (8) _{,? Mk} is the occupancy angle of the k-th node at the m-th level, c _{(m-1) l} is the number of leaf nodes at the _{m- (M-1) k} is the number of child nodes of the k-th node that is not the leaf node at the _(m-1) -th level.

A computer-readable recording medium according to another embodiment of the present invention records an electronic code for executing a data processing method for displaying a tree structure in a three-dimensional format on a computer. Wherein the electronic record code receives data relating to a tree structure composed of a plurality of nodes, determines three-dimensional position coordinates of the nodes included in the tree structure, respectively, and determines the nodes based on the determined position coordinates It is possible to cause the computer to perform an operation of displaying on the coordinate system. Herein, the nodes other than the root node and the leaf node are arranged in a circle on the same level according to the occupancy angle assigned to the corresponding node, and the occupancy angle assigned to each node on the same level Is determined in proportion to the number of child nodes.

In the above embodiment, the electronic code may make the occupancy angle assigned to the node determined by the following equation.

…………………………… (수식 1)

... ... ... ... ... ... ... ... ... ... ... (Equation 1)

In Equation 1, θ _mn is the occupancy angle of the n-th node at the m-th level, c _mn is the number of child nodes of the n-th node at the m-th level, c _{m +} .

At this point, it will be appreciated that the combinations of blocks and flowchart illustrations in the process flow diagrams may be performed by computer program instructions. These computer program instructions may be loaded into a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus, so that those instructions, which are executed through a processor of a computer or other programmable data processing apparatus, Thereby creating means for performing functions. These computer program instructions may be stored in a computer readable memory or in a computer capable of directing a computer or other programmable data processing apparatus to implement a function in a particular manner, It is also possible for instructions stored in memory to produce manufacturing items that contain instruction means for performing the functions described in the flowchart block (s). Computer program instructions may also be stored on a computer or other programmable data processing equipment so that a series of operating steps may be performed on a computer or other programmable data processing equipment to create a computer- It is also possible for the instructions to perform the processing equipment to provide steps for executing the functions described in the flowchart block (s).

In addition, each block may represent a module, segment, or portion of code that includes one or more executable instructions for executing the specified logical function (s). It should also be noted that in some alternative implementations, the functions mentioned in the blocks may occur out of order. For example, two blocks shown in succession may actually be executed substantially concurrently, or the blocks may sometimes be performed in reverse order according to the corresponding function.

Herein, the term " part " used in the present embodiment means a hardware component such as software or an FPGA or an ASIC, and 'part' performs certain roles. However, 'part' is not meant to be limited to software or hardware. &Quot; to " may be configured to reside on an addressable storage medium and may be configured to play one or more processors. Thus, by way of example, 'parts' may refer to components such as software components, object-oriented software components, class components and task components, and processes, functions, , Subroutines, segments of program code, drivers, firmware, microcode, circuitry, data, databases, data structures, tables, arrays, and variables. The functions provided in the components and components may be further combined with a smaller number of components and components or further components and components. In addition, the components and components may be implemented to play back one or more CPUs in a device or a secure multimedia card.

The embodiments of the present invention disclosed in the present specification and drawings are merely illustrative examples of the present invention and are not intended to limit the scope of the present invention in order to facilitate understanding of the present invention. It will be apparent to those skilled in the art that other modifications based on the technical idea of the present invention are possible in addition to the embodiments disclosed herein.

101: root node 1000: general tree structure
2000: tree structure displayed on three dimensions

Claims (13)

A data processing method for converting a tree structure into a three-dimensional format,
The method comprising: receiving data related to a tree structure composed of a plurality of nodes;
Determining three-dimensional position coordinates of nodes included in the tree structure, the nodes having the same level are arranged according to an occupancy angle assigned to each node on a circumference of one circle corresponding to the level, Determined in proportion to the number of child nodes; And
Displaying the nodes in a three-dimensional coordinate system based on the determined position coordinates,
Wherein determining the three-dimensional position coordinates of the nodes included in the tree structure comprises:
Determining a level interval and a radius corresponding to each level;
Determining a location of a root node;
Determining y coordinates of nodes included in the tree structure based on the position of the root node and the level interval;
Determining the occupancy angle for each node; And
Determining an x coordinate and a z coordinate of nodes included in the tree structure based on the occupancy angle and the radius corresponding to the respective level.
delete The method according to claim 1,
Wherein the occupancy angle is determined by the following equation (1).

... ... ... ... ... ... ... ... ... ... ... (Equation 1)
θ _mn : occupancy angle of the n-th node at the m-th level
c _mn : the number of child nodes of the nth node at the mth level
c _{m + 1} : total number of nodes in the (m + 1) th level
A data processing method for displaying a tree structure in a three-dimensional format,
The method comprising: receiving data related to a tree structure composed of a plurality of nodes;
Determining a level interval of the tree structure and a radius corresponding to each level;
Determining a location of a root node;
Determining an occupancy angle of nodes included in the tree structure based on the number of child nodes;
Arranging nodes of the same level according to the occupancy angle on a circumference of one circle corresponding to the level;
Determining coordinates of nodes included in the tree structure according to the arranged results; And
And displaying the nodes in a three-dimensional coordinate system based on the determined position coordinates,
Wherein the step of determining the coordinates of the nodes included in the tree structure comprises:
Determining y coordinates of nodes included in the tree structure based on the position of the root node and the level interval; And
Determining an x coordinate and a z coordinate of nodes included in the tree structure based on the occupancy angle and the radius corresponding to the respective levels.
The method according to claim 4, wherein, in the step of determining an occupancy angle of nodes included in the tree structure, an occupancy angle of nodes having no leaf node is determined by the following equation (1) Processing method.

... ... ... ... ... ... ... ... ... ... ... (Equation 1)
θ _mn : occupancy angle of the n-th node at the m-th level
c _mn : the number of child nodes of the nth node at the mth level
c _{m + 1} : total number of nodes in the (m + 1) th level
The method according to claim 5, wherein, in the step of determining an occupancy angle of nodes included in the tree structure, an occupancy angle of a leaf node among nodes having a leaf node is determined according to Equation (2) .

... ... ... ... ... ... ... ... ... ... ... (Equation 2)
θ _ml : occupancy angle of the leaf node at the mth level
c _ml : Number of leaf nodes at the mth level
c _{m + 1} : total number of nodes in the (m + 1) th level
The method as claimed in claim 6, wherein, in the step of determining an occupancy angle of nodes included in the tree structure, an occupancy angle of a node other than a leaf node among nodes having a leaf node is determined The data processing method comprising the steps of:

... ... ... ... ... ... ... ... ... (Equation 3)
θ _mk : _Occurrence angle of the kth node that is not the leaf node of the mth level
c _ml : Number of leaf nodes at the mth level
c _{m + 1} : total number of nodes in the (m + 1) th level
c _mk : the number of child nodes of the k-th node other than the leaf node at the m-th level
6. The method according to claim 5, wherein, in the step of determining an occupancy angle of nodes included in the tree structure, an occupancy angle of a node having only a leaf node is determined by the following equation (4) Processing method.

... ... ... ... ... ... ... ... ... ... ... (Equation 4)
θ _p : Occurrence angle of the node with the level of the leaf node only
c _p : Number of nodes at level with only leaf nodes
The method according to claim 5, wherein, in the step of determining an occupancy angle of nodes included in the tree structure, an occupancy angle of a node having a leaf node is determined by the following equation (5) Processing method.

... ... ... ... ... ... ... ... ... ... ... (Equation 5)
θ _f : Occurrence angle of node at level with leaf node
c _f : Number of nodes at the level where the leaf node is located
5. The method of claim 4, wherein displaying the nodes in a three-dimensional coordinate system based on the determined position coordinates comprises:
Displaying the nodes on respective determined location coordinates; And
And displaying the parent-child relationship of each node in a line.
5. The method of claim 4, wherein determining coordinates of nodes included in the tree structure according to the arranged results comprises:
Determining y coordinates of nodes;
Determining an x coordinate of each node according to Equation (6); And
And determining the z coordinate of each node by the following equation (7).

... ... ... ... ... ... ... ... ... ... ... (Equation 6)

... ... ... ... ... ... ... ... ... ... ... (Equation 7)
x _n : x coordinate of the nth node,
z _n : z coordinate of the nth node,
r: radius of the level,
θ _n : occupancy angle of the n-th node
θ ₀ : Initial angle by level
A computer-readable recording medium storing an electronic code for executing a data processing method for displaying a tree structure in a three-dimensional format on a computer,
Receiving data related to a tree structure composed of a plurality of nodes,
Dimensional position coordinates of the nodes included in the tree structure, the nodes of the same level being arranged according to occupancy angles assigned to the respective nodes on a circumference of one circle corresponding to the level, Determined in proportion to the number of nodes -
And displaying the nodes in a three-dimensional coordinate system based on the determined position coordinates,
In determining the three-dimensional position coordinates of the nodes,
Determine a y-coordinate of the nodes included in the tree structure based on the position of the root node and the level interval, Determining an occupancy angle for a node, and determining an x coordinate and a z coordinate of nodes included in the tree structure, respectively, based on the occupancy angle and the radius corresponding to the respective levels.
13. The method of claim 12,
Characterized in that said occupancy angle is determined by the following equation (1).

... ... ... ... ... ... ... ... ... ... ... (Equation 1)
θ _mn : occupancy angle of the n-th node at the m-th level
c _mn : the number of child nodes of the nth node at the mth level
c _{m + 1} : total number of nodes in the (m + 1) th level

Images