CN112650899A - Data visualization rendering method and device, computer equipment and storage medium - Google Patents
Data visualization rendering method and device, computer equipment and storage medium Download PDFInfo
- Publication number
- CN112650899A CN112650899A CN202011614903.0A CN202011614903A CN112650899A CN 112650899 A CN112650899 A CN 112650899A CN 202011614903 A CN202011614903 A CN 202011614903A CN 112650899 A CN112650899 A CN 112650899A
- Authority
- CN
- China
- Prior art keywords
- node
- rendering
- nodes
- tree
- target
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/904—Browsing; Visualisation therefor
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/901—Indexing; Data structures therefor; Storage structures
- G06F16/9027—Trees
Landscapes
- Engineering & Computer Science (AREA)
- Databases & Information Systems (AREA)
- Theoretical Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Software Systems (AREA)
- User Interface Of Digital Computer (AREA)
Abstract
The invention relates to the technical field of artificial intelligence, and provides a data visualization rendering method, a device, computer equipment and a storage medium, wherein the data visualization rendering method comprises the following steps: responding to a data rendering request, and acquiring a tree structure of data; determining a root node of the tree structure, and calculating a first position of the root node according to a first parameter of the browser; traversing the tree structure from the root node to the leaf node of the last level downwards, and calculating the second position of the leaf node of the last level according to the second parameter of the browser; traversing the tree structure upwards from the leaf node of the last level in the tree structure, and calculating the third position of the leaf node of each level in the rendering tree to be generated according to the first position and the second position; rendering the rendering tree to be generated according to the position of each node, wherein parent and child nodes in the rendering tree are located in the same level, and brother nodes are in an upper level and a lower level. The rendering tree generated by the invention can be completely displayed in the window of the browser.
Description
Technical Field
The invention relates to the technical field of artificial intelligence, in particular to a data visualization rendering method and device, computer equipment and a storage medium.
Background
The data are displayed visually, so that the data are more clearly represented and easier to understand. The visualization presentation may be, for example, a form of representing data as a graph; and the process of representing data as graphics may be referred to as visual rendering. One type of data is hierarchical data, each node and the relationship between nodes can be included in the type of data, and the hierarchical data can be visually rendered into a tree-shaped graph so as to clearly show the connection relationship between the nodes.
The inventor finds that in the process of implementing the invention, when the tree-shaped graph is rendered, the father node diverges up and down or diverges left and right towards the child node, when the structure of the tree-shaped graph is complex, more information is difficult to display in one window, and the tree-shaped graph is displayed unfriendly.
Disclosure of Invention
In view of the foregoing, it is desirable to provide a data visualization rendering method, apparatus, computer device and storage medium, where the generated rendering tree can be fully displayed in a window of a browser.
A first aspect of the present invention provides a data visualization rendering method, including:
responding to a data rendering request, and acquiring a tree structure of data in the data rendering request;
determining a root node of the tree structure, and calculating a first position of the root node in a rendering tree to be generated according to a first parameter of a browser;
traversing the tree structure from the root node to a leaf node of a last level downwards, and calculating a second position of the leaf node of the last level in the rendering tree to be generated according to a second parameter of the browser;
traversing the tree structure from the leaf node of the last level in the tree structure upwards, and calculating the third position of the leaf node of each level in the rendering tree to be generated according to the first position and the second position;
rendering the rendering tree to be generated according to the position of each node, wherein parent and child nodes in the rendering tree are located in the same level, and brother nodes are in an upper level and a lower level.
In an optional embodiment, the method further comprises:
in response to a folding instruction of a first target node, calculating a node height and a value of a leaf node of the first target node;
determining a first node height of a next-level brother node of the first target node;
calculating a first moving height of the next-level brother node according to the node height and the value and the first node height;
folding all child nodes of the first target node, and moving all child nodes of the next sibling node and the next sibling node upward by the first moving height.
In an optional embodiment, the method further comprises:
responding to a folding instruction of a second target node, and determining a superior brother node of the second target node;
judging whether the superior brother node has a leaf child node;
when the upper-level brother node has leaf nodes, determining the second node height of a second-level leaf node in the leaf nodes of the upper-level brother node;
calculating a second moving height of the second target node according to the second node height and the node height of the second target node;
collapsing all children of the second target node and moving the second target node upward by the second travel height.
In an optional embodiment, the method further comprises:
when the upper-level brother node has no leaf node, calculating a third moving height of the second target node according to the node height of the upper-level brother node and the node height of the second target node;
collapsing all children of the second target node and moving the second target node upward by the third travel height.
In an optional embodiment, the method further comprises:
in response to a hybrid rendering request of a specified node, identifying a node type of the specified node in the hybrid rendering request;
when the node type is a closed node, determining a plurality of designated father nodes and designated child nodes in the designated nodes according to the mixed rendering request, and drawing directed line segments pointing to the designated child nodes from each designated father node;
when the node type is an adjacent node, determining two specified brother nodes in the specified nodes according to the mixed rendering request, and drawing a undirected line segment between the two specified brother nodes;
and when the node type is a virtual node, not displaying the specified node.
In an optional embodiment, the method further comprises:
responding to a dragging instruction of a display node in a rendering interface, and displaying a rendering display node in the rendering tree according to the dragging instruction;
obtaining a rendering description of the rendering display node;
determining a rendering parent node of the display node according to the rendering description;
generating a render line segment between the render parent node and the render display node.
In an optional embodiment, the method further comprises:
determining whether a target rendering node in the rendering tree is a leaf node of a last level in response to a delete instruction of the target rendering node;
when the target rendering node is the leaf node of the last level, deleting the target rendering node;
and when the target rendering node is not the leaf node of the last level, deleting the target rendering node and all the child rendering nodes of the target rendering node.
A second aspect of the present invention provides a data visualization rendering apparatus, the apparatus comprising:
the request response module is used for responding to a data rendering request and acquiring a tree structure of data in the data rendering request;
the first calculation module is used for determining a root node of the tree structure and calculating a first position of the root node in a rendering tree to be generated according to a first parameter of a browser;
a second calculating module, configured to traverse the tree structure from the root node to a leaf node of a last level, and calculate, according to a second parameter of the browser, a second position of the leaf node of the last level in the rendering tree to be generated;
a third calculation module, configured to traverse the tree structure upward from a leaf node of a last level in the tree structure, and calculate a third position of the leaf node of each level in the rendering tree to be generated according to the first position and the second position;
and the node rendering module is used for rendering the rendering tree to be generated according to the position of each node, wherein parent and child nodes in the rendering tree are positioned in the same level, and brother nodes are in upper and lower levels.
A third aspect of the invention provides a computer apparatus comprising a processor for implementing the data visualization rendering method when executing a computer program stored in a memory.
A fourth aspect of the invention provides a computer-readable storage medium having stored thereon a computer program which, when executed by a processor, implements the data visualization rendering method.
In summary, the data visualization rendering method, the data visualization rendering device, the computer device and the storage medium according to the present invention can not only render the data of the tree structure according to the first parameter and the second parameter of the browser to generate the rendering tree, so that the generated rendering tree can be completely displayed in the window of the browser, thereby enabling the user to obtain more information in the limited visual range; and the rendering tree is horizontally dispersed downwards all the time by the root node, so that the relation trend and the hierarchical relation of the whole tree can be seen more visually, and the user experience is improved.
Drawings
Fig. 1 is a flowchart of a data visualization rendering method according to an embodiment of the present invention.
Fig. 2 is a schematic diagram of a generated rendering tree according to an embodiment of the present invention.
Fig. 3 is a structural diagram of a data visualization rendering apparatus according to a second embodiment of the present invention.
Fig. 4 is a schematic structural diagram of a computer device according to a third embodiment of the present invention.
Detailed Description
In order that the above objects, features and advantages of the present invention can be more clearly understood, a detailed description of the present invention will be given below with reference to the accompanying drawings and specific embodiments. It should be noted that the embodiments of the present invention and features of the embodiments may be combined with each other without conflict.
Unless defined otherwise, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this invention belongs. The terminology used in the description of the invention herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the invention.
The data visualization rendering method provided by the embodiment of the invention is executed by computer equipment, and accordingly, the data visualization rendering device runs in the computer equipment.
Fig. 1 is a flowchart of a data visualization rendering method according to an embodiment of the present invention. The data visualization rendering method specifically comprises the following steps, and the sequence of the steps in the flowchart can be changed and some steps can be omitted according to different requirements.
S11, responding to the data rendering request, and acquiring the tree structure of the data in the data rendering request.
The user may upload the data of the tree structure to the rendering platform to trigger a data rendering request, requesting to render the data of the tree structure into a rendering tree meeting the display requirements of the browser, so that all the data can be completely displayed in one window of the browser.
The rendering platform receives data of the tree structure uploaded by a user, namely receives a data rendering request, responds to the data rendering request, and acquires the tree structure of the data from the data rendering request.
The tree structure includes a plurality of nodes, each node stores a piece of data, which may be a course knowledge point, or data related to the user, such as basic data (gender, age), work experience, and the like.
S12, determining a root node of the tree structure, and calculating a first position of the root node in a rendering tree to be generated according to a first parameter of the browser.
And the rendering platform starts to traverse the tree structure layer by layer from the root node of the tree structure, the hierarchy of the recording tree structure is increased by 1 when one layer is traversed, and the number of the recording leaf nodes is increased by 1 when one layer is traversed.
Obtaining the last record of the hierarchy of the tree structure to obtain the maximum hierarchy of the tree structure; and acquiring the final record of the leaf nodes of the tree structure to obtain the node number of all the leaf nodes.
And calculating a first position of the root node in the rendering tree to be generated according to the first parameter of the browser.
The first parameter of the browser may refer to a height of an interface that can be displayed by the browser.
Having determined the first parameter of the browser, a first position of the root node in the rendering tree to be generated may be determined, which may be (0, the first parameter).
And S13, traversing the tree structure from the root node to the leaf node of the last level, and calculating the second position of the leaf node of the last level in the rendering tree to be generated according to the second parameter of the browser.
Wherein, a leaf node refers to a node without a child node.
The second parameter of the browser may refer to a width of an interface that can be displayed by the browser.
The leaf nodes of the tree structure may be located at multiple levels, and the rendering platform traverses the tree structure layer by layer from the root node down until the leaf nodes of the last level of the tree structure determine the number of leaf nodes of the last level.
And when the number of the leaf nodes of the last level is 1, calculating a second position of the only leaf node of the last level according to a second parameter of the browser, wherein the second position is (second parameter, 0).
When the number of the leaf nodes of the last level is not 1, determining the rightmost leaf node in the leaf nodes of the last level in the tree structure, and then calculating a second position of the rightmost leaf node of the last level according to a second parameter of the browser, wherein the second position is (second parameter, 0). And traversing other leaf nodes of the last level of the tree structure from right to left, and determining second positions of other leaf nodes of the last level according to the second positions of the leaf nodes at the rightmost side of the last level. For example, assuming that there are two leaf nodes in the last level of the tree structure, and the second position of the leaf node at the rightmost side of the last level is (second parameter, 0), the second position of another leaf node in the last level may be (second parameter, h1), where h1 is a preset height distance between leaf nodes in the upper and lower two levels.
In an alternative embodiment, h1 can also be determined according to the first parameter of the browser and the maximum level of the treelike structure. For example, the ratio between the first parameter of the browser and the maximum level is determined to be h 1.
In an optional embodiment, the width interval between two nodes in the same level may also be determined according to the second parameter of the browser and the number of all leaf nodes. For example, the ratio between the second parameter of the browser and the number of all leaf nodes is determined as the width interval between two nodes in the same hierarchy.
The same node height difference may be set for leaf nodes under the same father node, and different node height differences may be set for leaf nodes under the same father node. The same node height difference can be set between leaf nodes under different father nodes, or different node height differences can be set between leaf nodes under different father nodes.
And S14, traversing the tree structure from the leaf node of the last level in the tree structure upwards, and calculating the third position of the leaf node of each level in the rendering tree to be generated according to the first position and the second position.
After the position of the leaf node of the last level is determined, traversing the tree structure from the leaf node of the last level in the tree structure layer by layer upwards, calculating the position of the leaf node of the second level from the last, then calculating the position of the leaf node of the third level from the last, and so on until the position of the leaf node of the second level is calculated.
And determining the rightmost leaf node in a plurality of leaf nodes under the same father node in the tree structure as the leaf node of the lowest level under the father node in the rendering tree to be generated. The positions of leaf nodes of the previous level are dynamically calculated based on the positions of leaf nodes of all next levels belonging to the same parent node as the previous level and the height of each next level plus the height of child nodes of the node.
And S15, rendering the rendering tree to be generated according to the position of each node, wherein the parent and child nodes in the rendering tree are positioned at the same level, and the brother nodes are positioned at the upper level and the lower level.
After the position of each node in the rendering tree to be generated is determined, the relative relationship (brother relationship and father-child relationship) of each node in the tree structure is determined, and the line segments between the nodes are drawn according to the relative relationship, so that the rendering process of the rendering tree to be generated is completed.
As shown in fig. 2, is a schematic diagram of the generated rendering tree. In fig. 2, node 1 is a root node, and nodes 2 and 3 are child nodes of the root node 1, but node 2 and node 1 are located at the same level, and nodes 2 and 3 are sibling nodes, but node 2 and node 3 are located at upper and lower levels.
First, a first position of the node 1 is calculated according to a first parameter of the browser, for example, the first position (0, a first parameter) of the node 1; then, calculating a second position of the node 11 according to a second parameter of the browser, for example, the second position of the node 11 (second parameter, 0); since the node 9 is a father node of the node 11 and the node 6 is a father node of the node 9, the node 6, the node 9 and the node 11 are located in the same level, the third position of the calculation node 9 is (second parameter-node width interval, 0), and the third position of the calculation node 6 is (second parameter-2 times node width interval, 0); since the nodes 5 and 6 belong to sibling nodes, the nodes 5 and 6 are in an upper-lower hierarchy, and the third position of the node 5 is calculated as (the second parameter is-2 times the node width spacing and the node height spacing).
Therefore, the rendering tree generated by the method is different from the tree structure of the traditional binary tree, the method can be used for rendering the data of the tree structure according to the first parameter and the second parameter of the browser to generate the rendering tree, so that the generated rendering tree can be completely displayed in a window of the browser, and a user can acquire more information in a limited visual range; and the rendering tree is horizontally dispersed downwards all the time by the root node, so that the relation trend and the hierarchical relation of the whole tree can be seen more visually, and the user experience is improved.
In an optional embodiment, the method further comprises:
in response to a folding instruction of a first target node, calculating a node height and a value of a leaf node of the first target node;
determining a first node height of a next-level brother node of the first target node;
calculating a first moving height of the next-level brother node according to the node height and the value and the first node height;
folding all child nodes of the first target node, and moving all child nodes of the next sibling node and the next sibling node upward by the first moving height.
When a certain node has a leaf node, a folding button is displayed on the node, and the folding button can be a virtual icon. All the child nodes of the node can be folded by touching the folding button on the node, and all the child nodes of the node can be unfolded by touching the folding button on the node again.
And obtaining the node height and the value through the node heights of all leaf nodes of the first target node. The next sibling node refers to a node located below the first target node.
Illustratively, touching the fold button on node 3 can fold all the children nodes (node 5, node 6, node 8, node 9, and node 10) of node 3, i.e., no more nodes 5, 6, 8, 9, and 10 are displayed in the render tree. And the leaf nodes of the node 3 are the node 5 and the node 6, the difference between the node heights of the node 5 and the node 6 is calculated to obtain the node height sum value, and then the sibling node of the next level of the node 3 is moved upwards by the node height sum value.
In this optional embodiment, after the first target node is folded, a large amount of space is left, and then all the subordinate sibling nodes and all the child nodes of each subordinate sibling node under the first target node may be moved upward, so that the layout of the entire rendering tree in the display interface of the rendering platform is more reasonable.
In an optional embodiment, the method further comprises:
responding to a folding instruction of a second target node, and determining a superior brother node of the second target node;
judging whether the superior brother node has a leaf child node;
when the upper-level brother node has leaf nodes, determining the second node height of a second-level leaf node in the leaf nodes of the upper-level brother node;
calculating a second moving height of the second target node according to the second node height and the node height of the second target node;
collapsing all children of the second target node and moving the second target node upward by the second travel height.
The second moving height of the second target node may be obtained by calculating a node height difference between the second node height and the node height of the second target node.
In this alternative embodiment, the second target node is folded, and since all leaf nodes of the second target node are hidden, the second target node may be moved upward, so that the second target node is located on a level below the upper sibling node.
In an optional embodiment, the method further comprises:
when the upper-level brother node has no leaf node, calculating a third moving height of the second target node according to the node height of the upper-level brother node and the node height of the second target node;
collapsing all children of the second target node and moving the second target node upward by the third travel height.
In this optional embodiment, the third moving height of the second target node is calculated according to the node height of the upper sibling node and the node height of the second target node, so that the second target node is accurately moved.
In an optional embodiment, the method further comprises:
in response to a hybrid rendering request of a specified node, identifying a node type of the specified node in the hybrid rendering request;
when the node type is a closed node, determining a plurality of designated father nodes and designated child nodes in the designated nodes according to the mixed rendering request, and drawing directed line segments pointing to the designated child nodes from each designated father node;
when the node type is an adjacent node, determining two specified brother nodes in the specified nodes according to the mixed rendering request, and drawing a undirected line segment between the two specified brother nodes;
and when the node type is a virtual node, not displaying the specified node.
A corresponding node type may be added to each node to distinguish the relationship between the nodes, and the node type may include: closed nodes, adjacent nodes, common nodes and virtual nodes. And combining corresponding node relations according to different node types, drawing line segments between the connected nodes according to the node relations, and when the nodes are configured to be virtual nodes, the rendered virtual nodes cannot be displayed.
In the optional embodiment, by setting the node type for the node, when the node type is a closed node, the effect that a plurality of father nodes aggregate to the same child node can be realized, when the node type is an adjacent node, the effect that two brother nodes are connected can be realized, and when the node type is a virtual node, the effect that a plurality of root nodes exist in the same rendering tree is indirectly realized by hiding the virtual node, so that the technical defects that the tree structure of the traditional binary tree is solved, only one root node exists in one binary tree, only one father node exists in each child node, and brother nodes cannot be connected are overcome.
In an optional embodiment, the method further comprises:
responding to a dragging instruction of a display node in a rendering interface, and displaying a rendering display node in the rendering tree according to the dragging instruction;
obtaining a rendering description of the rendering display node;
determining a rendering parent node of the display node according to the rendering description;
generating a render line segment between the render parent node and the render display node.
The rendering interface may include two parts, a first part for displaying the rendering tree, and a second part for displaying the plurality of display nodes and the rendering description frame, where each display node may be distinguished by different shapes or colors, for example, a first color corresponds to a display node being a root node, a second color corresponds to a display node being a parent node, and a third color corresponds to a display node being a leaf node of the first hierarchy.
A user can drag a certain display node of the second part to the first part in a dragging mode, and therefore the effect of increasing rendering nodes in the rendering tree is achieved.
Before dragging a display node, a user may input a rendering description of the display node to be dragged in a rendering description box, where the rendering description may include a rendering parent node, a rendering color, a rendering name, and the like.
In the optional embodiment, after the display node is dragged and the rendering parent node is determined according to the rendering description, the rendering tree can be rendered again to generate a new rendering tree, the updating efficiency of the rendering tree is high, and the implementation is simple.
In an optional embodiment, the method further comprises:
determining whether a target rendering node in the rendering tree is a leaf node of a last level in response to a delete instruction of the target rendering node;
when the target rendering node is the leaf node of the last level, deleting the target rendering node;
and when the target rendering node is not the leaf node of the last level, deleting the target rendering node and all the child rendering nodes of the target rendering node.
Wherein the deleting instruction may be triggered by the touch time exceeding a preset time threshold.
And when the target rendering node is not the leaf node of the last level, displaying a prompt box for prompting whether to delete the target rendering node and all the child rendering nodes of the target rendering node. And when a determination instruction of a user is received, deleting the target rendering node and all the child rendering nodes of the target rendering node.
It is emphasized that the render tree may be stored in a node of the blockchain in order to further ensure the privacy and security of the render tree.
Fig. 3 is a structural diagram of a data visualization rendering apparatus according to a second embodiment of the present invention.
In some embodiments, the data visualization rendering device 20 may include a plurality of functional modules made up of computer program segments. The computer program of each program segment in the data visualization rendering apparatus 20 may be stored in a memory of a computer device and executed by at least one processor to perform (see fig. 1 for details) the functions of data visualization rendering.
In this embodiment, the data visualization rendering device 20 may be divided into a plurality of functional modules according to the functions performed by the device. The functional module may include: a request response module 201, a first calculation module 202, a second calculation module 203, a third calculation module 204, a node rendering module 205, a first folding module 206, a second folding module 207, a hybrid rendering module 208, a node dragging module 209, and a node deleting module 210. The module referred to herein is a series of computer program segments capable of being executed by at least one processor and capable of performing a fixed function and is stored in memory. In the present embodiment, the functions of the modules will be described in detail in the following embodiments.
The request response module 201 is configured to respond to a data rendering request, and obtain a tree structure of data in the data rendering request.
The user may upload the data of the tree structure to the rendering platform to trigger a data rendering request, requesting to render the data of the tree structure into a rendering tree meeting the display requirements of the browser, so that all the data can be completely displayed in one window of the browser.
The rendering platform receives data of the tree structure uploaded by a user, namely receives a data rendering request, responds to the data rendering request, and acquires the tree structure of the data from the data rendering request.
The tree structure includes a plurality of nodes, each node stores a piece of data, which may be a course knowledge point, or data related to the user, such as basic data (gender, age), work experience, and the like.
The first calculating module 202 is configured to determine a root node of the tree structure, and calculate a first position of the root node in a rendering tree to be generated according to a first parameter of a browser.
And the rendering platform starts to traverse the tree structure layer by layer from the root node of the tree structure, the hierarchy of the recording tree structure is increased by 1 when one layer is traversed, and the number of the recording leaf nodes is increased by 1 when one layer is traversed.
Obtaining the last record of the hierarchy of the tree structure to obtain the maximum hierarchy of the tree structure; and acquiring the final record of the leaf nodes of the tree structure to obtain the node number of all the leaf nodes.
And calculating a first position of the root node in the rendering tree to be generated according to the first parameter of the browser.
The first parameter of the browser may refer to a height of an interface that can be displayed by the browser.
Having determined the first parameter of the browser, a first position of the root node in the rendering tree to be generated may be determined, which may be (0, the first parameter).
The second calculating module 203 is configured to traverse the tree structure from the root node to a leaf node of a last level, and calculate a second position of the leaf node of the last level in the rendering tree to be generated according to a second parameter of the browser.
Wherein, a leaf node refers to a node without a child node.
The second parameter of the browser may refer to a width of an interface that can be displayed by the browser.
The leaf nodes of the tree structure may be located at multiple levels, and the rendering platform traverses the tree structure layer by layer from the root node down until the leaf nodes of the last level of the tree structure determine the number of leaf nodes of the last level.
And when the number of the leaf nodes of the last level is 1, calculating a second position of the only leaf node of the last level according to a second parameter of the browser, wherein the second position is (second parameter, 0).
When the number of the leaf nodes of the last level is not 1, determining the rightmost leaf node in the leaf nodes of the last level in the tree structure, and then calculating a second position of the rightmost leaf node of the last level according to a second parameter of the browser, wherein the second position is (second parameter, 0). And traversing other leaf nodes of the last level of the tree structure from right to left, and determining second positions of other leaf nodes of the last level according to the second positions of the leaf nodes at the rightmost side of the last level. For example, assuming that there are two leaf nodes in the last level of the tree structure, and the second position of the leaf node at the rightmost side of the last level is (second parameter, 0), the second position of another leaf node in the last level may be (second parameter, h1), where h1 is a preset height distance between leaf nodes in the upper and lower two levels.
In an alternative embodiment, h1 can also be determined according to the first parameter of the browser and the maximum level of the treelike structure. For example, the ratio between the first parameter of the browser and the maximum level is determined to be h 1.
In an optional embodiment, the width interval between two nodes in the same level may also be determined according to the second parameter of the browser and the number of all leaf nodes. For example, the ratio between the second parameter of the browser and the number of all leaf nodes is determined as the width interval between two nodes in the same hierarchy.
The same node height difference may be set for leaf nodes under the same father node, and different node height differences may be set for leaf nodes under the same father node. The same node height difference can be set between leaf nodes under different father nodes, or different node height differences can be set between leaf nodes under different father nodes.
The third calculating module 204 is configured to traverse the tree structure from a leaf node of a last level in the tree structure upwards, and calculate a third position of the leaf node of each level in the rendering tree to be generated according to the first position and the second position.
After the position of the leaf node of the last level is determined, traversing the tree structure from the leaf node of the last level in the tree structure layer by layer upwards, calculating the position of the leaf node of the second level from the last, then calculating the position of the leaf node of the third level from the last, and so on until the position of the leaf node of the second level is calculated.
And determining the rightmost leaf node in a plurality of leaf nodes under the same father node in the tree structure as the leaf node of the lowest level under the father node in the rendering tree to be generated. The positions of leaf nodes of the previous level are dynamically calculated based on the positions of leaf nodes of all next levels belonging to the same parent node as the previous level and the height of each next level plus the height of child nodes of the node.
The node rendering module 205 is configured to render the rendering tree to be generated according to the position of each node, where parent and child nodes in the rendering tree are located in the same level, and sibling nodes are in upper and lower levels.
After the position of each node in the rendering tree to be generated is determined, the relative relationship (brother relationship and father-child relationship) of each node in the tree structure is determined, and the line segments between the nodes are drawn according to the relative relationship, so that the rendering process of the rendering tree to be generated is completed.
As shown in fig. 2, is a schematic diagram of the generated rendering tree. In fig. 2, node 1 is a root node, and nodes 2 and 3 are child nodes of the root node 1, but node 2 and node 1 are located at the same level, and nodes 2 and 3 are sibling nodes, but node 2 and node 3 are located at upper and lower levels.
First, a first position of the node 1 is calculated according to a first parameter of the browser, for example, the first position (0, a first parameter) of the node 1; then, calculating a second position of the node 11 according to a second parameter of the browser, for example, the second position of the node 11 (second parameter, 0); since the node 9 is a father node of the node 11 and the node 6 is a father node of the node 9, the node 6, the node 9 and the node 11 are located in the same level, the third position of the calculation node 9 is (second parameter-node width interval, 0), and the third position of the calculation node 6 is (second parameter-2 times node width interval, 0); since the nodes 5 and 6 belong to sibling nodes, the nodes 5 and 6 are in an upper-lower hierarchy, and the third position of the node 5 is calculated as (the second parameter is-2 times the node width spacing and the node height spacing).
Therefore, the rendering tree generated by the device is different from the tree structure of the traditional binary tree, the data of the tree structure can be rendered according to the first parameter and the second parameter of the browser to generate the rendering tree, so that the generated rendering tree can be completely displayed in a window of the browser, and a user can acquire more information in a limited visual range; and the rendering tree is horizontally dispersed downwards all the time by the root node, so that the relation trend and the hierarchical relation of the whole tree can be seen more visually, and the user experience is improved.
The first folding module 206, configured to calculate a node height and a value of a leaf node of a first target node in response to a folding instruction of the first target node; determining a first node height of a next-level brother node of the first target node; calculating a first moving height of the next-level brother node according to the node height and the value and the first node height; folding all child nodes of the first target node, and moving all child nodes of the next sibling node and the next sibling node upward by the first moving height.
When a certain node has a leaf node, a folding button is displayed on the node, and the folding button can be a virtual icon. All the child nodes of the node can be folded by touching the folding button on the node, and all the child nodes of the node can be unfolded by touching the folding button on the node again.
And obtaining the node height and the value through the node heights of all leaf nodes of the first target node. The next sibling node refers to a node located below the first target node.
Illustratively, touching the fold button on node 3 can fold all the children nodes (node 5, node 6, node 8, node 9, and node 10) of node 3, i.e., no more nodes 5, 6, 8, 9, and 10 are displayed in the render tree. And the leaf nodes of the node 3 are the node 5 and the node 6, the difference between the node heights of the node 5 and the node 6 is calculated to obtain the node height sum value, and then the sibling node of the next level of the node 3 is moved upwards by the node height sum value.
In this optional embodiment, after the first target node is folded, a large amount of space is left, and then all the subordinate sibling nodes and all the child nodes of each subordinate sibling node under the first target node may be moved upward, so that the layout of the entire rendering tree in the display interface of the rendering platform is more reasonable.
The second folding module 207 is configured to determine, in response to a folding instruction of a second target node, a superior sibling node of the second target node; judging whether the superior brother node has a leaf child node; when the upper-level brother node has leaf nodes, determining the second node height of a second-level leaf node in the leaf nodes of the upper-level brother node; calculating a second moving height of the second target node according to the second node height and the node height of the second target node; collapsing all children of the second target node and moving the second target node upward by the second travel height.
The second moving height of the second target node may be obtained by calculating a node height difference between the second node height and the node height of the second target node.
In this alternative embodiment, the second target node is folded, and since all leaf nodes of the second target node are hidden, the second target node may be moved upward, so that the second target node is located on a level below the upper sibling node.
In an alternative embodiment, the second folding module 207 is further configured to: when the upper-level brother node has no leaf node, calculating a third moving height of the second target node according to the node height of the upper-level brother node and the node height of the second target node; collapsing all children of the second target node and moving the second target node upward by the third travel height.
In this optional embodiment, the third moving height of the second target node is calculated according to the node height of the upper sibling node and the node height of the second target node, so that the second target node is accurately moved.
The hybrid rendering module 208 is configured to, in response to a hybrid rendering request of a specific node, identify a node type of the specific node in the hybrid rendering request; when the node type is a closed node, determining a plurality of designated father nodes and designated child nodes in the designated nodes according to the mixed rendering request, and drawing directed line segments pointing to the designated child nodes from each designated father node; when the node type is an adjacent node, determining two specified brother nodes in the specified nodes according to the mixed rendering request, and drawing a undirected line segment between the two specified brother nodes; and when the node type is a virtual node, not displaying the specified node.
A corresponding node type may be added to each node to distinguish the relationship between the nodes, and the node type may include: closed nodes, adjacent nodes, common nodes and virtual nodes. And combining corresponding node relations according to different node types, drawing line segments between the connected nodes according to the node relations, and when the nodes are configured to be virtual nodes, the rendered virtual nodes cannot be displayed.
In the optional embodiment, by setting the node type for the node, when the node type is a closed node, the effect that a plurality of father nodes aggregate to the same child node can be realized, when the node type is an adjacent node, the effect that two brother nodes are connected can be realized, and when the node type is a virtual node, the effect that a plurality of root nodes exist in the same rendering tree is indirectly realized by hiding the virtual node, so that the technical defects that the tree structure of the traditional binary tree is solved, only one root node exists in one binary tree, only one father node exists in each child node, and brother nodes cannot be connected are overcome.
The node dragging module 209 is configured to respond to a dragging instruction of a display node in a rendering interface, and display a rendering display node in the rendering tree according to the dragging instruction; obtaining a rendering description of the rendering display node; determining a rendering parent node of the display node according to the rendering description; generating a render line segment between the render parent node and the render display node.
The rendering interface may include two parts, a first part for displaying the rendering tree, and a second part for displaying the plurality of display nodes and the rendering description frame, where each display node may be distinguished by different shapes or colors, for example, a first color corresponds to a display node being a root node, a second color corresponds to a display node being a parent node, and a third color corresponds to a display node being a leaf node of the first hierarchy.
A user can drag a certain display node of the second part to the first part in a dragging mode, and therefore the effect of increasing rendering nodes in the rendering tree is achieved.
Before dragging a display node, a user may input a rendering description of the display node to be dragged in a rendering description box, where the rendering description may include a rendering parent node, a rendering color, a rendering name, and the like.
In the optional embodiment, after the display node is dragged and the rendering parent node is determined according to the rendering description, the rendering tree can be rendered again to generate a new rendering tree, the updating efficiency of the rendering tree is high, and the implementation is simple.
The node deleting module 210 is configured to determine whether a target rendering node in the rendering tree is a leaf node of a last level in response to a deleting instruction of the target rendering node; when the target rendering node is the leaf node of the last level, deleting the target rendering node; and when the target rendering node is not the leaf node of the last level, deleting the target rendering node and all the child rendering nodes of the target rendering node.
Wherein the deleting instruction may be triggered by the touch time exceeding a preset time threshold.
And when the target rendering node is not the leaf node of the last level, displaying a prompt box for prompting whether to delete the target rendering node and all the child rendering nodes of the target rendering node. And when a determination instruction of a user is received, deleting the target rendering node and all the child rendering nodes of the target rendering node.
It is emphasized that the render tree may be stored in a node of the blockchain in order to further ensure the privacy and security of the render tree.
Fig. 4 is a schematic structural diagram of a computer device according to a third embodiment of the present invention. In the preferred embodiment of the present invention, the computer device 3 includes a memory 31, at least one processor 32, at least one communication bus 33, and a transceiver 34.
It will be appreciated by those skilled in the art that the configuration of the computer device shown in fig. 3 does not constitute a limitation of the embodiments of the present invention, and may be a bus-type configuration or a star-type configuration, and that the computer device 3 may include more or less hardware or software than those shown, or a different arrangement of components.
In some embodiments, the computer device 3 is a device capable of automatically performing numerical calculation and/or information processing according to instructions set or stored in advance, and the hardware includes but is not limited to a microprocessor, an application specific integrated circuit, a programmable gate array, a digital processor, an embedded device, and the like. The computer device 3 may also include a client device, which includes, but is not limited to, any electronic product capable of interacting with a client through a keyboard, a mouse, a remote controller, a touch pad, or a voice control device, for example, a personal computer, a tablet computer, a smart phone, a digital camera, etc.
It should be noted that the computer device 3 is only an example, and other electronic products that are currently available or may come into existence in the future, such as electronic products that can be adapted to the present invention, should also be included in the scope of the present invention, and are included herein by reference.
In some embodiments, the memory 31 has stored therein a computer program which, when executed by the at least one processor 32, implements all or part of the steps of the data visualization rendering method as described. The Memory 31 includes a Read-Only Memory (ROM), a Programmable Read-Only Memory (PROM), an Erasable Programmable Read-Only Memory (EPROM), a One-time Programmable Read-Only Memory (OTPROM), an electronically Erasable rewritable Read-Only Memory (Electrically-Erasable Programmable Read-Only Memory (EEPROM)), an optical Read-Only disk (CD-ROM) or other optical disk Memory, a magnetic disk Memory, a tape Memory, or any other medium readable by a computer capable of carrying or storing data.
Further, the computer-readable storage medium may mainly include a storage program area and a storage data area, wherein the storage program area may store an operating system, an application program required for at least one function, and the like; the storage data area may store data created according to the use of the blockchain node, and the like.
The block chain is a novel application mode of computer technologies such as distributed data storage, point-to-point transmission, a consensus mechanism, an encryption algorithm and the like. A block chain (Blockchain), which is essentially a decentralized database, is a series of data blocks associated by using a cryptographic method, and each data block contains information of a batch of network transactions, so as to verify the validity (anti-counterfeiting) of the information and generate a next block. The blockchain may include a blockchain underlying platform, a platform product service layer, an application service layer, and the like.
In some embodiments, the at least one processor 32 is a Control Unit (Control Unit) of the computer device 3, connects various components of the entire computer device 3 by using various interfaces and lines, and executes various functions and processes data of the computer device 3 by running or executing programs or modules stored in the memory 31 and calling data stored in the memory 31. For example, the at least one processor 32, when executing the computer program stored in the memory, implements all or part of the steps of the data visualization rendering method described in the embodiments of the present invention; or realize all or part of the functions of the data visualization rendering device. The at least one processor 32 may be composed of an integrated circuit, for example, a single packaged integrated circuit, or may be composed of a plurality of integrated circuits packaged with the same or different functions, including one or more Central Processing Units (CPUs), microprocessors, digital Processing chips, graphics processors, and combinations of various control chips.
In some embodiments, the at least one communication bus 33 is arranged to enable connection communication between the memory 31 and the at least one processor 32 or the like.
Although not shown, the computer device 3 may further include a power supply (such as a battery) for supplying power to each component, and preferably, the power supply may be logically connected to the at least one processor 32 through a power management device, so as to implement functions of managing charging, discharging, and power consumption through the power management device. The power supply may also include any component of one or more dc or ac power sources, recharging devices, power failure detection circuitry, power converters or inverters, power status indicators, and the like. The computer device 3 may further include various sensors, a bluetooth module, a Wi-Fi module, and the like, which are not described herein again.
The integrated unit implemented in the form of a software functional module may be stored in a computer-readable storage medium. The software functional module is stored in a storage medium and includes several instructions to enable a computer device (which may be a personal computer, a computer device, or a network device) or a processor (processor) to execute parts of the methods according to the embodiments of the present invention.
In the embodiments provided in the present invention, it should be understood that the disclosed apparatus and method may be implemented in other ways. For example, the above-described apparatus embodiments are merely illustrative, and for example, the division of the modules is only one logical functional division, and other divisions may be realized in practice.
The modules described as separate parts may or may not be physically separate, and parts displayed as modules may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of the present embodiment.
In addition, functional modules in the embodiments of the present invention may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit. The integrated unit can be realized in a form of hardware, or in a form of hardware plus a software functional module.
It will be evident to those skilled in the art that the invention is not limited to the details of the foregoing illustrative embodiments, and that the present invention may be embodied in other specific forms without departing from the spirit or essential attributes thereof. The present embodiments are therefore to be considered in all respects as illustrative and not restrictive, the scope of the invention being indicated by the appended claims rather than by the foregoing description, and all changes which come within the meaning and range of equivalency of the claims are therefore intended to be embraced therein. Any reference sign in a claim should not be construed as limiting the claim concerned. Furthermore, it is obvious that the word "comprising" does not exclude other elements or that the singular does not exclude the plural. A plurality of units or means recited in the present invention can also be implemented by one unit or means through software or hardware. The terms first, second, etc. are used to denote names, but not any particular order.
Finally, it should be noted that the above embodiments are only for illustrating the technical solutions of the present invention and not for limiting, and although the present invention is described in detail with reference to the preferred embodiments, it should be understood by those skilled in the art that modifications or equivalent substitutions may be made on the technical solutions of the present invention without departing from the spirit and scope of the technical solutions of the present invention.
Claims (10)
1. A method for rendering a visualization of data, the method comprising:
responding to a data rendering request, and acquiring a tree structure of data in the data rendering request;
determining a root node of the tree structure, and calculating a first position of the root node in a rendering tree to be generated according to a first parameter of a browser;
traversing the tree structure from the root node to a leaf node of a last level downwards, and calculating a second position of the leaf node of the last level in the rendering tree to be generated according to a second parameter of the browser;
traversing the tree structure from the leaf node of the last level in the tree structure upwards, and calculating the third position of the leaf node of each level in the rendering tree to be generated according to the first position and the second position;
rendering the rendering tree to be generated according to the position of each node, wherein parent and child nodes in the rendering tree are located in the same level, and brother nodes are in an upper level and a lower level.
2. The data visualization rendering method of claim 1, the method further comprising:
in response to a folding instruction of a first target node, calculating a node height and a value of a leaf node of the first target node;
determining a first node height of a next-level brother node of the first target node;
calculating a first moving height of the next-level brother node according to the node height and the value and the first node height;
folding all child nodes of the first target node, and moving all child nodes of the next sibling node and the next sibling node upward by the first moving height.
3. The data visualization rendering method of claim 1, the method further comprising:
responding to a folding instruction of a second target node, and determining a superior brother node of the second target node;
judging whether the superior brother node has a leaf child node;
when the upper-level brother node has leaf nodes, determining the second node height of a second-level leaf node in the leaf nodes of the upper-level brother node;
calculating a second moving height of the second target node according to the second node height and the node height of the second target node;
collapsing all children of the second target node and moving the second target node upward by the second travel height.
4. The data visualization rendering method of claim 3, the method further comprising:
when the upper-level brother node has no leaf node, calculating a third moving height of the second target node according to the node height of the upper-level brother node and the node height of the second target node;
collapsing all children of the second target node and moving the second target node upward by the third travel height.
5. The data visualization rendering method of claim 1, the method further comprising:
in response to a hybrid rendering request of a specified node, identifying a node type of the specified node in the hybrid rendering request;
when the node type is a closed node, determining a plurality of designated father nodes and designated child nodes in the designated nodes according to the mixed rendering request, and drawing directed line segments pointing to the designated child nodes from each designated father node;
when the node type is an adjacent node, determining two specified brother nodes in the specified nodes according to the mixed rendering request, and drawing a undirected line segment between the two specified brother nodes;
and when the node type is a virtual node, not displaying the specified node.
6. The data visualization rendering method of any of claims 1 to 5, the method further comprising:
responding to a dragging instruction of a display node in a rendering interface, and displaying a rendering display node in the rendering tree according to the dragging instruction;
obtaining a rendering description of the rendering display node;
determining a rendering parent node of the display node according to the rendering description;
generating a render line segment between the render parent node and the render display node.
7. The data visualization rendering method of any of claims 1 to 5, the method further comprising:
determining whether a target rendering node in the rendering tree is a leaf node of a last level in response to a delete instruction of the target rendering node;
when the target rendering node is the leaf node of the last level, deleting the target rendering node;
and when the target rendering node is not the leaf node of the last level, deleting the target rendering node and all the child rendering nodes of the target rendering node.
8. An apparatus for rendering data visualization, the apparatus comprising:
the request response module is used for responding to a data rendering request and acquiring a tree structure of data in the data rendering request;
the first calculation module is used for determining a root node of the tree structure and calculating a first position of the root node in a rendering tree to be generated according to a first parameter of a browser;
a second calculating module, configured to traverse the tree structure from the root node to a leaf node of a last level, and calculate, according to a second parameter of the browser, a second position of the leaf node of the last level in the rendering tree to be generated;
a third calculation module, configured to traverse the tree structure upward from a leaf node of a last level in the tree structure, and calculate a third position of the leaf node of each level in the rendering tree to be generated according to the first position and the second position;
and the node rendering module is used for rendering the rendering tree to be generated according to the position of each node, wherein parent and child nodes in the rendering tree are positioned in the same level, and brother nodes are in upper and lower levels.
9. A computer device comprising a processor for implementing a data visualization rendering method as claimed in any one of claims 1 to 7 when executing a computer program stored in a memory.
10. A computer-readable storage medium, on which a computer program is stored, which, when being executed by a processor, carries out a data visualization rendering method according to any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011614903.0A CN112650899B (en) | 2020-12-30 | 2020-12-30 | Data visualization rendering method and device, computer equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011614903.0A CN112650899B (en) | 2020-12-30 | 2020-12-30 | Data visualization rendering method and device, computer equipment and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112650899A true CN112650899A (en) | 2021-04-13 |
| CN112650899B CN112650899B (en) | 2023-10-03 |
Family
ID=75364394
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011614903.0A Active CN112650899B (en) | 2020-12-30 | 2020-12-30 | Data visualization rendering method and device, computer equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112650899B (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113282795A (en) * | 2021-06-29 | 2021-08-20 | 中国平安人寿保险股份有限公司 | Data structure chart generating and updating method and device, electronic equipment and storage medium |
| CN113326403A (en) * | 2021-06-16 | 2021-08-31 | 北京百度网讯科技有限公司 | Flowchart rendering method and device, electronic equipment and medium |
| WO2023005751A1 (en) * | 2021-07-30 | 2023-02-02 | 华为技术有限公司 | Rendering method and electronic device |
| CN117648153A (en) * | 2024-01-29 | 2024-03-05 | 太平金融科技服务（上海）有限公司 | Rendering display method and device, electronic equipment and storage medium |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20050171960A1 (en) * | 2004-01-30 | 2005-08-04 | Lomet David B. | Concurrency control for B-trees with node deletion |
| US20100067113A1 (en) * | 2008-09-18 | 2010-03-18 | Matthew John Harrison | Apparatus and Method for Displaying Hierarchical Data |
| CN102646115A (en) * | 2012-02-17 | 2012-08-22 | 北京星网锐捷网络技术有限公司 | Method and device for constructing AC (aho-corasick) state machine |
| US9396249B1 (en) * | 2013-06-19 | 2016-07-19 | Amazon Technologies, Inc. | Methods and systems for encoding parent-child map tile relationships |
| CN109903365A (en) * | 2017-12-08 | 2019-06-18 | 北大方正集团有限公司 | Rendering method and rendering system based on render tree |
| CN110213265A (en) * | 2019-05-29 | 2019-09-06 | 腾讯科技（深圳）有限公司 | Image acquiring method, device, server and storage medium |
| CN110689600A (en) * | 2019-09-16 | 2020-01-14 | 贝壳技术有限公司 | Rendering method and device of tree component, readable storage medium and electronic equipment |
| CN111104111A (en) * | 2019-11-29 | 2020-05-05 | 苏宁云计算有限公司 | Layout processing method and device for tree Canvas |
-
2020
- 2020-12-30 CN CN202011614903.0A patent/CN112650899B/en active Active
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20050171960A1 (en) * | 2004-01-30 | 2005-08-04 | Lomet David B. | Concurrency control for B-trees with node deletion |
| US20100067113A1 (en) * | 2008-09-18 | 2010-03-18 | Matthew John Harrison | Apparatus and Method for Displaying Hierarchical Data |
| CN102646115A (en) * | 2012-02-17 | 2012-08-22 | 北京星网锐捷网络技术有限公司 | Method and device for constructing AC (aho-corasick) state machine |
| US9396249B1 (en) * | 2013-06-19 | 2016-07-19 | Amazon Technologies, Inc. | Methods and systems for encoding parent-child map tile relationships |
| CN109903365A (en) * | 2017-12-08 | 2019-06-18 | 北大方正集团有限公司 | Rendering method and rendering system based on render tree |
| CN110213265A (en) * | 2019-05-29 | 2019-09-06 | 腾讯科技（深圳）有限公司 | Image acquiring method, device, server and storage medium |
| CN110689600A (en) * | 2019-09-16 | 2020-01-14 | 贝壳技术有限公司 | Rendering method and device of tree component, readable storage medium and electronic equipment |
| CN111104111A (en) * | 2019-11-29 | 2020-05-05 | 苏宁云计算有限公司 | Layout processing method and device for tree Canvas |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113326403A (en) * | 2021-06-16 | 2021-08-31 | 北京百度网讯科技有限公司 | Flowchart rendering method and device, electronic equipment and medium |
| CN113282795A (en) * | 2021-06-29 | 2021-08-20 | 中国平安人寿保险股份有限公司 | Data structure chart generating and updating method and device, electronic equipment and storage medium |
| CN113282795B (en) * | 2021-06-29 | 2024-05-14 | 中国平安人寿保险股份有限公司 | Data structure diagram generation and updating method and device, electronic equipment and storage medium |
| WO2023005751A1 (en) * | 2021-07-30 | 2023-02-02 | 华为技术有限公司 | Rendering method and electronic device |
| CN117648153A (en) * | 2024-01-29 | 2024-03-05 | 太平金融科技服务（上海）有限公司 | Rendering display method and device, electronic equipment and storage medium |
| CN117648153B (en) * | 2024-01-29 | 2024-04-26 | 太平金融科技服务（上海）有限公司 | Rendering display method and device, electronic equipment and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112650899B (en) | 2023-10-03 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN112650899B (en) | Data visualization rendering method and device, computer equipment and storage medium | |
| US11501256B2 (en) | Digital processing systems and methods for data visualization extrapolation engine for item extraction and mapping in collaborative work systems | |
| US10108756B2 (en) | Method, computer program product and apparatus for providing a building options configurator | |
| Lee et al. | Quantitative analysis of warnings in building information modeling (BIM) | |
| CN112579226A (en) | User interface logical views and perform view navigation and translation | |
| KR101794373B1 (en) | Temporary formatting and charting of selected data | |
| US20080115104A1 (en) | Software development system and method for intelligent document output based on user-defined rules | |
| WO2021174946A1 (en) | Visualization method, system, computer device, and storage medium | |
| CN113282795B (en) | Data structure diagram generation and updating method and device, electronic equipment and storage medium | |
| CN107608747A (en) | The construction method of form system, device, electronic equipment, storage medium | |
| US20240028991A1 (en) | Flexible Work Breakdown Structure | |
| CN113326314B (en) | Data visualization method, device, electronic equipment and readable storage medium | |
| CN107219983A (en) | List display method and device | |
| CN112486491A (en) | Page generation method and device, computer equipment and storage medium | |
| CN112579051B (en) | System for developing industrial applications and method for managing industrial development workspaces | |
| US10156957B2 (en) | Semi-modal interaction blocker | |
| CN111782651A (en) | Visual editing method, device and equipment for data association relation and storage medium | |
| JPWO2014061093A1 (en) | Screen creation device and screen creation method | |
| CN111078782B (en) | Industrial big data visualization system and method | |
| JP2003006242A (en) | Product data management system, program to run the system, recording medium recorded with the program, and product data management method | |
| KR101985491B1 (en) | Result generating and monitoring apparatus using visualzation of formula with diagram mode | |
| CN105204833B (en) | A kind of visual interface modeling method based on Interface Element view structural interface view | |
| CN107705351A (en) | A kind of state color method and device based on BIM | |
| CN114124977A (en) | Cross-tenant data sharing method and device and electronic equipment | |
| JP7018356B2 (en) | Devices and methods to help you create programs using visual programming tools |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |