CN114003718A - Relation map drawing method and device, computer storage medium and electronic equipment - Google Patents
Relation map drawing method and device, computer storage medium and electronic equipment Download PDFInfo
- Publication number
- CN114003718A CN114003718A CN202111311857.1A CN202111311857A CN114003718A CN 114003718 A CN114003718 A CN 114003718A CN 202111311857 A CN202111311857 A CN 202111311857A CN 114003718 A CN114003718 A CN 114003718A
- Authority
- CN
- China
- Prior art keywords
- boundary
- node
- visual
- source
- 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.)
- Pending
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/30—Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
- G06F16/34—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/30—Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
- G06F16/36—Creation of semantic tools, e.g. ontology or thesauri
- G06F16/367—Ontology
-
- 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/95—Retrieval from the web
- G06F16/957—Browsing optimisation, e.g. caching or content distillation
-
- 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/95—Retrieval from the web
- G06F16/958—Organisation or management of web site content, e.g. publishing, maintaining pages or automatic linking
Abstract
The embodiment of the application provides a relational graph drawing method and a device thereof, a computer storage medium and electronic equipment, wherein the relational graph drawing method comprises the following steps: determining a visible boundary of a visible area for displaying the relationship graph, all source nodes included in the relationship graph, and a node boundary required for drawing each source node; screening out first target nodes which do not need to be drawn in the visual area according to the node boundary required for drawing each source node and the visual boundary of the visual area; and selecting a first visual node from the source nodes except the first target node to draw in the visual area for displaying, so that all source nodes in the relation graph do not need to be drawn on a browser page, the performance of the browser is ensured, the interaction behavior in the relation graph is smoother, and a plurality of functions of the relation graph can be effectively used.
Description
Technical Field
The application relates to the technical field of data processing, in particular to a relation map drawing method and device, a computer storage medium and electronic equipment.
Background
Based on a big data solution, a series of deep mining such as cleaning analysis and sorting is performed on the collected enterprise data, so that data comprehensive query or classified query service is provided, for example, enterprise-related information including investment conditions is queried.
In order to visually display the investment situation, the investment relation graph is required to reflect the detailed investment situation of the enterprises, the investment relation graph can comprise a plurality of nodes, each node corresponds to one enterprise, and the investment relation graph can specifically display the investment relation among the enterprises through a tree structure.
In the using process, the investment relationship graph can be developed in a whole layer, but when the investment relationship graph is developed in a whole layer, all source nodes in the investment relationship graph need to be drawn on a browser page, so that the performance of the browser is reduced sharply, the interaction behavior in the investment relationship graph becomes very unsmooth, and many functions of the investment relationship graph cannot be effectively used.
Disclosure of Invention
The embodiment of the application provides a relation map drawing method and device, a computer storage medium and electronic equipment, which are used for overcoming or relieving the technical problems in the prior art.
The technical scheme adopted by the application is as follows:
a method of relational mapping, comprising:
determining a visible boundary of a visible area for displaying the relationship graph, all source nodes included in the relationship graph, and a node boundary required for drawing each source node;
screening out first target nodes which do not need to be drawn in the visual area according to the node boundary required for drawing each source node and the visual boundary of the visual area;
and selecting a first visual node from source nodes except the first target node to draw in the visual area for showing.
Optionally, in an embodiment, the screening out the first target node that is not required to be drawn in the visual area according to the node boundary required to draw each source node and the visual boundary of the visual area includes: and comparing each node boundary with the visual boundary, and taking a source node of which the node boundary is positioned outside the visual boundary as the first target node.
Optionally, in an embodiment, the comparing each node boundary with the visual boundary, and taking a source node of which the node boundary is located outside the visual boundary as the first target node includes: and comparing the left boundary of each node boundary with the right boundary of the visual boundary, and taking the source node of which the left boundary is larger than the right boundary of the visual boundary as the first target node.
Optionally, in an embodiment, the comparing each node boundary with the visual boundary, and taking a source node of which the node boundary is located outside the visual boundary as the first target node includes: and comparing the right boundary of each node boundary with the left boundary of the visible boundary, and taking the source node of which the right boundary is smaller than the left boundary of the visible boundary as the first target node.
Optionally, in an embodiment, the comparing each node boundary with the visual boundary, and taking a source node of which the node boundary is located outside the visual boundary as the first target node includes: and comparing the upper boundary of each node boundary with the lower boundary of the visual boundary, and taking the source node of which the upper boundary is smaller than the lower boundary of the visual boundary as the first target node.
Optionally, in an embodiment, the comparing each node boundary with the visual boundary, and taking a source node of which the node boundary is located outside the visual boundary as the first target node includes: and comparing the lower boundary of each node boundary with the upper boundary of the visual boundary, and taking the source node of which the lower boundary is larger than the upper boundary of the visual boundary as the first target node.
Optionally, in an embodiment, the selecting a first visual node from source nodes other than the first target node to draw in the visual area for presentation includes:
according to a connecting line used for expressing the relationship between the source nodes and the visual boundary, screening out second target nodes which do not need to be drawn in the visual area from the source nodes except the first target node;
and selecting a first visual node from source nodes except the second target node to draw in the visual area for showing.
Optionally, in an embodiment, the screening out a second target node that is not required to be drawn in the visual area according to a connecting line used for representing a relationship between two source nodes and a visual boundary of the visual area includes: and determining the position relation between the connecting line and the visual boundary, and if the position relation indicates that the connecting line is positioned at the periphery of the visual boundary and the two source nodes corresponding to the connecting line are positioned outside the same boundary of the visual boundary, taking the two source nodes corresponding to the connecting line as the second target nodes to be screened out.
Optionally, in an embodiment, the method further includes:
determining, from the specification of the visible boundary and the visible region, a third target node that need not be exposed in the visible region in response to a graph translation operation;
selecting a second visual node from source nodes other than the third target node to draw for presentation in the visual area in response to a graph translation operation.
Optionally, in an embodiment, the determining, according to the specification of the visual boundary and the visual region, that the third target node that does not need to be displayed in the visual region in response to the graph translation operation includes:
determining an expansion boundary according to the specification of the visible boundary and the visible area;
determining, based on the expanded boundary, a third target node that need not be exposed in the visible region in response to a graph translation operation.
Optionally, in an embodiment, the expanded boundary includes at least one of:
the right boundary of the visual boundary plus the width of the visual area is taken as a right expansion boundary;
the left boundary of the visual boundary is reduced by the width of the visual area to be used as a left expansion boundary;
a lower boundary of the visible boundary minus a height of the visible region as a lower extension boundary;
the upper boundary of the visible boundary plus the height of the visible area is used as an upper expansion boundary;
correspondingly, the third target node comprises at least one of:
a source node for which the left boundary of the node boundary is smaller than the right extended boundary;
the right boundary of the node boundary is larger than the source node of the left extended boundary;
the upper boundary of the node boundary is larger than the source node of the lower volume extension boundary;
the lower boundary of the node boundary is smaller than the source node of the upper extended boundary.
Optionally, in an embodiment, the selecting a second visual node from source nodes other than the third target node to be rendered in the visual area for presentation in response to a graph translation operation includes:
according to connecting lines used for expressing the relationship between the source nodes and the expansion boundary, screening out fourth target nodes which do not need to be displayed in the visual area when responding to map translation operation from the source nodes except the third target nodes;
selecting a second visual node from source nodes other than the fourth target node to draw for presentation in the visual area in response to a graph translation operation.
Optionally, in an embodiment, the screening, according to the connecting lines used for expressing the relationship between the source nodes and the extended boundary, a fourth target node that is not required to be displayed in the visible region in response to the graph translation operation from the source nodes other than the third target node includes: and determining the position relation between the connecting line and the extension boundary, and if the position relation indicates that the connecting line is positioned at the periphery of the extension boundary and the two source nodes corresponding to the connecting line are positioned outside the same boundary of the extension boundary, taking the two source nodes corresponding to the connecting line as the fourth target node.
A relational mapping apparatus, comprising:
the boundary determining unit is used for determining a visible boundary of a visible area for displaying the relation graph, all source nodes included in the relation graph and a node boundary required by drawing each source node;
the first node screening unit is used for screening out a first target node which is not required to be drawn in the visual area according to the node boundary required for drawing each source node and the visual boundary of the visual area;
and the first node drawing unit is used for selecting a first visual node from source nodes except the first target node to draw in the visual area for showing.
Optionally, in an embodiment, the apparatus further includes:
a second node screening unit, configured to determine, according to the visible boundary and the specification of the visible region, a third target node that does not need to be displayed in the visible region in response to a map translation operation;
and the second node drawing unit is used for selecting a second visual node from the source nodes except the third target node so as to respond to the graph translation operation and draw in the visual area for showing.
A computer storage medium having stored thereon a computer executable program, the computer executable program being operative to perform a method as in any one of the embodiments of the present application.
An electronic device comprising a memory for storing thereon a computer-executable program and a processor for executing the computer-executable program to implement the method of any of the embodiments of the present application.
Determining a visible boundary of a visible area for displaying the relationship graph, all source nodes included in the relationship graph, and a node boundary required by drawing each source node; screening out first target nodes which do not need to be drawn in the visual area according to the node boundary required for drawing each source node and the visual boundary of the visual area; and selecting a first visual node from the source nodes except the first target node to draw in the visual area for displaying, so that all source nodes in the relation graph do not need to be drawn on a browser page, the performance of the browser is ensured, the interaction behavior in the relation graph is smoother, and a plurality of functions of the relation graph can be effectively used.
Drawings
FIG. 1 is a schematic view of a scenario in which a user uses an application according to an embodiment of the present application;
fig. 2A is a schematic flow chart of a relationship graph drawing method according to an embodiment of the present application;
FIG. 2B is a diagram illustrating a relationship graph according to an embodiment of the present disclosure; such as
FIG. 3 is a schematic flow chart of a relationship graph plotting method according to an embodiment of the present application;
FIG. 4 is a schematic flow chart of a relationship graph drawing method according to an embodiment of the present application;
FIG. 5 is a schematic flow chart of a relationship graph plotting method according to an embodiment of the present application;
FIG. 6 is a schematic diagram of an extended area obtained by extending the visible area according to the embodiment of the present application;
fig. 7 is a schematic structural diagram of a relationship mapping apparatus according to an embodiment of the present application;
fig. 8 is a schematic structural diagram of an electronic device in an embodiment of the present application.
Detailed Description
To make the technical problems, technical solutions and advantages to be solved by the present application clearer, the following detailed description is made with reference to the accompanying drawings and specific embodiments.
Determining a visible boundary of a visible area for displaying the relationship graph, all source nodes included in the relationship graph, and a node boundary required by drawing each source node; screening out first target nodes which do not need to be drawn in the visual area according to the node boundary required for drawing each source node and the visual boundary of the visual area; and selecting a first visual node from the source nodes except the first target node to draw in the visual area for displaying, so that all the source nodes in the relation graph do not need to be drawn on a browser page, the performance of the browser is reduced sharply, the smooth and unsmooth interaction behavior in the relation graph is avoided, and a plurality of functions of the relation graph can be effectively used. In addition, through the processing mode, the quantity of the source nodes which are drawn in the visual area for showing is controllable.
Furthermore, the described features, structures, or characteristics may be combined in any suitable manner in one or more embodiments. In the following description, numerous specific details are provided to give a thorough understanding of embodiments of the disclosure. One skilled in the relevant art will recognize, however, that the subject matter of the present disclosure can be practiced without one or more of the specific details, or with other methods, apparatus, steps, etc. In other instances, well-known structures, methods, devices, implementations, or operations are not shown or described in detail to avoid obscuring aspects of the disclosure.
Furthermore, the terms "first", "second", etc. are used for descriptive purposes only and are not to be construed as indicating or implying relative importance or implicitly indicating the number of technical features indicated. Thus, a feature defined as "first" or "second" may explicitly or implicitly include one or more of that feature. In the description of the present disclosure, "a plurality" means at least two, e.g., two, three, etc., unless explicitly specifically limited otherwise. The symbol "/" generally indicates that the former and latter associated objects are in an "or" relationship.
In the present disclosure, unless otherwise expressly specified or limited, the terms "connected" and the like are to be construed broadly, e.g., as meaning electrically connected or in communication with each other; may be directly connected or indirectly connected through an intermediate. The specific meaning of the above terms in the present disclosure can be understood by those of ordinary skill in the art as appropriate.
In the embodiments shown in fig. 2A to 3, for example, when the relationship graph is unfolded in a whole layer, only a part of the source nodes are shown in the visible region in one display. The full-page unrolling is triggered, for example, by a "one-touch-through" function configured in the display page.
In the following embodiments, the relationship graph is taken as an example of an investment relationship graph, and therefore, the relationship of the source node is an investment relationship. Of course, in other embodiments, the solution of the present application may also be applied to other relationship maps, such as an organization architecture relationship map, a cooperation relationship map, and the like.
Fig. 2A is a schematic flow chart of a relationship graph drawing method according to an embodiment of the present application; as shown in fig. 2A, the relationship mapping method may be executed by a data processing server, and specifically includes:
s201, determining a visible boundary of a visible area for displaying the relation graph, all source nodes included in the relation graph, and drawing a node boundary required by each source node;
in this embodiment, the relationship map mainly reflects investment relationships of a legal person, such as a sponsor of the legal person (or referred to as a stakeholder of the legal person), which may be the legal person or a natural person; the corporate invests other corporate (or also called corporate invested by the corporate) who is the stockholder for the invested party. The investor or invested party with the investment relation corresponds to one source node of the relation map, and the source nodes represent the investment relation between the investor and the invested party through connecting lines.
In this embodiment, the visible area may specifically be an area that is set on a display page of a browser and displays the investment relationship spectrogram, where it should be noted that the relationship spectrogram displayed in the visible area may only display some source nodes, and display all the source nodes is realized through operations such as page translation. Of course, here, the presentation by the display page on the browser is only an example, and is not limited to the presentation only on the display page of the browser.
Specifically, the visible area may also be an area set on a presentation page of another non-browser page, and may be flexibly determined according to an application scenario.
S202, according to the node boundary required by drawing each source node and the visual boundary of the visual area, screening out a first target node which is not required to be drawn in the visual area;
specifically, in this embodiment, source nodes that cannot be displayed in the visible area may be screened out according to the relationship between the node boundary and the visible boundary. It should be noted that the source node that cannot be exposed in the visible area refers to a source node that does not need to be exposed in the visible area when no operations such as page translation are required.
Specifically, the screening out, according to the node boundary required for drawing each source node and the visual boundary of the visual area, a first target node that is not required to be drawn in the visual area may specifically include: and comparing each node boundary with the visual boundary, and taking a source node of which the node boundary is positioned outside the visual boundary as the first target node.
For example, the comparing each node boundary with the visual boundary and taking the source node of which the node boundary is located outside the visual boundary as the first target node includes: and comparing the left boundary of each node boundary with the right boundary of the visual boundary, and taking the source node of which the left boundary is larger than the right boundary of the visual boundary as the first target node.
For another example, the comparing each node boundary with the visual boundary and taking the source node of which the node boundary is located outside the visual boundary as the first target node includes: and comparing the right boundary of each node boundary with the left boundary of the visible boundary, and taking the source node of which the right boundary is smaller than the left boundary of the visible boundary as the first target node.
For example, the comparing each node boundary with the visual boundary and taking the source node of which the node boundary is located outside the visual boundary as the first target node further includes: and comparing the upper boundary of each node boundary with the lower boundary of the visual boundary, and taking the source node of which the upper boundary is smaller than the lower boundary of the visual boundary as the first target node.
For another example, the comparing each node boundary with the visual boundary and taking the source node of which the node boundary is located outside the visual boundary as the first target node includes: and comparing the lower boundary of each node boundary with the upper boundary of the visual boundary, and taking the source node of which the lower boundary is larger than the upper boundary of the visual boundary as the first target node.
Here, it should be noted that the above four manners for determining the first target node may be flexibly selected according to requirements of an application scenario, for example, one or some manner of the manners may be used, or all the four manners may be used, as long as the source nodes that do not need to be displayed within the visual boundary range are screened out and only the source nodes that need to be displayed within the visual boundary range are drawn when being displayed at one time compared with the prior art, so that the number of the source nodes to be drawn is reduced.
S203, selecting a first visual node from the source nodes except the first target node to draw in the visual area for showing.
In this embodiment, the first target node is used as a node that does not need to be drawn in the visible area during one-time presentation, and the source nodes except for the first target node are used as nodes that need to be drawn in the visible area during one-time presentation.
FIG. 2B is a diagram illustrating a relationship graph according to an embodiment of the present disclosure; as shown in fig. 2B, on a display page of the browser, there is a visible area (also referred to as a map visible area) on which a source node in the relationship map can be shown, and on the display page, "one-key penetration" is configured for implementing the whole-layer expansion, and of course, on the display page, some other function buttons are also configured, such as: searching, screening, editing, storing, exporting, expanding to the whole layer, returning to the previous step and the like. Clicking 'upward whole-layer expansion' to show the stockholders of the enterprises represented by the corresponding source nodes, and clicking 'downward whole-layer expansion' to show the enterprises invested by the enterprises represented by the source nodes. And other functional keys (such as searching, screening, editing, storing and exporting) realize the operation on the source node of the relational graph.
The above function buttons are only examples and are not limited, and in other examples, other function buttons may be configured.
By implementing the method of fig. 2A, the number of source nodes drawn in a current region for displaying is reduced, so that the performance of the browser can be ensured, when some function keys are operated, the interaction behavior in the relationship graph is smoother, the occurrence of jamming and the like is avoided, and the effective use of similar functions of the relationship graph is ensured.
FIG. 3 is a schematic flow chart of a relationship graph plotting method according to an embodiment of the present application; different from the embodiment provided in fig. 2A, in this embodiment, when the first visual node is selected from the source nodes except for the first target node to be drawn in the visual area for displaying, the connecting lines expressing the investment relationship are further removed from the source nodes except for the first target node, so as to further reduce the number of source nodes to be drawn. As shown in fig. 3, the method for drawing a relationship map may specifically include:
s301, determining a visible boundary of a visible area for displaying the relationship graph, all source nodes included in the relationship graph, and drawing a node boundary required by each source node;
s302, according to the node boundary required by drawing each source node and the visual boundary of the visual area, screening out a first target node which is not required to be drawn in the visual area;
s303, screening out second target nodes which do not need to be drawn in the visible area from the source nodes except the first target node according to a connecting line used for expressing the investment relation among the source nodes and the visible boundary;
specifically, in this embodiment, the screening out a second target node that is not required to be drawn in the visual area according to the connection line used for representing the investment relationship between the two source nodes and the visual boundary of the visual area includes: and determining the position relation between the connecting line and the visual boundary, and if the position relation indicates that the connecting line is positioned at the periphery of the visual boundary and the two source nodes corresponding to the connecting line are positioned outside the same boundary of the visual boundary, taking the two source nodes corresponding to the connecting line as the second target nodes to be screened out.
Illustratively, there are four possible ways: the position relationship indicates that the connection line is located at the periphery of the upper boundary, the lower boundary, the left boundary or the right boundary of the visible boundary, and correspondingly, two source nodes corresponding to the connection line are located at the periphery of the upper boundary, the lower boundary, the left boundary or the right boundary of the visible boundary, and then the two source nodes corresponding to the connection line are used as the second target nodes to be screened out.
It should be noted here that, the four manners of screening out the second target node from the source nodes except the first target node based on the connection lines may be applied to scenes of a scene, and only one or some manner or four manners of the scenarios may be selected, as long as compared with the prior art, when one-time display is performed, source nodes that do not need to be displayed within the visible boundary range are screened out, only source nodes that need to be displayed within the visible boundary range are drawn, and the number of source nodes to be drawn is reduced.
S304, selecting a first visual node from the source nodes except the second target node to draw in the visual area for showing.
In this embodiment, compared to the above-described embodiment of fig. 2A, since the second target node is further screened from the source nodes other than the first target node, the number of source nodes to be drawn is further reduced.
In the embodiments of fig. 4 to 5 described below, considering that when the relationship graph is displayed, all source nodes cannot be displayed at one time, it is often necessary to display another part of the source nodes to be displayed in the visible area through a page switching operation, such as a graph translation operation. Of course, in other embodiments, if the page switch operation is not considered, the methods of fig. 4-5 may not be required to be performed, or all source nodes in the relationship graph may be exposed in the visible area at one time.
FIG. 4 is a schematic flow chart of a relationship graph drawing method according to an embodiment of the present application; as shown in fig. 4, the relationship mapping method may be executed by a data processing server, and specifically includes:
s401, determining a visible boundary of a visible area for displaying the relationship graph, all source nodes included in the relationship graph, and drawing a node boundary required by each source node;
s402, screening out a first target node which is not required to be drawn in the visual area according to the node boundary required for drawing each source node and the visual boundary of the visual area;
s403, selecting a first visual node from source nodes except the first target node to draw in the visual area for displaying;
s404, according to the visible boundary and the specification of the visible area, determining a third target node which does not need to be displayed in the visible area when the map translation operation is responded;
specifically, in this embodiment, the determining, according to the specification of the visible boundary and the visible region, a third target node that does not need to be displayed in the visible region in response to the graph translation operation includes:
determining an expansion boundary according to the specification of the visible boundary and the visible area;
determining, based on the expanded boundary, a third target node that need not be exposed in the visible region in response to a graph translation operation.
Specifically, the specification of the visible region includes, for example, a width and a height, and for this purpose, the expanded boundary includes at least one of:
the right boundary of the visual boundary plus the width of the visual area is taken as a right expansion boundary;
the left boundary of the visual boundary is reduced by the width of the visual area to be used as a left expansion boundary;
a lower boundary of the visible boundary minus a height of the visible region as a lower extension boundary;
the upper boundary of the visible boundary plus the height of the visible area is used as an upper expansion boundary;
correspondingly, the third target node comprises at least one of:
a source node for which the left boundary of the node boundary is smaller than the right extended boundary;
the right boundary of the node boundary is larger than the source node of the left extended boundary;
the upper boundary of the node boundary is larger than the source node of the lower volume extension boundary;
the lower boundary of the node boundary is smaller than the source node of the upper extended boundary.
The third target node may be determined in a manner similar to the process of determining the second target node, i.e., comparing the specific boundary of the node boundary with the extended boundary of the drink.
S405, selecting a second visual node from the source nodes except the third target node, and responding to the graph translation operation, drawing the graph in the visual area and displaying the graph in the visual area.
In this embodiment, considering that a source node to be displayed needs to be switched in a visual area in a graph translation operation, the extended boundary is equivalent to an extended area obtained by extending on the basis of the visual area, a third target node to be filtered out is determined in a manner similar to the determination of the first target node, a second visual node is selected from source nodes except the third target node for drawing, and the selected second visual node is displayed in the visual area in the graph translation operation.
FIG. 5 is a schematic flow chart of a relationship graph plotting method according to an embodiment of the present application; different from the embodiment of fig. 4, when selecting a second visual node from source nodes other than the third target node to be rendered in the visual area in response to the graph translation operation, further excluding a fourth target node from the source nodes other than the third target node based on a connecting line expressing the investment relation, and selecting the second visual node from the source nodes other than the fourth target node, thereby further reducing the number of source nodes to be rendered; as shown in fig. 5, the method for drawing a relationship map may specifically include:
s501, determining a visible boundary of a visible area for displaying the relational graph, all source nodes included in the relational graph, and drawing a node boundary required by each source node;
s502, according to the node boundary required by drawing each source node and the visual boundary of the visual area, screening out a first target node which is not required to be drawn in the visual area;
s503, selecting a first visual node from source nodes except the first target node to draw in the visual area for displaying;
s504, according to the visible boundary and the specification of the visible area, determining a third target node which does not need to be displayed in the visible area when the map translation operation is responded;
s505, according to connecting lines used for expressing investment relations among the source nodes and the expansion boundary, fourth target nodes which do not need to be displayed in the visible area when responding to map translation operation are screened from the source nodes except the third target nodes;
specifically, the screening, according to the connecting line used for expressing the investment relationship between the source nodes and the extension boundary, a fourth target node that is not required to be displayed in the visible area in response to the graph translation operation from the source nodes except the third target node includes: and determining the position relation between the connecting line and the extension boundary, and if the position relation indicates that the connecting line is positioned at the periphery of the extension boundary and the two source nodes corresponding to the connecting line are positioned outside the same boundary of the extension boundary, taking the two source nodes corresponding to the connecting line as the fourth target node.
Illustratively, there are four possible ways: the position relationship indicates that the connection line is located at the periphery of the upper boundary, the lower boundary, the left boundary or the right boundary of the extended boundary, and correspondingly, two source nodes corresponding to the connection line are located at the periphery of the upper boundary, the lower boundary, the left boundary or the right boundary of the extended boundary, and then the two source nodes corresponding to the connection line are used as the fourth target nodes to be screened out.
S506, selecting a second visual node from the source nodes except the fourth target node to draw in the visual area for showing when responding to the graph translation operation.
In this embodiment, compared to the above-described embodiment of fig. 4, since the fourth target node is further screened from the source nodes other than the third target node, the number of source nodes to be drawn is further reduced in response to the graph shift operation.
FIG. 6 is a schematic diagram of an extended area obtained by extending the visible area according to the embodiment of the present application; as shown in fig. 6, the sum of the extension area and the visible area (width w and height h) is equal to the drawing area of the source node as a whole, and the drawing area is equal to 9 times of the visible area, so that the number of source nodes to be drawn in the process of meeting the graph translation operation (upward, downward, leftward or rightward) is as small as possible, and the performance of the browser is ensured.
In the above embodiment, the first target node is determined first, and then the third target node is determined as an example, but in other embodiments, since there is no strong technology-dependent association between the determination of the first target node and the determination of the third target node, the third target node may be determined first, and then the first target node may be determined, and therefore, the above processing steps may be adaptively adjusted.
Fig. 7 is a schematic structural diagram of a relationship mapping apparatus according to an embodiment of the present application; as shown in fig. 7, it may include:
a boundary determining unit 701, configured to determine a visible boundary of a visible region showing the relationship graph, all source nodes included in the relationship graph, and a node boundary required for drawing each source node;
a first node screening unit 702, configured to screen out a first target node that is not required to be drawn in the visible area according to the node boundary required to draw each source node and the visible boundary of the visible area;
a first node drawing unit 703, configured to select a first visual node from source nodes other than the first target node to draw in the visual area for presentation.
Optionally, in an embodiment, the first node culling unit 702 is specifically configured to compare each node boundary with the visual boundary, and use a source node of which the node boundary is located outside the visual boundary as the first target node.
Optionally, in an embodiment, the first node culling unit 702 is specifically configured to compare a left boundary of each node boundary with a right boundary of the visual boundary, and use a source node whose left boundary is greater than the right boundary of the visual boundary as the first target node.
Optionally, in an embodiment, the first node culling unit 702 is specifically configured to compare a right boundary of each node boundary with a left boundary of the visible boundary, and use a source node whose right boundary is smaller than the left boundary of the visible boundary as the first target node.
Optionally, in an embodiment, the first node culling unit 702 is specifically configured to compare an upper boundary of each node boundary with a lower boundary of the visible boundary, and use a source node whose upper boundary is smaller than the lower boundary of the visible boundary as the first target node.
Optionally, in an embodiment, the first node culling unit 702 is specifically configured to compare a lower boundary of each node boundary with an upper boundary of the visual boundary, and use a source node whose lower boundary is greater than the upper boundary of the visual boundary as the first target node.
Optionally, in an embodiment, the first node drawing unit 703 is specifically configured to:
according to a connecting line used for expressing the investment relation among the source nodes and the visual boundary, screening out second target nodes which do not need to be drawn in the visual area from the source nodes except the first target node;
and selecting a first visual node from source nodes except the second target node to draw in the visual area for showing.
Optionally, in an embodiment, the first node drawing unit 703 is specifically configured to: and determining the position relation between the connecting line and the visual boundary, and if the position relation indicates that the connecting line is positioned at the periphery of the visual boundary and the two source nodes corresponding to the connecting line are positioned outside the same boundary of the visual boundary, taking the two source nodes corresponding to the connecting line as the second target nodes to be screened out.
Optionally, in an embodiment, the first node screening unit 702 is further configured to:
determining, from the specification of the visible boundary and the visible region, a third target node that need not be exposed in the visible region in response to a graph translation operation;
selecting a second visual node from source nodes other than the third target node to draw for presentation in the visual area in response to a graph translation operation.
Optionally, in an embodiment, the first node screening unit 702 is further specifically configured to:
determining an expansion boundary according to the specification of the visible boundary and the visible area;
determining, based on the expanded boundary, a third target node that need not be exposed in the visible region in response to a graph translation operation.
Optionally, in an embodiment, the expanded boundary includes at least one of:
the right boundary of the visual boundary plus the width of the visual area is taken as a right expansion boundary;
the left boundary of the visual boundary is reduced by the width of the visual area to be used as a left expansion boundary;
a lower boundary of the visible boundary minus a height of the visible region as a lower extension boundary;
the upper boundary of the visible boundary plus the height of the visible area is used as an upper expansion boundary;
correspondingly, the third target node comprises at least one of:
a source node for which the left boundary of the node boundary is smaller than the right extended boundary;
the right boundary of the node boundary is larger than the source node of the left extended boundary;
the upper boundary of the node boundary is larger than the source node of the lower volume extension boundary;
the lower boundary of the node boundary is smaller than the source node of the upper extended boundary.
Optionally, in an embodiment, the first node screening unit 702 is further specifically configured to:
according to connecting lines used for expressing investment relations among the source nodes and the expansion boundary, fourth target nodes which do not need to be displayed in the visual area when responding to map translation operation are screened from the source nodes except the third target nodes;
selecting a second visual node from source nodes other than the fourth target node to draw for presentation in the visual area in response to a graph translation operation.
Optionally, in an embodiment, the first node screening unit 702 is further specifically configured to:
and determining the position relation between the connecting line and the extension boundary, and if the position relation indicates that the connecting line is positioned at the periphery of the extension boundary and the two source nodes corresponding to the connecting line are positioned outside the same boundary of the extension boundary, taking the two source nodes corresponding to the connecting line as the fourth target node.
Optionally, in an embodiment, the apparatus further includes:
a second node screening unit, configured to determine, according to the visible boundary and the specification of the visible region, a third target node that does not need to be displayed in the visible region in response to a map translation operation;
and the second node drawing unit is used for selecting a second visual node from the source nodes except the third target node so as to respond to the graph translation operation and draw in the visual area for showing. Optionally, in an embodiment, the apparatus further includes:
a second node screening unit, configured to determine, according to the visible boundary and the specification of the visible region, a third target node that does not need to be displayed in the visible region in response to a map translation operation;
and the second node drawing unit is used for selecting a second visual node from the source nodes except the third target node so as to respond to the graph translation operation and draw in the visual area for showing.
Embodiments of the present application provide a computer storage medium having a computer-executable program stored thereon, where the computer-executable program is executed to implement any one of the methods of the embodiments of the present application.
FIG. 8 is a schematic structural diagram of an electronic device in an embodiment of the present application; as shown in fig. 8, the electronic apparatus includes: a memory 801 on which a computer-executable program is stored, and a processor 802 for running the computer-executable program to implement the data processing method in any embodiment of the present application.
The electronic device may act as a data processing server performing the above method.
The above-mentioned embodiments are only specific embodiments of the present application, and are used for illustrating the technical solutions of the present application, but not limiting the same, and the scope of the present application is not limited thereto, and although the present application is described in detail with reference to the foregoing embodiments, those skilled in the art should understand that: any person skilled in the art can modify or easily conceive the technical solutions described in the foregoing embodiments or equivalent substitutes for some technical features within the technical scope disclosed in the present application; such modifications, changes or substitutions do not depart from the spirit and scope of the exemplary embodiments of the present application, and are intended to be covered by the scope of the present application. Therefore, the protection scope of the present application shall be subject to the protection scope of the claims.
Claims (17)
1. A method of relational mapping, comprising:
determining a visible boundary of a visible area for displaying the relationship graph, all source nodes included in the relationship graph, and a node boundary required for drawing each source node;
screening out first target nodes which do not need to be drawn in the visual area according to the node boundary required for drawing each source node and the visual boundary of the visual area;
and selecting a first visual node from source nodes except the first target node to draw in the visual area for showing.
2. The method of claim 1, wherein the screening out the first target node that does not need to be drawn in the visual area according to the node boundary required for drawing each source node and the visual boundary of the visual area comprises: and comparing each node boundary with the visual boundary, and taking a source node of which the node boundary is positioned outside the visual boundary as the first target node.
3. The method of claim 2, wherein said comparing each of said node boundaries to said visual boundary, and wherein said taking a source node whose node boundary is outside said visual boundary as said first target node, comprises: and comparing the left boundary of each node boundary with the right boundary of the visual boundary, and taking the source node of which the left boundary is larger than the right boundary of the visual boundary as the first target node.
4. The method of claim 2, wherein said comparing each of said node boundaries to said visual boundary, and wherein said taking a source node whose node boundary is outside said visual boundary as said first target node, comprises: and comparing the right boundary of each node boundary with the left boundary of the visible boundary, and taking the source node of which the right boundary is smaller than the left boundary of the visible boundary as the first target node.
5. The method of claim 2, wherein said comparing each of said node boundaries to said visual boundary, and wherein said taking a source node whose node boundary is outside said visual boundary as said first target node, comprises: and comparing the upper boundary of each node boundary with the lower boundary of the visual boundary, and taking the source node of which the upper boundary is smaller than the lower boundary of the visual boundary as the first target node.
6. The method of claim 2, wherein said comparing each of said node boundaries to said visual boundary, and wherein said taking a source node whose node boundary is outside said visual boundary as said first target node, comprises: and comparing the lower boundary of each node boundary with the upper boundary of the visual boundary, and taking the source node of which the lower boundary is larger than the upper boundary of the visual boundary as the first target node.
7. The method of claim 1, wherein the selecting a first visual node from source nodes other than the first target node to draw in the visual area for presentation comprises:
according to a connecting line used for expressing the relationship between the source nodes and the visual boundary, screening out second target nodes which do not need to be drawn in the visual area from the source nodes except the first target node;
and selecting a first visual node from source nodes except the second target node to draw in the visual area for showing.
8. The method of claim 7, wherein the screening out a second target node that does not need to be drawn in the visual area according to the connecting line used for representing the relationship between the two source nodes and the visual boundary of the visual area comprises: and determining the position relation between the connecting line and the visual boundary, and if the position relation indicates that the connecting line is positioned at the periphery of the visual boundary and the two source nodes corresponding to the connecting line are positioned outside the same boundary of the visual boundary, taking the two source nodes corresponding to the connecting line as the second target nodes to be screened out.
9. The method according to any one of claims 1-8, further comprising:
determining, from the specification of the visible boundary and the visible region, a third target node that need not be exposed in the visible region in response to a graph translation operation;
selecting a second visual node from source nodes other than the third target node to draw for presentation in the visual area in response to a graph translation operation.
10. The method of claim 9, wherein determining that a third target node that does not need to be exposed in the visual area in response to a graph translation operation based on the visual boundaries and the specification of the visual area comprises:
determining an expansion boundary according to the specification of the visible boundary and the visible area;
determining, based on the expanded boundary, a third target node that need not be exposed in the visible region in response to a graph translation operation.
11. The method of claim 10, wherein the expanded boundary comprises at least one of:
the right boundary of the visual boundary plus the width of the visual area is taken as a right expansion boundary;
the left boundary of the visual boundary is reduced by the width of the visual area to be used as a left expansion boundary;
a lower boundary of the visible boundary minus a height of the visible region as a lower extension boundary;
the upper boundary of the visible boundary plus the height of the visible area is used as an upper expansion boundary;
correspondingly, the third target node comprises at least one of:
a source node for which the left boundary of the node boundary is smaller than the right extended boundary;
the right boundary of the node boundary is larger than the source node of the left extended boundary;
the upper boundary of the node boundary is larger than the source node of the lower volume extension boundary;
the lower boundary of the node boundary is smaller than the source node of the upper extended boundary.
12. The method of claim 10, wherein selecting a second visual node from source nodes other than the third target node for rendering in the visual area in response to a graph translation operation comprises:
according to connecting lines used for expressing the relationship between the source nodes and the expansion boundary, screening out fourth target nodes which do not need to be displayed in the visual area when responding to map translation operation from the source nodes except the third target nodes;
selecting a second visual node from source nodes other than the fourth target node to draw for presentation in the visual area in response to a graph translation operation.
13. The method of claim 7, wherein the step of filtering out a fourth target node from the source nodes except the third target node according to the connecting line for representing the relationship between the source nodes and the expansion boundary, wherein the fourth target node is not required to be displayed in the visual area in response to the graph translation operation comprises: and determining the position relation between the connecting line and the extension boundary, and if the position relation indicates that the connecting line is positioned at the periphery of the extension boundary and the two source nodes corresponding to the connecting line are positioned outside the same boundary of the extension boundary, taking the two source nodes corresponding to the connecting line as the fourth target node.
14. A relational mapping apparatus, comprising:
the boundary determining unit is used for determining a visible boundary of a visible area for displaying the relation graph, all source nodes included in the relation graph and a node boundary required by drawing each source node;
the first node screening unit is used for screening out a first target node which is not required to be drawn in the visual area according to the node boundary required for drawing each source node and the visual boundary of the visual area;
and the first node drawing unit is used for selecting a first visual node from source nodes except the first target node to draw in the visual area for showing.
15. The apparatus of claim 14, further comprising:
a second node screening unit, configured to determine, according to the visible boundary and the specification of the visible region, a third target node that does not need to be displayed in the visible region in response to a map translation operation;
and the second node drawing unit is used for selecting a second visual node from the source nodes except the third target node so as to respond to the graph translation operation and draw in the visual area for showing.
16. A computer storage medium having a computer-executable program stored thereon, the computer-executable program being executed to implement the method of any one of claims 1-13.
17. An electronic device, comprising a memory for storing a computer-executable program and a processor for executing the computer-executable program to perform the method of any one of claims 1-13.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111311857.1A CN114003718A (en) | 2021-11-08 | 2021-11-08 | Relation map drawing method and device, computer storage medium and electronic equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111311857.1A CN114003718A (en) | 2021-11-08 | 2021-11-08 | Relation map drawing method and device, computer storage medium and electronic equipment |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN114003718A true CN114003718A (en) | 2022-02-01 |
Family
ID=79927962
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111311857.1A Pending CN114003718A (en) | 2021-11-08 | 2021-11-08 | Relation map drawing method and device, computer storage medium and electronic equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114003718A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114742980A (en) * | 2022-04-15 | 2022-07-12 | 北京航空航天大学云南创新研究院 | Three-dimensional exhibition hall browsing method combined with relation map |
-
2021
- 2021-11-08 CN CN202111311857.1A patent/CN114003718A/en active Pending
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114742980A (en) * | 2022-04-15 | 2022-07-12 | 北京航空航天大学云南创新研究院 | Three-dimensional exhibition hall browsing method combined with relation map |
| CN114742980B (en) * | 2022-04-15 | 2022-12-16 | 北京航空航天大学云南创新研究院 | Three-dimensional exhibition hall browsing method combined with relation map |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| KR101794373B1 (en) | Temporary formatting and charting of selected data | |
| US8677235B2 (en) | Ranking visualization types based upon fitness for visualizing a data set | |
| US20140372447A1 (en) | Knowledge index system and method of providing knowledge index | |
| US20070198930A1 (en) | Methods, Systems and Computer Program Products for Controlling Tree Diagram Graphical User Interfaces and/or For Partially Collapsing Tree Diagrams | |
| JP4564488B2 (en) | Screen transition control device | |
| CN108490336B (en) | Board card testing method and system, readable storage medium and computer equipment | |
| EP3408752B1 (en) | Object management and visualization using a computing device | |
| CN104103087A (en) | Picture display and management method and system with text introduction function | |
| CN102799688A (en) | Method and device for displaying historical records of webpages | |
| CN107728983A (en) | Double screen operating method and equipment | |
| CN106598926B (en) | Operation revocation method and device | |
| CN105426033A (en) | Method and apparatus for displaying prompt information | |
| CN103440271B (en) | The method and its device of history catalogue are shown in operating system | |
| CN114003718A (en) | Relation map drawing method and device, computer storage medium and electronic equipment | |
| CN104216996A (en) | File information display method and device | |
| JP2007018187A (en) | Tree structure display program, tree structure display method and tree structure display device | |
| CN107908436B (en) | Method and system for simplifying user operation | |
| JP2004220578A (en) | Method of representing tree database and its recording medium of same | |
| CN106066874B (en) | Object processing method and terminal | |
| US10963126B2 (en) | Method and system for element navigation | |
| RU2595920C2 (en) | Browser frame with focusing on website | |
| CN114138140B (en) | Information management method, electronic device, and storage medium | |
| CN110322537B (en) | Slide transition animation editing method and related device | |
| CN108108212A (en) | Processing method, device and the terminal of the application list page | |
| JP3556346B2 (en) | Information display device |
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 |