CN112668143B - A method for dynamic visualization and automatic layout of command relationship hierarchy - Google Patents

Abstract

The present invention provides a method for dynamic visualization and automatic layout of a command relationship hierarchy, which maintains the visualization and automatic layout of the command relationship tree hierarchy when the command relationship between group entities with a hierarchical command relationship changes dynamically; the dynamic change of the command relationship includes but is not limited to adding entities, deleting entities, adding command relationships and deleting command relationships; the command relationship is a directional identifier, pointing from the commanding entity to the commanded entity. The method for dynamic visualization and automatic layout of the command relationship hierarchy described in the present invention can realize the command relationship of group entities with a hierarchical command relationship, and always maintains the visualization and automatic layout of the command relationship tree hierarchy during the dynamic changes of adding entities, deleting entities, adding command relationships and deleting command relationships. It is a key technology for visualization modeling of command relationships in a group informationized command system with a hierarchical command relationship.

Description

A method for dynamic visualization and automatic layout of command relationship hierarchy

Technical Field

The invention belongs to the technical field of command relationship informationization, and in particular relates to a command relationship hierarchical structure dynamic visualization automatic layout method.

Background Art

Teams with hierarchical command relationships, such as companies, schools, or the military, mostly conduct operational command simulations based on entities that are scaled down or simulated at a certain scale. For example, traditional military simulations and combat commands are mainly conducted in the form of sand table operations. According to the combat content and requirements of military assumptions, war games are used to display the situation of both sides of the war on a terrain model scaled down at a certain scale to practice the organization and command of campaigns and battles. This can enable operators to deepen their understanding of combat theory principles and improve their organizational command capabilities. However, sand table operations require commanders to make terrain models and manually deploy war games, which is complicated to operate. Moreover, when the combat area is large, sand table operations require the use of sand tables with smaller scales, which cannot display the specific situation of the combat area in detail, and have certain restrictions on the use of commanders and their command agencies. On the other hand, modern war systems are very large and highly complex, usually involving joint operations of multiple arms and multiple systems. Traditional combat command methods can no longer meet the needs of modern complex war systems. Other teams with hierarchical command relationships (such as companies and schools) also face similar problems and needs as the above. Using information technology to visualize the overall situation and achieve efficient remote command of complex systems is the key to the smooth operation of a team with hierarchical command relationships. Command relationship visualization technology, especially the tree-like hierarchical layout that maintains visualization of command relationships after adjustments and changes to the command relationships, is a key core technology.

Summary of the invention

In view of this, the present invention aims to propose a method for dynamic visualization and automatic layout of command relationship hierarchy, so as to solve the problem that sand table operation requires the use of a smaller scale sand table, which cannot display the specific situation in the area in detail and has certain limitations on the use of commanders and command leadership organs.

To achieve the above object, the technical solution of the present invention is achieved as follows:

A command relationship hierarchical structure dynamic visualization automatic layout method is provided, which maintains the command relationship tree-like hierarchical structure visualization automatic layout when the command relationship between group entities with hierarchical command relationship is dynamically changed; the command relationship dynamic change includes but is not limited to adding entities, deleting entities, adding command relationships and deleting command relationships; the command relationship is a directional identifier, which points from the commanding entity to the commanded entity;

The tree-like hierarchical structure visualization automatic layout is used to visualize the layout of each connected subgraph in the command relationship graph using a tree-like hierarchical structure;

When the commanding entity is laid out, it is located at the upper level of the commanded entity in the vertical direction and in the middle of all the commanded entities in the horizontal direction. Multiple connected subgraphs are displayed in parallel horizontal layout.

Further, the following steps are included:

S1. A directed graph data structure G(V,E) is used to represent the command relationship of group entities with a hierarchical command relationship, where the node set V represents the group entity with a hierarchical command relationship, and the edge set E represents the command relationship;

S2. Grid the drawing area, with the grid origin located at the upper left corner with coordinates (0, 0);

S3, using a hash table unitPos<key, value> to record the grid coordinates of all group entities with a hierarchical command relationship, where key represents the unique identifier of the group entity with a hierarchical command relationship, and value is the grid coordinate;

S4. Initialize the grid coordinates of all group entities with hierarchical command relationships in unitPos to (-1,-1);

S5, calculating the grid coordinate unitPos of the tree-like hierarchical structure layout of the group entity with a hierarchical command relationship according to the directed graph data structure G;

