A front-end visualization method for satellite master station monitoring and management based on X6
By adopting X6-based visualization methods in the monitoring and management of satellite main stations, and automatically adjusting node positions using auxiliary lines and magnetic absorption effects, the problem of interaction in the existing technology is solved, and more intuitive and accurate monitoring and management is achieved.
Patent Information
- Application Number
- CN202310603989.4
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2023-05-26
- Publication Date
- 2025-03-11
- Estimated Expiration
- 2043-05-26
AI Technical Summary
The existing satellite main station monitoring and management methods lack reasonable and convenient interaction, making it difficult to achieve intuitive and accurate monitoring and management.
The front-end visualization method based on X6 is adopted to automatically reach the optimal position through auxiliary lines and magnetic absorption effects, combining data visualization and heartbeat polling to optimize the interactive experience.
It realizes that when users move nodes on the X6 platform, the nodes can reach the optimal position with the helpline and magnetic absorption effects, which improves the rationality and convenience of interaction, and makes the monitoring and management of the satellite main station more intuitive and accurate.
Smart Images

Figure CN116527116B_ABST
Abstract
Description
Technical Field
[0001] The invention relates to the field of satellite communications, and in particular to a front-end visualization method for satellite master station monitoring and management based on X6. Background Art
[0002] The background technologies for the visualization of the satellite master station monitoring and management front end mainly include network technology, database technology, and graphics processing technology. Network technology can be used to achieve network connection between the satellite master station and the monitoring and management platform, thereby realizing data transmission and management; database technology is used to store the operating status and historical records of the satellite master station, which is convenient for data query and analysis; graphics processing technology is used to convert data into visual graphics, which is convenient for people to quickly identify and troubleshoot service station failures.
[0003] X6 provides a very powerful diagram editing engine based on HTML and SVG, and also provides very flexible development interfaces and extension interfaces, providing low-cost customization capabilities and built-in extensions that can be used out of the box, making it easy for us to quickly build applications such as DAG diagrams, ER diagrams, flow charts, and lineage diagrams. In addition, X6 is data-driven and event-driven, based on the MVC architecture, allowing users to focus more on data logic and business logic and monitor any events that occur in the diagram. Therefore, based on the strong support of X6, the complex part of the visualization of satellite master station monitoring and management is no longer the diagram editing itself, but the attribute editing form of each node, as well as the supporting support of the API interface behind the form.
[0004] The current satellite master station monitoring and management methods on the market lack reasonable and convenient interaction. The visualization based on X6 can not only meet all business needs, but also use drag-and-drop to create each device node in the interaction. Users can freely connect to reflect the connection relationship between devices. Subsequently, heartbeat polling of the connection and real-time data visualization of spectrum devices can be realized by monitoring business data. Summary of the invention
[0005] Purpose of the invention: To provide a front-end visualization method for satellite master station monitoring and management based on X6, so that the monitoring and management of satellite master stations becomes more intuitive and accurate.
[0006] Technical solution: The present invention provides a front-end visualization method for satellite master station monitoring and management based on X6, and the specific steps are as follows:
[0007] S1. Store the coordinate data of all nodes on the canvas except the translation point into an array;
[0008] S2, move the translation point, and when it is detected that the coordinate data in the array is within the specified range, use X6 to draw an auxiliary line for the translation point;
[0009] S3. When auxiliary lines are detected at the translation point, an adsorption effect is added to the translation point.
[0010] According to one aspect of the present application, the following embodiments are provided:
[0011] S1. Read each node on the canvas and use one node as the translation point; store the coordinate data of other nodes on the canvas except the translation point into an array;
[0012] S2, moving the translation point, and detecting the coordinate distance between the translation point and each node on the canvas. When it is detected that the coordinate distance between a node in the array and the translation point is less than a preset value, an auxiliary line is generated for the translation point;
[0013] S3. When an auxiliary line is detected at the translation point, an adsorption effect is added to the translation point.
[0014] According to one aspect of the present application, all nodes have width and height, so all nodes have three auxiliary lines in the X-axis and Y-axis directions, respectively. The auxiliary lines in the x-axis direction are one auxiliary line of the node's own coordinates and two auxiliary lines tangent to the node's height; the auxiliary lines in the y-axis direction are one auxiliary line of the node's own coordinates and two auxiliary lines tangent to the node's width.
[0015] According to one aspect of the present application, step S2 is specifically as follows: let the coordinates of the translation point be [X1, Y1], the width be w, and the height be h. When it is detected that the coordinate data of the node in the array meets X1-W / 2≤Xn or Xn≤X1+W / 2, draw an auxiliary line of X= X1-W / 2 or X= X1+W / 2; when it is detected that the coordinate data of the node in the array meets Y1-h / 2≤Yn or Yn≤Y1+h / 2, draw an auxiliary line of Y= Y1-h / 2 or Y= Y1+h / 2; when it is detected that the coordinate data of the node in the array meets Xn= X1 or Yn= Y1, draw an auxiliary line of X= X1 or Y= Y1.
[0016] According to one aspect of the present application, step S3 is specifically as follows: when it is detected that the translation point has an auxiliary line, determine the distance d between the point within the range that is tangent to or intersects with the auxiliary line and the center line parallel to the auxiliary line of the translation point, and when 0.5px≤d≤2px, increase the smoothing speed of the translation point; when d<0.5px, slow down the smoothing speed of the translation point by several times; when d>2px, keep the smoothing speed of the translation point at the original value.
[0017] According to one aspect of the present application, it also includes:
[0018] S4. Design a new layout algorithm based on tree structure to optimize the readability of the layout, make the distance between nodes uniform, and reduce the complexity of the algorithm.
[0019] 1. Starting from the root node, assign a representative node to each node.
[0020] 2. For each node, calculate the position relationship between its parent node and child nodes, and determine its horizontal and vertical position in the layout.
[0021] 3. If there is a gap between the parent node and the child node, add a constraint on the parent node to ensure that the gap is correctly aligned.
[0022] 4. For each parent node, calculate the average position and distance of its child nodes, as well as the radius between child nodes. Arrange all child nodes in order and place them on the virtual ring according to the number of child nodes and radius.
[0023] 5. For each node, calculate its position score by measuring the relative position and distance of each node in the layout. Through multiple iterations, adjust the node position to maximize the score.
[0024] 6. Draw a complete tree structure diagram.
[0025] According to one aspect of the present application, step S23 is further:
[0026] Step S23a, obtaining moving direction data, establishing a moving direction unit vector, obtaining the origin coordinates of the translation point, and rotating the moving direction unit vector left and right by a preset angle θ to obtain a moving direction sector domain;
[0027] Step S23b, searching for each target point in the operation section along the moving direction sector domain to form a target point set;
[0028] Step S23c, obtaining the coordinate data of each target point, calculating the angle between each target point and the origin coordinate of the translation point, and arranging them in ascending order according to the angle to form a first target point sequence.
[0029] According to one aspect of the present application, step S24 is further:
[0030] Step S24a, in the moving direction sector domain, connecting the origin coordinates of the translation point and each target point to form a plurality of sub-sector regions; after the first time period, receiving a user operation response signal within at least two time periods; and obtaining moving speed and moving direction data;
[0031] Step S24b, determining whether the moving direction points to a sub-sector area formed by a target point and the coordinate origin of the translation point, or whether a user operation response in a sub-sector area is received; if one of the above two situations exists, proceed to the next step; otherwise, do not perform the operation;
[0032] Step S24c, adjusting the target point where the sub-sector area is located to be the first target point, and recalculating the moving direction sector domain and the sub-sector area;
[0033] According to one aspect of the present application, step S25 is further:
[0034] Step S25a, obtaining the coordinates of the final target point and the coordinates of the translation point, and calculating the distance between the final target point and the translation point;
[0035] Step S25b, obtaining the moving speed of the user operation response signal, and establishing a picture zooming speed model centered on the coordinates of the final target point, which is positively correlated with the moving speed v0 and negatively correlated with the distance d between the final target point and the translation point; the picture zooming speed v x =kv0 / [C+sqrt(d)]; k and C are constants;
[0036] Step S25c, when the distance is less than a preset value, generate auxiliary lines for the translation point and establish a magnetic mapping relationship between the final target point and the translation point; and based on the magnetic mapping relationship, calculate the shortest moving path between the final target point and the translation point; and make the translation point automatically adsorbed to the final target point along the shortest moving path.
[0037] Beneficial effects: When users implement mobile nodes based on X6, they can use auxiliary lines and magnetic effects to make the nodes reach the optimal position. Combined with data visualization and heartbeat polling, the interaction can be more reasonable and convenient, making the monitoring and management of the satellite master station more intuitive and accurate. BRIEF DESCRIPTION OF THE DRAWINGS
[0038] Figure 1 Auxiliary line graph for the node.
[0039] Figure 2 This is a distance analysis diagram of the magnetic attraction effect.
[0040] Figure 3 This is a diagram of the device connections.
[0041] Figure 4 This is an example of a device guide.
[0042] Figure 5 is a schematic diagram of another embodiment of the present invention. DETAILED DESCRIPTION
[0043] Draw the node topology of the device based on X6, move the nodes of the device by dragging and drop, freely connect the nodes with each other, record the unique identification of the node or connection, and dynamically update the color of the identified node or node connection by monitoring business data to distinguish the online or offline status and realize heartbeat polling. Figure 3The figure shows the general connection relationship topology of the equipment.
[0044] By using the packaged spectrum device, the component is rendered as a component node of X6. When the spectrum analyzer node is connected to other nodes, the spectrum push event is monitored to obtain relevant spectrum data and visualize the data in real time. The parameters of the spectrum analyzer are shown in the following table.
[0045] Ordinal index item parameters
[0046] 1 Frequency range 9kHz~3.6GHz
[0047] 2 Resolution bandwidth 1Hz~3MHz
[0048] 3. Noise level better than -160dBm
[0049] 4 Zero span 1ms~3000s
[0050] 5 Scan modes: continuous, single.
[0051] As mentioned in the background technology, the complexity of realizing the visualization management of the main station is no longer the graph editing itself, but the attribute editing form of each node. Therefore, the first step is to improve the corresponding form structure according to the functional requirements of different nodes:
[0052] Modem: Provides operations for adding, modifying, deleting, querying, and heartbeat polling modem devices. Supports jumping to the modem's web interface through a browser to view device details; if the modem does not have a web management interface, jumping is not supported.
[0053] Spectrum devices: Provides operations for adding, modifying, deleting, querying, and heartbeat polling spectrum devices. Supports obtaining spectrum data and visualizing data by connecting to the selected spectrum analyzer. Supports jumping to the Web interface of the spectrum device through the browser to view device details; if the spectrum device does not have a Web management interface, jumping is not supported.
[0054] Matrix switch: Provides operations of adding, modifying, deleting, querying and heartbeat polling matrix devices. Supports jumping to the web interface of the matrix / switch monitoring system through a browser to view system details. If the matrix / switch monitoring system does not have a web management interface, jumping is not supported.
[0055] Antenna: Provides operations for adding, modifying, deleting, querying, and heartbeat polling antenna devices. Supports jumping to the antenna controller's web interface to view details through a browser. If the antenna controller does not have a web management interface, jumping is not supported.
[0056] Amplifier: Provides operations for adding, modifying, deleting, querying, and heartbeat polling amplifier devices. Supports jumping to the amplifier's Web interface to view details through a browser. If the amplifier does not have a Web management interface, jumping is not supported.
[0057] Power splitter / combiner: Provides operations for adding, modifying, deleting, querying, and heartbeat polling of power splitter / combiner devices. Supports jumping to the power splitter / combiner's Web interface to view details through a browser. If the power splitter / combiner does not have a Web management interface, jumping is not supported.
[0058] Remote Station: Provides the functions of adding, modifying, deleting and viewing remote stations.
[0059] When moving nodes based on X6, auxiliary lines are used to indicate the node position, and the node has a magnetic effect when moving, so that it automatically reaches the optimal node position. The specific steps are as follows:
[0060] S1. Store the coordinate data of all nodes on the canvas except the translation point into an array;
[0061] S2, move the translation point described in S1, and when it is detected that the coordinate data of a node in the array is within the specified range, use X6 to draw an auxiliary line for the translation point;
[0062] The auxiliary lines in step S2 are specifically: all nodes have width and height, so all nodes have three auxiliary lines in the X-axis and Y-axis directions, the auxiliary lines in the X-axis direction are one auxiliary line of the node's own coordinates and two auxiliary lines tangent to the node's height; the auxiliary lines in the Y-axis direction are one auxiliary line of the node's own coordinates and two auxiliary lines tangent to the node's width. Figure 1 The coordinates of the node D shown are [5,5] at this time. The node is 4px wide and 4px high. The XY coordinate system is made with [0, 0] as the origin. The auxiliary lines parallel to the X-axis are y=3, y=5 and y=7. Similarly, the auxiliary lines parallel to the Y-axis are x=3, x=5 and x=7.
[0063] The specific range defined in step S2 is as follows: let the coordinates of the translation point be [X1, Y1], the width be w, and the height be h. When it is detected that the coordinate data of a node in the array meets X1-W / 2≤Xn or Xn≤X1+W / 2, draw an auxiliary line of X= X1-W / 2 or X= X1+W / 2; when it is detected that the coordinate data of a node in the array meets Y1-h / 2≤Yn or Yn≤Y1+h / 2, draw an auxiliary line of Y= Y1-h / 2 or Y= Y1+h / 2; when it is detected that the coordinate data of a node in the array meets Xn= X1 or Yn=Y1, draw an auxiliary line of X= X1 or Y= Y1. Figure 4The figure shows an example of device auxiliary lines. The red point D is the current translation point. Its extension lines on the X-axis and Y-axis intersect at points C, A and F respectively. The auxiliary line below point D on the x-axis does not meet the conditions of being tangent or intersecting with the other points. Therefore, three auxiliary lines are drawn at this time - an auxiliary line above point D on the x-axis and two auxiliary lines on the y-axis.
[0064] S3. When an auxiliary line is detected for the translation point, an adsorption effect is added to the translation point. Specifically, when an auxiliary line is detected for the translation point, the distance d between the point in the range that is tangent to or intersecting with the auxiliary line and the center line parallel to the auxiliary line of the translation point is determined. When 0.5px≤d≤2px, the smoothing speed of the translation point is increased; when d<0.5px, the smoothing speed of the translation point is slowed down several times; when d>2px, the smoothing speed of the translation point remains the original value. Figure 2 As shown, the translation point is D, and its red auxiliary line intersects with point C [Xc, Yc]. If the distance between the center point of point C and the center point of point D is less than or equal to 2px in the direction perpendicular to the auxiliary line, the smoothing speed of point D will be increased to allow point D to reach the center point of point C faster. When point D approaches point C, the smoothing speed will be slowed down several times to achieve the adsorption effect.
[0065] Auxiliary lines indicate the node position and the magnetic effect of the node when it moves enables the node to automatically reach the optimal position. Combined with data visualization and heartbeat polling, the interaction can be more reasonable and convenient, making the monitoring and management of the satellite master station more intuitive and accurate.
[0066] The new tree-structured layout algorithm integrates the main considerations in tree-structured layout, including node distance, position coordination, and gap correction. Compared with traditional algorithms, this algorithm can also achieve acceleration and cache data structures, thereby improving computational efficiency. The mathematical expression of this algorithm is as follows:
[0067] 1. For each node i, its position is (Pi(x), Pi(y)).
[0068] 2. For parent node j, its child node sequence is {C1, C2, ..., Cn}, then the representative node position of the parent node is
[0069] (Aj(x), Aj(y)), where Aj(x) is the average of all child node positions.
[0070] 3. For each child node i, its relative angle at the parent node representative node is ji, and the formula is:
[0071] ji = 2πi / n, where i is the order of child nodes and n is the total number of child nodes.
[0072] 4. The radius of child node i is ri, which is calculated based on the number of child nodes n. The formula is:
[0073] ri = s×n / t, where s is the interval, t is the angle (i.e. 360 degrees), and n is the number of child nodes.
[0074] 5. The position of child node i is (Pi'(x), Pi'(y)), and the formula is:
[0075] Pi'(x) = Aj(x) + ri×cos(ji);
[0076] Pi'(y) = Aj(y) + ri×sin(ji);
[0077] 6. Use relative position and distance to calculate the node's position score:
[0078] Scorei = sum(α(Pi,Pj)×β(ΔDi,j)), where α(Pi,Pj) is the position score between nodes and β(ΔDi,j) is the distance score between nodes.
[0079] 7. Adjust the node positions through multiple iterations and optimization to maximize the total score.
[0080] According to one aspect of the present application, step S23 is further:
[0081] Step S23a, obtaining moving direction data, establishing a moving direction unit vector, obtaining the origin coordinates of the translation point, and rotating the moving direction unit vector left and right by a preset angle θ to obtain a moving direction sector domain;
[0082] Step S23b, searching for each target point in the operation section along the moving direction sector domain to form a target point set;
[0083] Step S23c, obtaining the coordinate data of each target point, calculating the angle between each target point and the origin coordinate of the translation point, and arranging them in ascending order according to the angle to form a first target point sequence.
[0084] This ensures that for each translation operation, the optimal target point can be found for matching and positioning, thereby improving accuracy. It is not only applicable to planar operation sections, but also to non-planar operation sections such as curved screens and complex curves. Therefore, it has good versatility and flexibility in practical applications. The scheme obtains the moving direction fan domain by presetting the angle θ, and searches for the target point set in the fan domain. This can greatly reduce the search range and time, thereby improving efficiency. The scheme determines the matching order by calculating the angle between each target point and the origin coordinates of the translation point. This can avoid matching errors or missed detections due to factors such as errors.
[0085] According to one aspect of the present application, step S24 is further:
[0086] Step S24a, in the moving direction sector domain, connecting the origin coordinates of the translation point and each target point to form a plurality of sub-sector regions; after the first time period, receiving a user operation response signal within at least two time periods; and obtaining moving speed and moving direction data;
[0087] Step S24b, determining whether the moving direction points to a sub-sector area formed by a target point and the coordinate origin of the translation point, or whether a user operation response in a sub-sector area is received; if one of the above two situations exists, proceed to the next step; otherwise, do not perform the operation;
[0088] Step S24c: adjust the target point where the sub-sector-shaped area is located to be the first target point, and recalculate the moving direction sector domain and the sub-sector-shaped area.
[0089] If the target is calculated incorrectly, you can re-find the target by clicking your finger or moving the translation point angle, which greatly improves the operation in the current harsh environment. This ensures that for each translation operation, the optimal target point can be found for matching and positioning, thereby improving accuracy. It can not only greatly reduce the search range and time, thereby improving efficiency, but also avoid matching errors or missed detections due to factors such as errors.
[0090] It provides users with new opportunities to correct errors without performing redundant operations. Error correction can be achieved through simple operations. The solution can be adjusted and optimized according to specific needs, such as increasing or decreasing the time period, adjusting the size of the sub-sector area, etc. Therefore, it has strong scalability and adaptability. The solution does not require complex algorithms and technical support, but only basic mathematical computing capabilities to implement.
[0091] According to one aspect of the present application, step S25 is further:
[0092] Step S25a, obtaining the coordinates of the final target point and the coordinates of the translation point, and calculating the distance between the final target point and the translation point;
[0093] Step S25b, obtaining the moving speed of the user operation response signal, and establishing a picture zooming speed model centered on the coordinates of the final target point, which is positively correlated with the moving speed v0 and negatively correlated with the distance d between the final target point and the translation point; the picture zooming speed v x =kv0 / [C+sqrt(d)]; k and C are constants;
[0094] Step S25c, when the distance is less than a preset value, generate auxiliary lines for the translation point and establish a magnetic mapping relationship between the final target point and the translation point; and based on the magnetic mapping relationship, calculate the shortest moving path between the final target point and the translation point; and make the translation point automatically adsorbed to the final target point along the shortest moving path.
[0095] By calculating the distance between the final target point and the translation point, and establishing a screen zoom speed model centered on the coordinates of the final target point, the screen zoom speed can be adjusted according to the moving speed and distance of the user operation response signal, thereby improving accuracy. By establishing a magnetic mapping relationship between the final target point and the translation point, and calculating the nearest moving path based on the magnetic mapping relationship, the translation point is automatically adsorbed to the final target point along the nearest moving path. This can greatly improve the convenience and comfort of user operation, thereby improving user experience. By establishing a magnetic mapping relationship between the final target point and the translation point, and calculating the nearest moving path based on the magnetic mapping relationship, matching errors or missed detections due to factors such as errors can be avoided, thereby improving reliability.
[0096] The preferred embodiments of the present invention are described in detail above; however, the present invention is not limited to the specific details in the above embodiments. Within the technical concept of the present invention, various equivalent transformations can be made to the technical solutions of the present invention, and these equivalent transformations all belong to the protection scope of the present invention.
Claims
1. A satellite master station monitoring and management front-end visualization method based on X6, which is a map editing engine under AntV, characterized in that: The steps include: S1. Read each node on the canvas and use one node as the translation point; store the coordinate data of other nodes on the canvas except the translation point into an array; S2, moving the translation point, and detecting the coordinate distance between the translation point and each node on the canvas. When it is detected that the coordinate distance between a node in the array and the translation point is less than a preset value, an auxiliary line is generated for the translation point; S3. When an auxiliary line is detected at the translation point, an adsorption effect is added to the translation point; Specifically, step S2 includes setting the coordinates of the translation point to [X1, Y1], the width to w, and the height to h; When it is detected that the coordinate data of a node in the array meets X1-W / 2≤Xn or Xn≤X1+W / 2, draw an auxiliary line of X= X1-W / 2 or X= X1+W / 2; When it is detected that the coordinate data of a node in the array meets Y1-h / 2≤Yn or Yn≤Y1+h / 2, an auxiliary line of Y= Y1-h / 2 or Y= Y1+h / 2 is drawn; when it is detected that the coordinate data of a node in the array meets Xn= X1 or Yn= Y1, an auxiliary line of X= X1 or Y= Y1 is drawn; Xn represents the coordinate value of any node on the canvas on the X axis; Yn represents the coordinate value of any node on the canvas on the Y axis; The step S3 is specifically as follows: When it is detected that there is an auxiliary line at the translation point, the distance d1 between the point tangent to or intersecting the auxiliary line and the center line parallel to the auxiliary line of the translation point within the judgment range is determined. When 0.5px≤d1≤2px, the smoothing speed of the translation point is increased by a predetermined multiple; when d1<0.5px, the smoothing speed of the translation point is slowed down by N times; when d1>2px, the smoothing speed of the translation point remains the original value, and N is a natural number; Alternatively, the step S2 is further: Step S21, receiving a response signal from the user, establishing a mapping relationship between the response signal and the translation point, and marking it; Step S22, receiving a user operation response signal within a preset first time period, including a pressing point force signal or a positioning signal, as well as a moving speed and a moving direction; Step S23, searching for each possible target point in the moving direction to form a target point set, and sorting the set to form a first target point sequence; Step S24, receiving a user operation response signal of at least two time periods after the first time period, and re-searching possible target points to form a second target point sequence, taking the intersection of the first target point sequence and the second target point sequence, and sorting them to obtain a final target point; Step S25, detecting the distance between the final target point and the translation point, and when the distance is less than a preset value, generating an auxiliary line for the translation point; The step S23 is further as follows: Step S23a, obtaining moving direction data, establishing a moving direction unit vector, obtaining the origin coordinates of the translation point, and rotating the moving direction unit vector left and right by a preset angle θ to obtain a moving direction sector domain; Step S23b, searching for each target point in the operation section along the moving direction sector domain to form a target point set; Step S23c, obtaining coordinate data of each target point, calculating the angle between each target point and the coordinate of the origin of the translation point, and arranging them in ascending order according to the angle to form a first target point sequence; The step S24 is further as follows: Step S24a, in the moving direction sector domain, connecting the origin coordinates of the translation point and each target point to form a plurality of sub-sector regions; after the first time period, receiving a user operation response signal within at least two time periods; and obtaining moving speed and moving direction data; Step S24b, determining whether the moving direction points to a sub-sector area formed by a target point and the coordinate origin of the translation point, or whether a user operation response in a sub-sector area is received; if one of the above two situations exists, proceed to the next step; otherwise, do not perform the operation; Step S24c, adjusting the target point where the sub-sector area is located to be the first target point, and recalculating the moving direction sector domain and the sub-sector area; The step S25 is further as follows: Step S25a, obtaining the coordinates of the final target point and the coordinates of the translation point, and calculating the distance between the final target point and the translation point; Step S25b, obtaining the moving speed of the user operation response signal, and establishing a picture zooming speed model centered on the coordinates of the final target point, which is positively correlated with the moving speed v0 and negatively correlated with the distance d2 between the final target point and the translation point; the picture zooming speed v x =kv0 / [C+sqrt(d2)]; k and C are constants; Step S25c: when the distance is less than a preset value, an auxiliary line is generated for the translation point and a magnetic attraction mapping relationship between the final target point and the translation point is established; And based on the magnetic attraction mapping relationship, the shortest moving path between the final target point and the translation point is calculated; The translation point is automatically adsorbed to the final target point along the shortest moving path.
2. According to claim 1, a satellite master station monitoring and management front-end visualization method based on X6 is characterized in that: Set width and height parameters for all nodes. Each node has three auxiliary lines in the X-axis and Y-axis directions. The auxiliary lines in the X-axis direction are one auxiliary line of the node's own coordinates and two auxiliary lines tangent to the node's height; the auxiliary lines in the Y-axis direction are one auxiliary line of the node's own coordinates and two auxiliary lines tangent to the node's width.
3. According to claim 1, a satellite master station monitoring and management front-end visualization method based on X6 is characterized in that: S4. When there is a tree structure, perform the following steps: S41, starting from the root node, assign a representative node to each node; S42: For each node, calculate the position relationship between its parent node and child node, and determine its horizontal and vertical position in the layout; S43, if there is a gap between the parent node and the child node, add a constraint condition to the parent node to ensure that the gap is correctly aligned; S44, for each parent node, calculate the average position and distance of its child nodes, and the radius between the child nodes, arrange all the child nodes in order, and place them on the virtual ring according to the number of child nodes and the radius; S45, for each node, calculating its position score by measuring the relative position and distance of each node in the layout, and adjusting the node position to maximize the score through multiple iterations; S46. Draw a complete tree structure diagram.
Citation Information
Patent Citations
Beidou No.3 inter-satellite link data uplink and downlink visualization method
CN111614479A
Section extraction method based on point cloud mathematical model
CN114863033A