Force-Directed Graph Layout for Clear Node Group Boundaries
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing force-directed graph layouts fail to effectively distinguish and analyze node groups due to dispersed topological relationships, leading to overlapping and unclear group boundaries, which hinders user analysis.
Innovation Solution
A method and apparatus that determine initial position coordinates for nodes within node groups, considering intra-group and inter-group forces to adjust the layout, ensuring a more complete and clear topological structure between nodes and groups, using algorithms like PivotMDS and repulsion/attraction forces to optimize the layout.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Loss of information
If a traditional force-directed layout algorithm is used to present graph data, then the topological structure between nodes can be displayed, but the node groups become dispersed with overlapping boundaries making group distinction difficult
Solution Approach 1:
The patent divides the force calculation into two distinct segments: intra-group forces (acting within node groups) and inter-group forces (acting between different node groups). This segmentation allows independent control over group cohesion and group separation, preventing the dispersion problem while maintaining clear boundary distinction between groups.
Solution Approach 2:
The patent applies different force characteristics to different spatial regions: strong attractive forces within node groups to maintain cohesion, and repulsive forces between node groups to prevent overlap. This local differentiation of force properties ensures that each region of the graph layout has appropriate interaction characteristics for its functional purpose.
2Shape
If nodes are laid out using conventional force-directed algorithms, then individual node connections are visible, but node group boundaries become unclear due to overlapping and dispersion
Solution Approach 1:
The patent merges the positioning of multiple nodes within a node group by applying a common intra-group attractive force that pulls all nodes toward a shared center point. This merging effect maintains tight grouping of nodes while the inter-group repulsive forces keep different merged groups separated, creating clear boundary definitions even with many nodes.
3Productivity
If a force-directed layout is applied to graph data with multiple node groups, then the overall graph structure can be visualized, but the topological relationship between node groups becomes dispersed and hard to analyze
Solution Approach 1:
The patent performs preliminary positioning of node groups by calculating their center points and using these as reference positions for the force-directed algorithm. This preliminary action establishes a structured framework that preserves inter-group topological relationships, allowing the subsequent force-directed optimization to maintain rather than disperse these relationships.
Data Source
AI summary
The present invention relates to the field of data visualization technologies, and discloses a force-directed graph layout method and apparatus, an electronic device, and a storage medium. The force-directed graph layout method of the present invention includes: obtaining graph data; determining initial position coordinates of nodes in the node groups, and constructing an initial force-directed layout graph of the graph data; determining, based on the initial position coordinates of the nodes, an intra-group force and an inter-group force on each node, where the intra-group force corresponds to a node group to which the node belongs, and the inter-group force corresponds to the node group to which the node belongs and another node group; and adjusting the initial force-directed layout graph based on the intra-group force and the inter-group force on the nodes to obtain a target force-directed layout graph.