S6. Visually draw the group entities with the hierarchical command relationship and the command relationship between them at the corresponding coordinates in the drawing area according to the grid coordinates unitPos of the group entities with the hierarchical command relationship.

Furthermore, the command relationship is a directed arrow.

Furthermore, in step S5, the method for calculating the grid coordinates of the tree-like hierarchical structure layout of the group entities with a hierarchical command relationship is specifically as follows:

S51, let startx be the starting horizontal grid coordinate, and starty be the starting vertical grid coordinate;

S52, obtaining a highest command entity node set C from the command relationship graph G, wherein the highest command entity node refers to a node without incident edges in the graph G;

S53, if all nodes in the set C have been traversed, the calculation process ends, otherwise go to S54;

S54, obtaining the next highest command entity node r in C;

S55, using startx as the starting horizontal grid coordinate and starty as the starting vertical grid coordinate as parameters, calculating the grid coordinates of all node entities in the spanning subtree with r as the root node, and outputting the maximum horizontal grid coordinate maxx and the maximum vertical grid coordinate maxy, wherein the spanning subtree refers to the spanning subtree of the command relationship graph G with r as the root node and consisting of the node r and all its connected nodes;

S56. Let startx=maxx+2, and go to S53.

Furthermore, in step S55, the calculation method for generating the grid coordinates of the node entity in the subtree includes:

Calculate the vertical grid coordinates of all node entities in the generated subtree;

Calculates the horizontal grid coordinates of all node entities in the generated subtree.

Furthermore, the method for calculating the vertical grid coordinates of all node entities in the generated subtree specifically includes:

Perform a pre-root traversal on the spanning subtree and recursively calculate the vertical grid coordinates of all node entities;

If entity _e1 commands entity _e2 , then unitPos[ _e2 ].y=unitPos[ _e1 ].y+2, where unitPos[ _e1 ].y and unitPos[ _e2 ].y are the vertical grid coordinates of entities _e1 and _e2 respectively.

Furthermore, the method for calculating the horizontal grid coordinates of all node entities in the generated subtree specifically includes:

Perform post-root traversal on the generated subtree and recursively calculate the horizontal grid coordinates of all node entities;

Assuming that the entity set e _i+1 ,e _i+2 ,…e _i+n is the set of directed entities of entity e, we have:

unitPos[e _i+2 ].x＝unitPos[e _i+1 ].x+2;

When n is an odd number, unitPos[e].x = unitPos[e _i+n/2 ].x; when n is an even number, unitPos[e].x = (unitPos[e _i-1+n/2 ].x + unitPos[e _i+n/2 ].x)/2, that is, the commanding entity is located in the middle of the commanded entity in the horizontal direction; where unitPos[e].x is the horizontal grid coordinate of entity e.

Compared with the prior art, the command relationship hierarchy dynamic visualization automatic layout method of the present invention has the following advantages:

The method for dynamic visualization and automatic layout of the command relationship hierarchy described in the present invention can realize the command relationship of group entities with hierarchical command relationships, and always maintain the visualization and automatic layout of the command relationship tree hierarchy during the dynamic changes of adding entities, deleting entities, adding command relationships and deleting command relationships. It is a key technology for visual modeling of command relationships in a group information-based command system with hierarchical command relationships.

BRIEF DESCRIPTION OF THE DRAWINGS

The accompanying drawings constituting a part of the present invention are used to provide a further understanding of the present invention. The exemplary embodiments of the present invention and their descriptions are used to explain the present invention and do not constitute an improper limitation of the present invention. In the accompanying drawings:

Fig. 1 is the overall workflow of the present invention;

Fig. 2 is a flow chart of the calculation of the coordinates of the solid grid;

FIG3 is a flow chart of recursive calculation of vertical grid coordinates;

FIG4 is a flow chart of horizontal grid coordinate recursive calculation;

FIG5 is a schematic diagram of a method for calculating coordinates of a solid grid;

FIG6 is a schematic diagram of a method for calculating coordinates of a generated subtree node entity grid;

FIG. 7 is a schematic diagram of the automatic layout effect of the tree-like hierarchical structure of the military entity command relationship.

DETAILED DESCRIPTION

It should be noted that, in the absence of conflict, the embodiments of the present invention and the features in the embodiments may be combined with each other.

