Merging calculation method for circular combined envelope
Through vector envelope merge technology, the problem of drawing inner and outer contours of multi-circular areas is solved, and clear multi-circular combination envelope vector data is generated, which improves the graphic aesthetics and discernibility of radar situation display.
Patent Information
- Application Number
- CN202510530956.0
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2025-04-25
- Publication Date
- 2025-08-01
AI Technical Summary
The prior art cannot effectively draw the inner and outer contours of multi-circular areas, resulting in messy and difficult to distinguish the graphic display, especially in the radar situation display vector data that combines the envelope cannot be obtained.
Vector envelope merge technology is used to generate vector data of multi-circular combination envelopes through internal and external contour calculation and envelope fitting, and draw clear internal and external contours.
Vector data drawing of multi-circular combination envelopes is realized, the accuracy is not affected by discrete point resolution, the graphic display is clearer and richer, the inner and outer contour data is independently drawn, and the internal relationship is clear.
Smart Images
Figure CN120411285A_ABST
Abstract
Description
Technical Field
[0001] The present invention belongs to the technical field of two-dimensional graphics drawing, and particularly relates to a circular envelope fitting technology. Background Art
[0002] In radar situation display, it is necessary to display circular areas such as the capability range of an airport and the scanning range formed by positions. When there are a large number of circular areas and they intersect with each other, the graphic display will appear intricate and messy, making it difficult to distinguish. Before drawing the envelope graph of a multi-circle combination, it is necessary to perform merging calculation processing.
[0003] A common method for combining envelope merging is the scatter point fitting method: determining a rectangular area that contains the entire circular combination envelope, selecting discrete points within the rectangular area, judging whether each discrete point is within the circular envelope, and obtaining a set of discrete points contained in the envelope, that is, the calculated merged envelope. The result of this method is a discrete point set, not a vector graph. Although the outer contour of the envelope is displayed, the outer contour data cannot be obtained, and the inner contour cannot be calculated and displayed either. Summary of the Invention
[0004] In order to solve the technical problem that the prior art cannot draw the inner contour, the present invention adopts a technical solution of vector envelope merging, performs merging calculation on the boundaries of the intersection regions of multiple circles, generates combined envelope vector data, and produces a technical effect of clearer and richer graphic display.
[0005] The present invention successively performs two steps of inner and outer contour calculation and envelope fitting to perform merging calculation on the circular envelope. The inner and outer contour calculation is based on the positional relationship of the circles, calculates the inner arc segment vector set and the outer arc segment vector set of each circle in the envelope, and provides a basic data model for envelope fitting. Envelope fitting is to connect and merge all the outer arc segments into multiple closed envelopes and use the exclusive OR algorithm to draw all the envelope regions.
[0006] The present invention draws the inner and outer outline lines and the fitting region of the multi-circle combination envelope: calculates and obtains the vector data of the merged envelope, and the accuracy is not affected by the resolution of discrete points; calculates and obtains the outer contour data of the merged envelope, and independently draws the outer contour of the envelope and the inner region of the envelope; calculates and obtains the inner contour data of the merged envelope, highlights the internal relationship of the merged envelope, enriches the graphic information of the merged envelope, and makes the graph of the combined envelope more beautiful.
[0007] According to the coordinates and radii of each circle, traverse the positional relationship between circles; calculate the information of the inner arc segments of each circle to generate a list of inner arc segments; traverse each inner arc segment of each circle, splice it with other arc segments of the circle, and update the list of inner arc segments; according to the list of inner arc segments, calculate the information of the outer arc segments of each circle to generate a list of outer arc segments; traverse each unclosed outer arc segment, splice it with other arc segments to form a closed envelope and draw it.
[0008] Further, starting from the first circle, traverse its separation, tangency, intersection, inclusion, and coincidence relationships with each other circle; if they are separated or tangent to each other pairwise, no processing is performed; if they intersect pairwise, the arc segments of the overlapping area are inner arc segments; if one circle contains another pairwise, the contained circle is removed; if they coincide pairwise, it is determined that the second circle is contained.
[0009] Specifically, let the number of circles be n, and the center coordinates of each circle be (X1, Y1) to (Xn, Yn), and the radii be R1 to Rn; calculate the distance D12 between the center coordinates (X1, Y1) and (X2, Y2). If R1 + R2 ≤ D12, they are separated or tangent to each other pairwise; if R1 + R2 > D12, R1 ≤ R2, R1 + D12 > R2 or R1 + R2 > D12, R2 < R1, R2 + D12 > R1, they intersect pairwise; if R1 + R2 > D12, R1 ≤ R2, R1 + D12 < R2 or R1 + R2 > D12, R2 < R1, R2 + D12 < R1, one circle contains another pairwise; if X1 = X2, Y1 = Y2, and R1 = R2, they coincide pairwise; and so on, calculate from D12 to Dn-1n and traverse each circle.
[0010] Specifically, measure the starting point and ending point coordinates of each inner arc segment; with due north as 0°, in the clockwise direction, the angle between the line connecting the starting point and its corresponding center and the due north direction is the starting radian angle, and the angle between the line connecting the ending point and its corresponding center and the due north direction is the ending radian angle; calculate the starting radian angle, ending radian angle, and their corresponding center coordinates and radii to generate the inner arc segment information of each circle.
[0011] Further, select an inner arc segment from a certain circle and traverse its connection relationship with each other inner arc segment of the circle; if they are connected or have an overlap pairwise, splice the two arc segments; traverse each inner arc segment of the circle until all inner arc segments are spliced.
[0012] Specifically, let the number of unspliced inner arc segments be m, select all unspliced inner arc segments to generate a list of arc segments to be spliced; if arc segment 1 is connected or has an overlap with arc segment 2, splice arc segment 1 and arc segment 2 and update the list of arc segments to be spliced; if the spliced arc segment ≥ 360°, it is determined that the circle is contained, otherwise, merge the information of arc segment 2 into arc segment 1; if arc segment 1 is not connected to arc segment 2, determine whether arc segment 1 is spliced or has an overlap with arc segment 3; and so on, judge from arc segment 1 to arc segment m-1 and traverse each inner arc segment of the circle.
[0013] Further, traverse the list of inner arc segments of each circle, and calculate the information of the outer arc segments of the circle in reverse; if the circle is contained, there is no outer arc segment; if the circle is separated from other circles, there is no inner arc segment, and the outer arc segment is the circle itself; sort the inner arc segments from small to large, the end point of the first inner arc segment is used as the starting point of the first outer arc segment, and the starting point of the second inner arc segment is used as the end point of the first outer arc segment; and so on, to generate outer arc segments, the number of which is equal to that of the inner arc segments.
[0014] Further, assume the number of unclosed outer arc segments is m`, select all unclosed outer arc segments to generate a list of arc segments to be fitted; select an outer arc segment as arc segment 1`, select another outer arc segment whose starting point coincides with the end point of arc segment 1` as arc segment 2`, and splice arc segment 1` and arc segment 2`; and so on, until the end point of arc segment m` coincides with the starting point of arc segment 1`; update the list of arc segments to be fitted until all outer arc segments form a closed envelope.
[0015] Starting from the first envelope, traverse its overlapping relationship with each other envelope; if there is an overlap, the overlapping area is not drawn; if there is no overlap, draw the two envelopes, and draw the inner arc segments as dashed lines. Description of the Drawings
[0016] Figure 1 is the flowchart of envelope merging, Figure 2 is the flowchart of judging the positional relationship of circles, Figure 3 is the flowchart of splicing inner arc segments, Figure 4 is the flowchart of generating outer arc segments, Figure 5 is the flowchart of splicing outer arc segments, Figure 6 is the schematic diagram of splicing multiple envelopes. Detailed Implementation Manner
[0017] The technical solution of the present invention will be specifically described below with reference to the accompanying drawings.
[0018] The envelope merging process is as Figure 1 shown. According to the coordinates and radii of each circle, traverse the positional relationship between circles; calculate the information of the inner arc segments of each circle to generate a list of inner arc segments; traverse each inner arc segment of each circle, splice it with other arc segments of the circle, and update the list of inner arc segments; according to the list of inner arc segments, calculate the information of the outer arc segments of each circle to generate a list of outer arc segments; traverse each unclosed outer arc segment, splice it with other arc segments to form a closed envelope and draw it.
[0019] Starting from the first circle, traverse its separated, tangent, intersecting, contained, and coincident relationships with each other circle, as Figure 2As shown; if they are pairwise disjoint or tangent, no processing is performed; if they intersect pairwise, the arc segments in the overlapping region are the inner arc segments; if one circle contains another pairwise, the contained circle is removed; if they coincide pairwise, it is determined that the second circle is contained.
[0020] Let the number of circles be n, and the center coordinates of each circle be (X1, Y1) to (Xn, Yn), and the radii be R1 to Rn; calculate the distance D12 between the center coordinates (X1, Y1) and (X2, Y2). If R1 + R2 ≤ D12, then they are pairwise disjoint or tangent; if R1 + R2 > D12, R1 ≤ R2, R1 + D12 > R2 or R1 + R2 > D12, R2 < R1, R2 + D12 > R1, then they intersect pairwise; if R1 + R2 > D12, R1 ≤ R2, R1 + D12 < R2 or R1 + R2 > D12, R2 < R1, R2 + D12 < R1, then one circle contains another pairwise; if X1 = X2, Y1 = Y2, R1 = R2, then they coincide pairwise; and so on, calculate from D12 to Dn-1n, traversing each circle.
[0021] Measure the starting point and ending point coordinates of each inner arc segment; with due north as 0°, in the clockwise direction, the angle between the line connecting the starting point and its corresponding center and the due north direction is the starting radian angle, and the angle between the line connecting the ending point and its corresponding center and the due north direction is the ending radian angle; calculate the starting radian angle, ending radian angle, their corresponding center coordinates and radii, and generate the inner arc segment information of each circle.
[0022] Select an inner arc segment from a certain circle and traverse its connection relationship with each other inner arc segment of the circle; if they are pairwise connected or have an overlap, splice the two arc segments; traverse each inner arc segment of the circle until all inner arc segments are spliced.
[0023] Specifically, let the number of unspliced inner arc segments be m, select all unspliced inner arc segments, and generate a list of arc segments to be spliced, as Figure 3 shown; if arc segment 1 is connected to or overlaps with arc segment 2, splice arc segment 1 and arc segment 2, and update the list of arc segments to be spliced; if the spliced arc segment ≥ 360°, it is determined that the circle is contained, otherwise merge the information of arc segment 2 into arc segment 1; if arc segment 1 is not connected to arc segment 2, determine whether arc segment 1 is spliced with or overlaps with arc segment 3; and so on, judge from arc segment 1 to arc segment m - 1, traversing each inner arc segment of the circle.
[0024] Further, traverse the list of inner arc segments of each circle and calculate the information of the outer arc segments of the circle in reverse; if the circle is included, there are no outer arc segments; if the circle is separated from other circles, there are no inner arc segments, and the outer arc segment is the circle itself; sort the inner arc segments from smallest to largest, the end point of the first inner arc segment is used as the starting point of the first outer arc segment, and the starting point of the second inner arc segment is used as the end point of the first outer arc segment; and so on to generate outer arc segments, the number of which is equal to that of the inner arc segments, as Figure 4 shown.
[0025] Further, let the number of unclosed outer arc segments be m`, select all unclosed outer arc segments to generate a list of arc segments to be fitted, as Figure 5 shown; select an outer arc segment as arc segment 1`, select another outer arc segment whose starting point coincides with the end point of arc segment 1` as arc segment 2`, and splice arc segment 1` and arc segment 2`; and so on until the end point of arc segment m` coincides with the starting point of arc segment 1`; update the list of arc segments to be fitted until all outer arc segments form a closed envelope.
[0026] Starting from the first envelope, traverse its overlapping relationship with each other envelope; if there is an overlap, the overlapping area is not drawn; if there is no overlap, draw the two envelopes, and the inner arc segments are drawn as dotted lines, as Figure 6 shown.
[0027] The above are embodiments of the present invention and do not limit the present invention. Any modifications, equivalent replacements, improvements, etc. made within the spirit and principles of the present invention are all included within the protection scope of the present invention.
Claims
1. A combined calculation method for a circular combined envelope, characterized in that, Including: Traverse the positional relationships between circles according to the coordinates and radii of each circle; Calculate the information of the inner arc segments of each circle and generate a list of inner arc segments; Traverse each inner arc segment of each circle, splice it with other arc segments of the circle, and update the list of inner arc segments; according to the list of inner arc segments, calculate the information of the outer arc segments of each circle and generate a list of outer arc segments; traverse each unclosed outer arc segment, splice it with other arc segments to form a closed envelope and draw it.
2. The combined calculation method of the circular combined envelope according to claim 1, characterized in that The traversing the positional relationships between circles includes: starting from the first circle, traversing its separated, tangent, intersecting, containing, and coincident relationships with each other circle; if they are separated or tangent to each other, no processing is performed; if they intersect with each other, the arc segments in the overlapping area are inner arc segments; if one circle contains another, remove the contained circle; if they coincide with each other, it is considered that the second circle is contained.
3. The combined calculation method of the circular combined envelope according to claim 2, characterized in that The traversing the positional relationships between circles includes: assuming the number of circles is n, the center coordinates of each circle are (X1, Y1) to (Xn, Yn), and the radii are R1 to Rn; calculate the distance D12 between the center coordinates (X1, Y1) and (X2, Y2), if R1 + R2 ≤ D12, then they are separated or tangent to each other; if R1 + R2 > D12, R1 ≤ R2, R1 + D12 > R2 or R1 + R2 > D12, R2 < R1, R2 + D12 > R1, then they intersect with each other; if R1 + R2 > D12, R1 ≤ R2, R1 + D12 < R2 or R1 + R2 > D12, R2 < R1, R2 + D12 < R1, then one circle contains another; if X1 = X2, Y1 = Y2, R1 = R2, then they coincide with each other; and so on, calculate from D12 to Dn-1n, and traverse each circle.
4. The combined calculation method of the circular combined envelope according to claim 2, characterized in that The calculating the information of the inner arc segments of each circle includes: measuring the starting point and ending point coordinates of each inner arc segment; taking the due north as 0°, in the clockwise direction, the angle between the line connecting the starting point and its corresponding center and the due north direction is the starting radian angle, and the angle between the line connecting the ending point and its corresponding center and the due north direction is the ending radian angle; calculate the starting radian angle, ending radian angle, and their corresponding center coordinates and radii to generate the information of the inner arc segments of each circle.
5. The combined calculation method of the circular combined envelope according to claim 1, characterized in that, The traversing each inner arc segment of each circle includes: selecting an inner arc segment from a certain circle and traversing its connection relationship with each other inner arc segment of the circle; if they are connected or overlap with each other, splice the two arc segments; traverse each inner arc segment of the circle until all inner arc segments are spliced.
6. The combined calculation method of the circular combined envelope according to claim 5, characterized in that, The splicing it with other arc segments of the circle includes: assuming the number of unspliced inner arc segments is m, select all unspliced inner arc segments to generate a list of arc segments to be spliced; if arc segment 1 is connected or overlaps with arc segment 2, splice arc segment 1 and arc segment 2 and update the list of arc segments to be spliced; if the spliced arc segment ≥ 360°, it is considered that the circle is contained, otherwise merge the information of arc segment 2 into arc segment 1; if arc segment 1 is not connected to arc segment 2, judge whether arc segment 1 is spliced or overlaps with arc segment 3; and so on, judge from arc segment 1 to arc segment m-1, and traverse each inner arc segment of the circle.
7. The combined calculation method of the circular combined envelope according to claim 2, wherein The generation of the outer arc segment list includes: traversing the inner arc segment list of each circle and calculating the outer arc segment information of this circle in reverse; if the circle is included, there is no outer arc segment; if the circle is separated from other circles, there is no inner arc segment and the outer arc segment is the circle itself; sorting the inner arc segments from small to large, using the end point of the first inner arc segment as the starting point of the first outer arc segment, and using the starting point of the second inner arc segment as the end point of the first outer arc segment; and so on to generate outer arc segments, the number of which is equal to that of the inner arc segments.
8. The combined calculation method of the circular combined envelope according to claim 7, characterized in that, The traversal of each unclosed outer arc segment includes: setting the number of unclosed outer arc segments as m`, selecting all unclosed outer arc segments to generate a list of arc segments to be fitted; choosing an outer arc segment as arc segment 1`, choosing another outer arc segment whose starting point coincides with the end point of arc segment 1` as arc segment 2`, and splicing arc segment 1` and arc segment 2`; and so on until the end point of arc segment m` coincides with the starting point of arc segment 1`; updating the list of arc segments to be fitted until all outer arc segments form a closed envelope.
9. The combined calculation method of the circular combined envelope according to claim 1, characterized in that The formation of the closed envelope and drawing includes: starting from the first envelope, traversing its overlapping relationship with each other envelope; if there is overlap, the overlapping area is not drawn; if there is no overlap, the two envelopes are drawn, and the inner arc segments are drawn as dashed lines.