Unlock instant, AI-driven research and patent intelligence for your innovation.

Node layout optimization algorithm based on force guidance

A technique for optimizing algorithm, point layout

Inactive Publication Date: 2018-12-14
HARBIN ENG UNIV
View PDF4 Cites 4 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

However, the algorithm has a large number of iterations and a long iteration period.

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Node layout optimization algorithm based on force guidance
  • Node layout optimization algorithm based on force guidance
  • Node layout optimization algorithm based on force guidance

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0057] Further describe the present invention below in conjunction with accompanying drawing:

[0058] The force-guided point layout optimization algorithm is macroscopically divided into two stages, namely, the gathering stage and the splitting stage.

[0059] Definition Undirected graph G=(V, E) is composed of node set V and edge set E, node set V={v i |1≤i≤n}, where n>0, edge set E={e i |0≤i≤m}, where m≥0, v i and e i are the nodes and edges of graph G, respectively. node {v i ,v j}∈V, if {v i ,v j}∈E, then the two nodes are adjacent. Two edges are adjacent if they share the same node.

[0060] In defining the adjacency matrix A, use 0 or 1 to indicate whether two nodes are adjacent, if adjacent, that is {v i ,v j}∈E, then (a) ij =1; if not adjacent, then (a) ij =0.

[0061] For simplicity, undirected graphs will simply be referred to as graphs in the remainder of this chapter. Through the layout of the graph, the positions of all nodes in the given plan area...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention belongs to the technical field of visual data, and discloses a force-guided node layout optimization algorithm, comprising the following steps: Step (1): defining a node set, an edge setand an undirected graph G; Step (2): setting the total magnitude of attraction in the system, the total magnitude of repulsive force in the system and the total magnitude level function; Step (3): defining M (0); Step (4): the total number of iterations in the aggregation stage and the total number of iterations in the splitting stage of the algorithm are used to represent the aggregation stage of the algorithm; Step (5): components of the attraction force and the repulsive force in the X-axis direction and the Y-axis direction are calculated; 6, repulsive force and attraction force in X andY axes direction in Cartesian coordinate space are used to represent resultant force of nodes in X and Y axes direction in the tth iteration, and then the coordinates after iteration of node are obtained; Step (7): When the number of iterations is equal to a fixed value, the iteration stops and the algorithm ends. The invention solves the problem that the number of iterations in the traditional algorithm is large, and has better expansibility.

Description

technical field [0001] The invention belongs to the technical field of visualized data, in particular to a point layout optimization algorithm based on force guidance. Background technique [0002] The force-directed algorithm refers to the calculation of each node to calculate the resultant force of the gravitational force and the repulsive force, and then move the position of the node based on this resultant force. [0003] The force-directed algorithm is a commonly used method for algorithms suitable for general network-structured data mapping. Through the calculation of each node, calculate the resultant force of attraction and repulsion, and then move the position of the node by this resultant force. After one execution, the new energy value is calculated according to the new position of the node. Like the concept of mechanics, the smaller the energy value, the more stable the entire network is. Generally speaking, the smaller the energy value, the clearer the configu...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
IPC IPC(8): H04L12/24
CPCH04L41/12H04L41/142H04L41/145H04L41/22
Inventor 周连科赵昱杰谢晓东褚慈薛冬梅王念滨王红滨李秀明王勇军迟熙翔
Owner HARBIN ENG UNIV