The present invention will be described in detail below with reference to the accompanying drawings and in conjunction with embodiments.

The present invention provides a method for dynamic visualization and automatic layout of a command relationship hierarchy, which is suitable for groups with hierarchical command relationships, such as the military, schools, companies, etc. The military group is taken as one of the embodiments of the present application to further explain the technical solution of the present application.

The technical solution is (as shown in Figure 1 and Figure 5):

S1. Use a directed graph data structure G(V,E) to represent the command relationship of military entities, where the node set V represents the military entities and the edge set E represents the command relationship. The command relationship is a directed arrow from the commanding entity to the commanded entity;

S2. Grid the drawing area, with the grid origin located at the upper left corner with coordinates (0, 0);

S3. Use the hash table unitPos<key,value> to record the grid coordinates of all military entities, where key represents the unique identifier of the military entity and value is the grid coordinate;

S4. Initialize the grid coordinates of all military entities in unitPos to (-1,-1);

S5. Calculate the grid coordinates unitPos of the tree-like hierarchical structure layout of the military entity according to the directed graph data structure G;

S6. Visually draw the military entities and the command relationships between them at the corresponding coordinates in the drawing area according to the grid coordinates unitPos of the military entities;

As shown in FIG. 2 and FIG. 5 , the method for calculating the coordinates of the military entity grid described in step S5 is as follows:

S51, let startx be the starting horizontal grid coordinate, and starty be the starting vertical grid coordinate;

S52, obtaining a highest command entity node set C from the command relationship graph G, wherein the highest command entity node refers to a node without incident edges in the graph G;

S53, if all nodes in the set C have been traversed, the calculation process ends, otherwise go to S54;

S54, obtaining the next highest command entity node r in C;

S55, using startx as the starting horizontal grid coordinate and starty as the starting vertical grid coordinate as parameters, calculating the grid coordinates of all nodes in the spanning subtree with r as the root node, and outputting the maximum horizontal grid coordinate maxx and the maximum vertical grid coordinate maxy, wherein the spanning subtree refers to the spanning subtree of the graph G with r as the root node and consisting of the node r and all its connected nodes;

S56, set startx=maxx+2, and go to S53;

As shown in FIG6 , the calculation method for generating the grid coordinates of the entity of the subtree node described in step S55 is:

Calculate the vertical grid coordinates of all node entities in the generated subtree;

Calculate the horizontal grid coordinates of all node entities in the generated subtree;

As shown in FIG6 , the vertical grid coordinate calculation method of the above spanning subtree is:

Perform a pre-root traversal on the spanning subtree and recursively calculate the vertical grid coordinates of all node entities;

If entity e1 commands entity e2, then unitPos[e2].y = unitPos[e1].y + 2, where unitPos[e1].y and unitPos[e2].y are the vertical grid coordinates of entities e1 and e2 respectively;

As shown in Figure 3, the method flow is as follows:

S5511, let r be the root node entity of the generated subtree, and starty1 be the starting grid coordinate in the vertical direction;

S5512, initialize the maximum vertical grid coordinate maxy1 of the spanning subtree = 0;

S5513, if the grid coordinate unitPos[r] of r is (-1, -1), go to S5514, otherwise go to S55112;

S5514. Obtain the previous level command entity set P and the commanded entity set Q of r from the graph G;

S5515, if P is empty, go to S5516, otherwise go to S5518;

S5516, let the y coordinate of the grid coordinate of r be starty1, that is, unitPos[r].y=starty1;

S5517, if the traversal of the set Q has been completed, go to S55118, otherwise go to S55114;

S5518, if the traversal of the set P has been completed, go to S5517, otherwise go to S5519;

S5519, get the next entity node m in P;

S55110. If the y coordinate of the grid coordinate of entity m is greater than the y coordinate of entity r, that is, unitPos[m].y>unitPos[r].y, then go to S55111, otherwise go to S5518;

S55111, unitPos[r].y=unitPos[m].y+2, go to S5518;

S55112, if starty1 is greater than the y coordinate of the entity r grid coordinate, that is, starty1>unitPos[r].y, go to S55113, otherwise go to S5517;

S55113, unitPos[r].y=starty1, go to S5517;

S55114. Get the next entity node a in Q;

S55115, recursive calculation: take unitPos[r].y as the starting vertical grid coordinate, calculate the vertical grid coordinates of all nodes in the spanning subtree with a as the root node, and output the maximum vertical grid coordinate maxy2;

S55116, if maxy1<maxy2, go to S55117, otherwise go to S5517;

S55117, maxy1=maxy2, go to S5517;

S55118, output maxy1.

As shown in FIG6 , the calculation method of the horizontal grid coordinates of the above spanning subtree is:

Assuming that the entity set (layout from left to right) _ei+1 , _ei+2 , ... _ei+n is the directed entity set of entity e, then:

unitPos[e _i+2 ].x＝unitPos[e _i+1 ].x+2;

When n is an odd number, unitPos[e].x = unitPos[e _i+n/2 ].x; when n is an even number, unitPos[e].x = (unitPos[e _i-1+n/2 ].x + unitPos[e _i+n/2 ].x)/2, that is, the commanding entity is located in the middle of the commanded entity in the horizontal direction;

Where unitPos[e].x is the horizontal grid coordinate of entity e;

As shown in Figure 4, the method flow is as follows:

S5521, let r be the root node entity of the generated subtree, and startx1 be the starting grid coordinate in the horizontal direction;

S5522, initialize the maximum horizontal grid coordinate maxx1 of the spanning subtree = 0;

S5523. Obtain r directed entity set Q from graph G;

S5524, if Q is empty, go to S5525, otherwise go to S5526;

S5525, let the x coordinate of the grid coordinate of r be startx1, that is, unitPos[r].x=maxx1=startx1;

S5526. If the traversal of the set Q has been completed, go to S55212; otherwise, go to S5527;

S5527, get the next entity node a in Q;

S5528, recursive calculation: take startx1 as the starting horizontal grid coordinate, calculate the horizontal grid coordinates of all nodes in the spanning subtree with a as the root node, and output the maximum horizontal grid coordinate maxx2;

S5529, startx1 = maxx2 + 2;

S55210, if maxx1<maxx2, go to S55211, otherwise go to S5526;

S55211, maxx1=maxx2, go to S5526;

S55212, if the number of elements in Q is odd, go to S55213, otherwise go to S55214;

S55213, let the horizontal grid coordinates of r be the horizontal grid coordinates of the middle element in Q, and the process ends;

S55214. Let the horizontal grid coordinate of r be the average of the horizontal grid coordinates of the two middle elements in Q. The process ends.

The present invention provides a method for automatically laying out a command relationship hierarchy structure dynamically visualized. When a graph G is changed (including adding entities, deleting entities, adding command relationships, and deleting command relationships), the above method is used to recalculate the grid coordinates unitPos of the military entity;

According to the latest grid coordinate unitPos, the military entities and the command relationships between them are visually drawn at the corresponding coordinates in the drawing area to achieve the effect shown in Figure 7.

Those of ordinary skill in the art will appreciate that the units and method steps of each example described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, computer software, or a combination of the two. In order to clearly illustrate the interchangeability of hardware and software, the composition and steps of each example have been generally described in terms of function in the above description. Whether these functions are performed in hardware or software depends on the specific application and design constraints of the technical solution. Professional and technical personnel can use different methods to implement the described functions for each specific application, but such implementation should not be considered to be beyond the scope of the present invention.

In the several embodiments provided in the present application, it should be understood that the disclosed methods and systems can be implemented in other ways. For example, the division of the units described above is only a logical function division, and there may be other division methods in actual implementation, such as multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. The above-mentioned units may or may not be physically separated, and the components displayed as units may or may not be physical units, that is, they may be located in one place, or they may be distributed on multiple network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the embodiments of the present invention.

Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention, rather than to limit it. Although the present invention has been described in detail with reference to the aforementioned embodiments, those skilled in the art should understand that they can still modify the technical solutions described in the aforementioned embodiments, or replace some or all of the technical features therein by equivalents. These modifications or replacements do not make the essence of the corresponding technical solutions deviate from the scope of the technical solutions of the embodiments of the present invention, and they should all be included in the scope of the claims and specification of the present invention.

The above description is only a preferred embodiment of the present invention and is not intended to limit the present invention. Any modifications, equivalent substitutions, improvements, etc. made within the spirit and principle of the present invention should be included in the protection scope of the present invention.

Claims (4)

1. A method for dynamic visualization and automatic layout of command relationship hierarchical structure, characterized by: When the command relationship between group entities with hierarchical command relationships changes dynamically, the command relationship tree-like hierarchical structure is maintained for visual automatic layout; the command relationship dynamic change includes but is not limited to adding entities, deleting entities, adding command relationships, and deleting command relationships; the command relationship is a directional identifier, from the commanding entity to the commanded entity; The tree-like hierarchical structure visualization automatic layout is used to visualize the layout of each connected subgraph in the command relationship graph using a tree-like hierarchical structure; When the commanding entity is laid out, it is located at the upper level of the commanded entity in the vertical direction and in the middle of all the commanded entities in the horizontal direction. Multiple connected subgraphs are laid out and displayed in parallel horizontally. The steps include: S1. A directed graph data structure G(V,E) is used to represent the command relationship of group entities with a hierarchical command relationship, where the node set V represents the group entity with a hierarchical command relationship, and the edge set E represents the command relationship; S2. Grid the drawing area, with the grid origin located at the upper left corner with coordinates (0, 0); S3, using a hash table unitPos<key, value> to record the grid coordinates of all group entities with a hierarchical command relationship, where key represents the unique identifier of the group entity with a hierarchical command relationship, and value is the grid coordinate; S4. Initialize the grid coordinates of all group entities with hierarchical command relationships in unitPos to (-1,-1); S5, calculating the grid coordinate unitPos of the tree-like hierarchical structure layout of the group entity with a hierarchical command relationship according to the directed graph data structure G; S6. Visually draw the group entities with the hierarchical command relationship and the command relationship between them at the corresponding coordinates in the drawing area according to the grid coordinates unitPos of the group entities with the hierarchical command relationship; In step S5, the method for calculating the grid coordinates of the tree-like hierarchical structure layout of the group entities with a hierarchical command relationship is specifically as follows: S51, let startx be the starting horizontal grid coordinate, and starty be the starting vertical grid coordinate; S52, obtaining a highest command entity node set C from the command relationship graph G, wherein the highest command entity node refers to a node without incident edges in the graph G; S53, if all nodes in the set C have been traversed, the calculation process ends, otherwise go to S54; S54, obtaining the next highest command entity node r in C; S55, using startx as the starting horizontal grid coordinate and starty as the starting vertical grid coordinate as parameters, calculating the grid coordinates of all node entities in the spanning subtree with r as the root node, and outputting the maximum horizontal grid coordinate maxx and the maximum vertical grid coordinate maxy, wherein the spanning subtree refers to the spanning subtree of the command relationship graph G with r as the root node and consisting of the node r and all its connected nodes; S56, set startx=maxx+2, and go to S53; In step S55, the calculation method for generating the grid coordinates of the node entity in the subtree includes: Calculate the vertical grid coordinates of all node entities in the generated subtree; Calculates the horizontal grid coordinates of all node entities in the generated subtree. 2. The command relationship hierarchical structure dynamic visualization automatic layout method according to claim 1 is characterized in that: the command relationship is a directed arrow. 3. The method for dynamic visualization and automatic layout of command relationship hierarchy structure according to claim 1 is characterized in that the method for calculating the vertical grid coordinates of all node entities in the generated subtree specifically comprises: Perform a pre-root traversal on the spanning subtree and recursively calculate the vertical grid coordinates of all node entities; If entity _e1 commands entity _e2 , then unitPos[e2 _] .y=unitPos[ _e1 ].y+2, where unitPos[ _e1 ].y and unitPos[ _e2 ].y are the vertical grid coordinates of entities _e1 and _e2 respectively. 4. The method for dynamic visualization and automatic layout of command relationship hierarchy structure according to claim 1 is characterized in that the method for calculating the horizontal grid coordinates of all node entities in the generated subtree specifically comprises: Perform post-root traversal on the generated subtree and recursively calculate the horizontal grid coordinates of all node entities; Assuming that the entity set e _i+1 ,e _i+2 ,…e _i+n is the set of directed entities of entity e, we have: unitPos[e _i+2 ].x＝unitPos[e _i+1 ].x+2; When n is an odd number, unitPos[e].x = unitPos[e _i+n/2 ].x; when n is an even number, unitPos[e].x = (unitPos[e _i-1+n/2 ].x + unitPos[e _i+n/2 ].x)/2, that is, the commanding entity is located in the middle of the commanded entity in the horizontal direction; where unitPos[e].x is the horizontal grid coordinate of entity e.