Optical cable same route judgment method and device, storage medium and program product

Abstract

The invention provides a method and device for judging the same route of an optical cable, a storage medium and a program product, and the method comprises the steps: generating a dynamic buffer region of the optical cable route through obtaining the buffer radius and laying segment information of the optical cable route, obtaining the first coordinate information of the optical cable route, and obtaining the first coordinate information of the optical cable route; the first coordinate information is vertex coordinate information of a dynamic buffer area of the optical cable route; and according to the laying section information and the first coordinate information of any two optical cable routes, determining the overlapping rate of a dynamic buffer area, the direction consistency of the optical cable routes and the Hausdorff distance of the dynamic buffer area, and outputting a judgment result of the same route of the optical cable. According to the method, related or close optical cable routes can be accurately identified by generating the dynamic buffer area of the optical cable routes based on the GIS by utilizing laying section information and related resource point position information of the existing optical cable routes, different service requirements of different areas in a complex geographical environment can be adapted, and optical cable same route discrimination is efficiently and accurately realized.

Description

Technical Field

[0001] This application relates to the field of transmission networks, and more specifically, to methods, apparatus, storage media, and program products for determining optical fiber co-routes. Background Technology

[0002] In the field of communication transmission networks, co-routing of optical fibers at least includes situations where they are in the same trench, specifically referring to two physical optical fibers passing through the same duct or pole. In the case of co-routing optical fibers, if the primary and backup service routes are carried on two physical optical fibers sharing the same route, there is a risk of simultaneous interruption of both routes.

[0003] The technical solutions for determining whether optical cables share the same route in related technologies mainly include: 1) importing optical cable routing information into a GIS map, manually checking the distribution of lines, and judging whether the routes are duplicated based on whether there is overlap or intersection; 2) tapping the corresponding optical cable segment at the acquisition end, and judging whether the optical cables share the same route based on the vibration signal received by the equipment at the equipment room end.

[0004] As the construction of transmission networks continues to advance, manual methods for identifying potential risks in the same route are no longer sufficient to meet the actual business needs in terms of efficiency and accuracy. Summary of the Invention

[0005] This application provides a method, apparatus, storage medium, and program product for determining co-route optical cables, aiming to achieve accurate and efficient determination of potential co-route optical cables.

[0006] Firstly, a method for determining optical fiber co-routes is provided, including: Obtain the buffer radius and laying segment information of the optical cable route, wherein the optical cable route includes at least two laying segments, and the laying segment information includes the endpoint coordinate information of the laying segment; Based on the buffer radius and laying section information of the optical cable route, a dynamic buffer of the optical cable route is generated to obtain the first coordinate information of the optical cable route, wherein the first coordinate information is the vertex coordinate information of the dynamic buffer of the optical cable route; Based on the laying segment information and first coordinate information of any two optical cable routes, determine the dynamic buffer overlap rate, optical cable route direction consistency and dynamic buffer Hausdorff distance, and output the optical cable same route determination result.

[0007] Based on the optical cable co-routing determination method described in the first aspect above, the existing optical cable route laying section information and related resource point location information can be used in the GIS system to accurately identify related or nearby optical cable routes by generating a dynamic buffer. This method can adapt to different business needs in different areas under complex geographical environments and efficiently and accurately achieve optical cable co-routing determination.

[0008] In conjunction with the first aspect, in some implementations of the first aspect, before obtaining the buffer radius and laying section information of the optical cable route, the method further includes: Obtain the endpoint coordinate information of all laying segments in the target optical network transmission system; When the distance between any two endpoints in all laying sections is less than or equal to a first preset distance, their coordinate information is corrected to the same parameters.

[0009] In conjunction with the first aspect, in some implementations of the first aspect, before obtaining the buffer radius and laying section information of the optical cable route, the method further includes: Sampling points are set at preset distances along the optical cable route to obtain the direction change angle of the sampling points. The curvature of the sampling points is determined based on the direction change angle of the sampling points and the total length of the adjacent sampling segments of the sampling points. If the curvature of the sampling point is greater than or equal to the preset curvature, the sampling point is marked as a key node.

[0010] In conjunction with the first aspect, in some implementations of the first aspect, after marking the sampling point as a key node, the method further includes: Obtain the basic radius, segment node density, and maximum node density of the optical cable route, wherein the segment node density is determined by the number of original nodes and the number of critical nodes per unit length of the optical cable route, and the original nodes are the endpoints of each laying segment included in the optical cable route; The buffer radius of the optical cable route is determined based on the base radius, the segment node density, and the maximum node density.

[0011] In conjunction with the first aspect, in certain implementations of the first aspect, the step of determining the dynamic buffer overlap rate, optical cable route direction consistency, and dynamic buffer Hausdorff distance based on the laying segment information and first coordinate information of any two optical cable routes, and outputting the optical cable co-routes determination result, includes: Based on the first coordinate information, the minimum bounding rectangle of the dynamic buffer is generated, and the second coordinate information of the optical cable route is obtained. The second coordinate information is the vertex coordinate information of the minimum bounding rectangle of the dynamic buffer of the optical cable route. Based on the second coordinate information of all optical cable routes, determine the candidate pairs of optical cables with the smallest overlapping bounding rectangles, wherein the candidate pairs of optical cables contain two of the optical cable routes; Based on the laying segment information and first coordinate information of the two optical cable routes included in the optical cable candidate pair, the dynamic buffer overlap rate, optical cable route direction consistency and dynamic buffer Hausdorff distance are determined, and the optical cable same route determination result is output.

[0012] In conjunction with the first aspect, in certain implementations of the first aspect, determining the candidate optical cable pairs with the smallest overlapping circumscribed rectangles based on the second coordinate information of all optical cable routes includes: Construct an R-Tree hierarchical structure for the minimum bounding rectangle. The R-Tree hierarchical structure includes a root node, at least one intermediate node, and at least one leaf node. The root node contains all the intermediate nodes, and each intermediate node contains multiple different leaf nodes. Each leaf node can accommodate a preset number of minimum bounding rectangles. Different leaf nodes have different coordinate ranges, and different intermediate nodes also have different coordinate ranges. Based on the coordinate range of the leaf node and the second coordinate information, store all the minimum bounding rectangles into the leaf node; Based on the second coordinate information of the optical cable route, other intersecting minimum bounding rectangles are queried in the R-Tree hierarchy to determine the candidate optical cable pairs with overlapping minimum bounding rectangles.

[0013] In conjunction with the first aspect, in certain implementations of the first aspect, the step of determining the dynamic buffer overlap rate, optical cable route direction consistency, and dynamic buffer Hausdorff distance based on the laying segment information and first coordinate information of the optical cable candidate pair, and outputting the optical cable co-route determination result, includes: Obtain the first coordinate information of the two optical cable routes in the optical cable candidate pair, and determine the dynamic buffer area and overlapping area of ​​the two optical cable routes in the optical cable candidate pair. The overlap rate is determined based on the area of ​​the overlapping region and the dynamic buffer area of ​​the two optical cable routes in the optical cable candidate pair; When the overlap rate is not less than a first threshold, the origin and destination coordinates of the two optical cable routes in the optical cable candidate pair are obtained, the directions of the two optical cable routes in the optical cable candidate pair are determined according to the origin and destination coordinates, and the direction consistency of the optical cable candidate pair is determined according to the directions. When the directional consistency is not greater than the second threshold, the location information of the two optical cable routes in the optical cable candidate pair is obtained, and the Hausdorff distance of the optical cable candidate pair is determined based on the location information of the optical cable candidate pair. When the Hausdorff distance of the candidate optical cable pair is not greater than the third threshold, the two optical cable routes in the candidate optical cable pair are determined to be the same route.

[0014] Secondly, a device for determining optical cable co-routes is provided, comprising: The acquisition module is used to acquire the buffer radius and laying segment information of the optical cable route, wherein the optical cable route includes at least two laying segments, and the laying segment information includes the endpoint coordinate information of the laying segments. The dynamic buffer generation module is used to generate a dynamic buffer of the optical cable route based on the buffer radius and laying section information of the optical cable route, and obtain the first coordinate information of the optical cable route, wherein the first coordinate information is the vertex coordinate information of the dynamic buffer of the optical cable route. The same route determination module is used to determine the overlap rate of the dynamic buffer, the consistency of the optical cable route direction, and the Hausdorff distance of the dynamic buffer based on the laying section information and the first coordinate information of any two optical cable routes, and output the same route determination result of the optical cable.

[0015] Thirdly, a readable computer storage medium is provided, on which a computer program is stored, wherein... When the computer program is executed by a processor, it implements the steps of the method described in any of the first aspects.

[0016] Fourthly, a computer program product is provided, including a computer program / instructions that, when executed by a processor, implement the steps of the method described in any one of the first aspects.

[0017] The beneficial effects of this invention are as follows: The optical cable co-routing determination method provided by this invention can, on the one hand, generate a dynamic buffer zone characterizing the co-routing risk range of optical cable routes based on the buffer radius and laying section information of the optical cable routes. Since the buffer radius of optical cable routes is different in different regions, the range of the generated dynamic buffer zone is also different, thus adapting to the different business requirements of different regions in complex geographical environments. On the other hand, it can determine the overlap rate of the dynamic buffer zone, the consistency of the optical cable route direction, and the Hausdorff distance of the dynamic buffer zone based on the laying section information of any two optical cable routes and the vertex coordinate information of the dynamic buffer zone of the optical cable routes. Based on the overlap rate of the dynamic buffer zone, the consistency of the optical cable route direction, and the Hausdorff distance of the dynamic buffer zone, it can determine the similarity between the two optical cable routes, accurately determine the spatial proximity of the optical cable routes, and the entire process can be automatically processed in batches in a GIS system, enabling efficient and accurate optical cable co-routing determination. Attached Figure Description

[0018] Figure 1 This is a schematic diagram of the optical cable co-routing determination method provided in the embodiments of this application; Figure 2 This is a schematic diagram of the optical cable route and the laying sections it passes through in the embodiments of this application; Figure 3 This is a schematic diagram of the dynamic buffer zone for optical cable routing in the embodiments of this application; Figure 4 This is a schematic diagram of the overlap of two optical cable routing dynamic buffers in the embodiments of this application; Figure 5 This is a schematic diagram of optical cable routing sampling points in the embodiments of this application; Figure 6 This is a schematic diagram of the minimum circumscribed rectangle of the dynamic buffer zone for optical cable routing in the embodiments of this application; Figure 7 This is a schematic diagram showing the relationship between the minimum bounding rectangle overlap and coordinates in the embodiments of this application; Figure 8 This is a schematic diagram of an R-Tree hierarchical structure constructed in the embodiments of this application; Figure 9 This is a schematic diagram of another optical cable co-routing determination method provided in the embodiments of this application; Figure 10 This is a schematic diagram of another optical cable co-routing determination method provided in the embodiments of this application; Figure 11 This is a schematic diagram of the optical cable co-routing determination device provided in the embodiments of this application. Detailed Implementation

[0019] The technical solutions in this application will now be described in conjunction with the accompanying drawings. To facilitate understanding of the embodiments of this application, the following explanations will be provided first.

[0020] In this application, “at least one” means one or more, and “more than one” means two or more.

[0021] In this application, the terms "exemplary" or "for example" are used to indicate that something is an example, illustration, or description. Any embodiment or design described as "exemplary" or "for example" in this application should not be construed as being more preferred or advantageous than other embodiments or designs. It should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention. Furthermore, the technical features involved in the various embodiments of the invention described below can be combined with each other as long as they do not conflict with each other.

[0022] In a network transmission system, the smallest unit of optical fiber routing is the bearer point. A bearer point refers to various line equipment or facilities, including optical junction boxes, optical fiber distribution boxes, optical terminal boxes, manholes, poles, support points, and lead-in points. Bearer points are connected in pairs by laying sections, and multiple laying sections connected end-to-end constitute an optical fiber route. In the field of communication transmission networks, co-routing of optical fibers includes at least the case of sharing the same trench, specifically meaning that two physical optical fibers pass through the same duct or pole. In the case of co-routing optical fibers, if the primary and backup service routes are carried by two physical optical fibers sharing the same route, there is a risk of simultaneous interruption of both primary and backup routes.

[0023] The technical solution provided in this application embodiment realizes the same-route determination of optical cable routes based on GIS (Geographic Information System). By importing the optical cable route information involved in the network transmission system within a predetermined area, such as geographical location coordinates and carrier density, into the GIS system, the optical cable segments that need to be determined for same-route determination are automatically determined in batches based on the existing optical cable route data in a digital way, which is time-saving and efficient.

[0024] Specifically, in one embodiment of this application, such as Figure 1 As shown, a method for determining optical fiber co-routes is provided, including: S100: Obtain the buffer radius and laying segment information of the optical cable route. The optical cable route contains at least two laying segments, and the laying segment information includes the endpoint coordinates of the laying segments.

[0025] As can be understood, a laying section refers to a physical optical cable segment connecting two adjacent bearer points. A bearer point refers to various line equipment or facilities, including optical junction boxes, optical fiber distribution boxes, optical terminal boxes, manholes, utility poles, support points, and lead-in points. Routing refers to determining the transmission path of data packets from the source node to the destination node based on the network topology and routing strategy. Multiple laying sections traversed by this transmission path, connected end-to-end, constitute an optical cable route.

[0026] Furthermore, such as Figure 2 The diagram illustrates a specific optical cable route and its various laying segments. This route passes through three segments: AB, BC, and CD. A, B, C, and D are the endpoints of these segments and the carrying points on the route. The broken line AB-BC-CD represents the centerline of this optical cable route. The buffer radius characterizes the area extending from the centerline to both sides. It can be understood that other optical cable routes within this radius have a significant risk of sharing the same route with this optical cable route.

[0027] S200: Based on the buffer radius and laying section information of the optical cable route, a dynamic buffer of the optical cable route is generated to obtain the first coordinate information of the optical cable route. The first coordinate information is the vertex coordinate information of the dynamic buffer of the optical cable route.

[0028] Specifically, such as Figure 3The diagram illustrates a dynamic buffer zone for a specific optical cable route. This route expands outwards from the centerline (broken line AB-BC-CD) to both sides to the buffer radius. The resulting continuous polygons (A'B'C'D'D''C''B''A'') represent the dynamic buffer zone. It's understood that with the centerline and buffer radius determined, the geometric elements of the generated dynamic buffer zone, including its shape and position coordinates, are also fixed and can be solved arbitrarily based on plane geometry principles; no limitations are imposed here. The dynamic buffer zone can be used to characterize the red line for determining if two optical cables share the same route. If the buffer zones of two optical cables overlap significantly, the likelihood of them sharing the same route is relatively high. Considering the significant differences in optical cable laying density across different regions (e.g., urban areas have a much higher density than rural areas), using a uniform standard for buffer zone settings would greatly reduce the accuracy and efficiency of route determination. Therefore, the concept of a dynamic buffer zone is introduced, where the dynamic buffer zone range differs for different regions to adapt to the service needs of different areas.

[0029] Furthermore, the vertex coordinates of the dynamic buffer zone can be determined based on the coordinates of the endpoints of each section of the optical cable route and the buffer radius. Taking the solution of the coordinates of vertex A' as an example, the coordinates of endpoints A and B and the buffer radius are determined, denoted as A(X). A Y A ), B (X) B Y B Let the buffer radius be R. Let the coordinates of point A' be (X...). A +a, Y A +b), based on the vector method, we know that vector with vector Perpendicular, and vector Given that the modulus is R, we can obtain: (Equation 1.1) Solving for: (Equation 1.2) It is understandable that the positive and negative values ​​of a and b can be determined based on the relative position of point A' to point A, thereby determining the coordinates of point A'. Furthermore, the coordinates of the vertices of the dynamic buffer such as A'', D', and D'' can all be determined in the same way. Of course, they can also be obtained using analytical geometry or other methods. The solution method is not limited here.

[0030] For example, such as Figure 3 As shown, to solve for the coordinates of vertices such as B' in the middle of a continuous polygon like a dynamic buffer, we can solve for them based on the coordinates of the vertices (A', A'', D', D'') at both ends of the dynamic buffer, and then solve for them based on the condition of vector parallelism. For example, we can solve for them based on the vectors ( and , and , and Given the parallel conditions, the coordinates of points B' and C' are solved comprehensively. Alternatively, the equations of the lines containing each side of the polygon can be obtained through analytical geometry to determine the coordinates of the intersection points; the solution method is not limited here. It is understood that this is intended to illustrate that, given a fixed centerline and buffer radius, the geometric elements of the generated dynamic buffer zone, including its shape and position coordinates, are also fixed. This implementation method is readily understood by those skilled in the art and is not intended to limit the technical solution.

[0031] S300: Based on the laying segment information and first coordinate information of any two optical cable routes, determine the dynamic buffer overlap rate, optical cable route direction consistency and dynamic buffer Hausdorff distance, and output the optical cable same route determination result.

[0032] Specifically, the method for determining the overlap rate of the dynamic buffer is as follows. Figure 4 This is a schematic diagram illustrating the overlap of two dynamic buffer zones for optical cable routes in an embodiment of this application. For example... Figure 4 As shown, the dynamic buffers of optical cable route 1 and optical cable route 2 overlap. First, determine the areas of dynamic buffer 1 and dynamic buffer 2 respectively, which can be denoted as S1 and S2 respectively; second, determine the area of ​​the overlapping region, which can be denoted as S. 重 Understandably, based on S200, once the coordinates of the vertices of the dynamic buffer are determined, their shape, position, area, and overlapping region, among other geometric elements, are also determined. These can be obtained using geometric or analytical methods based on geometric principles. The specific solution method is not limited here, nor will S1, S2, and S... be discussed in detail. 重 The solution process does not affect the understanding of the specific implementation of this embodiment by those skilled in the art.

[0033] For example, the dynamic buffer overlap ratio can be denoted as O, which can be expressed by S. 重 The ratio of the minimum values ​​in S1 and S2 is determined by the following formula: (Equation 1.3) For example, the dynamic buffer overlap rate O can also be determined by S. 重 The ratio to the maximum or mean value in S1 and S2 is used to determine this. When the overlap rate O is greater than a preset overlap rate threshold... At that time, it was considered that the two optical cable routes posed a significant risk of being on the same route. Overlap rate threshold. The specific ratio can be determined based on the needs of different business scenarios, such as 80% in urban areas and 50% in the wild. This is not a fixed limit.

[0034] Specifically, the method for determining the consistency of optical cable routing direction is as follows: It is determined by the direction vector from the starting point to the ending point of the optical cable route. Characterizing the direction of the optical cable route, such as Figure 4 As shown, the direction vectors of optical cable routes 1 and 2 can be denoted as: (Equation 1.4) Among them, X start X end Y start Y end These are the x and y coordinates of the beginning and end points of the optical cable route. It can be understood that the beginning and end points of the optical cable route are the coordinates of the endpoints of the first and last laying sections on that route. The laying section information has already been obtained in step S100 and does not need to be obtained again in this step. It can be understood that the angle between two vectors can be solved using the law of cosines, or it can be solved using geometric or analytical methods. The specific solution process is not limited here.

[0035] The angle θ between the direction vectors of optical cable routes 1 and 2 can characterize the directional consistency of the two optical cable routes. When the angle θ is less than a preset angle threshold... This indicates that the two optical cables have a high degree of consistency in their routing directions, posing a significant risk of them sharing the same route. Angle threshold. The angle can be determined based on the needs of different business scenarios, such as 15° in cities / 45° in the wild, but it is not limited here.

[0036] Specifically, the Hausdorff distance of a dynamic buffer is determined as follows. The Hausdorff distance is the maximum distance from a point set A to the nearest point in another point set B. Defined as: (Equation 1.5) Where a and b are points in sets A and B respectively, and d(a,b) is any metric between these points. Hausdorff distance is location-sensitive; the same shape will yield different distance values ​​depending on its location. Using Hausdorff distance to measure the maximum and minimum distance between two sets of points (such as two paths) can reflect the similarity of their overall shapes.

[0037] Specifically, the similarity between two optical cable routes is represented by the Hausdorff distance of the dynamic buffer zone between optical cable routes 1 and 2. When the Hausdorff distance is less than a preset Hausdorff distance threshold, the two optical cable routes are considered to have a significant risk of being on the same route. The Hausdorff distance threshold can be determined according to the needs of different business scenarios and is not limited here.

[0038] Furthermore, based on the determination of the dynamic buffer overlap rate, optical cable route direction consistency, and dynamic buffer Hausdorff distance, the optical cable co-routing determination result can be obtained and output in the following ways: For example, a weighted summation method can be used to sum the dynamic buffer overlap rate, optical cable route direction consistency, and dynamic buffer Hausdorff distance of the two optical cable routes and compare it with a preset threshold to determine whether they are co-routes; or, a progressive comparison method can be used, such as after the dynamic buffer overlap rate of the two optical cable routes meets a certain condition (condition one), further determining whether the optical cable route direction consistency meets the condition (condition two), and after the direction consistency meets a certain condition, further determining whether the dynamic buffer Hausdorff distance meets the condition (condition three), and concluding that they are co-routes when all three conditions (condition one to condition three) are met.

[0039] Based on the technical solution provided in this embodiment, on the one hand, a dynamic buffer zone representing the risk range of co-routes of optical cable routes can be generated based on the buffer radius and laying section information of the optical cable route. Since the buffer radius of optical cable routes in different regions is different, the range of the generated dynamic buffer zone is also different, thus adapting to the different business requirements of different regions in complex geographical environments. On the other hand, the overlap rate of the dynamic buffer zone, the consistency of the optical cable route direction, and the Hausdorff distance of the dynamic buffer zone can be determined based on the laying section information of any two optical cable routes and the vertex coordinate information of the dynamic buffer zone of the optical cable route. Based on the overlap rate of the dynamic buffer zone, the consistency of the optical cable route direction, and the Hausdorff distance of the dynamic buffer zone, the similarity between the two optical cable routes can be determined. This can accurately determine the spatial proximity of the optical cable routes, and the entire process can be automatically processed in batches in the GIS system, enabling efficient and accurate identification of co-routes of optical cables.

[0040] In some implementations, another method for determining optical cable co-routes is also provided, which, prior to S100, further includes: S010: Obtain the endpoint coordinate information of all laying segments in the target optical network transmission system.

[0041] It is understandable that the target optical network transmission system can be an optical network transmission system within a certain administrative region or an optical network transmission system within a certain business scope, which can be determined according to actual analysis needs. A laying section refers to the physical optical cable segment connecting two adjacent bearer points. A bearer point refers to various line equipment or facilities, including optical junction boxes, optical fiber distribution boxes, optical terminal boxes, manholes, poles, support points, and lead-in points. The endpoint coordinate information of the laying section is the latitude and longitude coordinates of the bearer point.

[0042] S020: When the distance between any two endpoints is less than the first preset distance, correct their coordinate information to the same parameters.

[0043] As mentioned earlier, the endpoints of optical cable laying sections are typically carrier points, specifically referring to one type of line equipment or facility, including optical junction boxes, optical fiber distribution boxes, optical terminal boxes, manholes, poles, support points, and lead-up points. It is understandable that the coordinate information of carrier points initially collected in actual operations may contain some errors. For example, two laying sections connected to the same carrier point may have their coordinates measured and reported at different times, leading to a certain deviation in the coordinates obtained for the same carrier point at different times. If this is not corrected, it will result in two actually connected laying sections not being connected in the data.

[0044] Furthermore, in this embodiment, when the distance between any two endpoints in the target optical network system is less than a first preset distance, it is considered that the positional deviation between the two is small. For example, when the distance between two endpoints is less than 2 meters, it is considered that the two endpoints are actually the same endpoint, and at this time, their coordinate information is corrected to the same parameters. It is understandable that it is impossible to build two carrier points within a short distance. Specifically, the original coordinates of one of the points can be used as the new coordinates after correction, or the average of the original coordinates of the two endpoints can be used as the new coordinates. The correction method is not limited here; the repair of the breakpoint is achieved through coordinate correction.

[0045] In some implementations, another method for determining optical cable co-routes is also provided, which, before S100 and after S020, further includes: S030: Set sampling points on the optical cable route at preset distance intervals, obtain the direction change angle of the sampling points, and determine the curvature of the sampling points based on the direction change angle of the sampling points and the total length of the adjacent sampling segments of the sampling points; For example, Figure 5 This is a schematic diagram of optical cable routing sampling points in the embodiments of this application. For example... Figure 5 The diagram shows a fiber optic cable route AB-BC-CD, where AB, BC, and CD are laying sections, and A, B, C, and D are the endpoints of these sections. The coordinates of each point are A(0,0), B(10,0), C(10,10), and D(10,20). Sampling points are set along this fiber optic cable route at a preset distance of 10 meters. The sampling points are B and C. Taking point B as an example, its directional change angle is 90° (approximately 1.5708 radians), and the total length of its adjacent sampling sections is 20 meters.

[0046] Furthermore, the curvature of a sampling point is determined by the ratio of the angular change angle in radians of the sampling point to the total length of adjacent sampling segments. For example, the curvature of point B is... .

[0047] S040: If the curvature of the sampling point is greater than the preset curvature, the sampling point is marked as a key node.

[0048] In this embodiment, the preset curvature can be 0.12 rad / m. Since the curvature of point B is less than the preset curvature, point B is not marked as a critical node. Similarly, the curvature of point C is the same as that of point B, so it is not marked as a critical node either. Therefore, the optical cable route AB-BC-CD does not have critical nodes.

[0049] It is understood that this implementation method is based on Figure 5 In certain examples, the sampling point may coincide with the endpoint of the laying section. However, in actual analysis, the sampling point may not necessarily coincide with the endpoint of the laying section, which does not affect the implementation of this embodiment.

[0050] In some implementations, another method for determining optical cable co-routes is also provided, which, before S100 and after S040, further includes: S050: Obtain the basic radius, segment node density, and maximum node density of the optical cable route. The segment node density is determined by the number of original nodes and critical nodes per unit length of the optical cable route. The original nodes are the endpoints of each laying segment included in the optical cable route.

[0051] Specifically, in this embodiment, the basic radius of the optical cable route is the basic value for calculating the buffer radius of the optical cable route. For example, the basic radius can be set according to the type of area where the optical cable route is located. The area type is set according to the actual business needs. For example, the basic radius of urban areas is 5 meters; the basic radius of outdoor areas is 25 meters. Of course, other area types can also be included, which is not limited here.

[0052] Furthermore, the segment node density is determined by the number of original nodes and critical nodes per unit length of the optical cable route. The original nodes are the endpoints of each laying segment traversed by the optical cable route, and the critical nodes are the sampling points marked in the aforementioned steps whose curvature is greater than a preset curvature. For example, as... Figure 5 As shown, the optical cable route AB-BC-CD is 30m long, with 4 original nodes and 0 critical nodes. The segment node density can be (original number of nodes + segment node number) / optical cable route length, i.e., 4 / 30 (nodes / km). The maximum node density can be set according to the type of area where the optical cable route is located. For example, it could be 100 nodes / km in cities and 50 nodes / km in the wild. Of course, other settings are also possible, and there are no restrictions here.

[0053] S060: Determine the buffer radius of the optical cable route based on the base radius, segment node density, and the maximum node density.

[0054] For example, the buffer radius of the optical cable route can be determined according to the following formula: (Equation 4.1) For example, if the length of a fiber optic cable route in a certain urban area is 100m, the original number of nodes is 5, and the number of critical nodes added by curvature analysis is 3, then its segment node density is 80 nodes / km; furthermore, with 5m as the basic radius of the urban area and 100 nodes / km as the maximum node density of the urban area, the buffer radius of the fiber optic cable route can be determined to be 1m.

[0055] Based on the technical solution provided in this embodiment, the buffer radius is dynamically adjusted according to different regional attributes and the density of carrier points per unit length. Through the dynamic adjustment of the buffer, a co-route detection strategy of "high precision in key areas and high efficiency in ordinary areas" is achieved, thus achieving a balance between accuracy and efficiency. It can be adapted to complex geographical environments and can solve the contradiction between accuracy and efficiency in complex routing scenarios in traditional methods.

[0056] In some implementations, another method for determining co-routes of optical cables is also provided. In this method, based on the laying segment information and first coordinate information of any two optical cable routes, the overlap rate of the dynamic buffer, the consistency of the optical cable route direction, and the Hausdorff distance of the dynamic buffer are determined, and the co-routes determination result is output, including: S400: Based on the first coordinate information, generate the minimum bounding rectangle of the dynamic buffer and obtain the second coordinate information of the optical cable route. The second coordinate information is the vertex coordinate information of the minimum bounding rectangle of the dynamic buffer of the optical cable route.

[0057] Specifically, such as Figure 6 The diagram illustrates the generation of the minimum bounding rectangle (MBR) for a dynamic buffer zone of a fiber optic cable route. The minimum bounding rectangle (MBR) is the rectangular boundary defined by the maximum / minimum x / y coordinates of the vertices of a two-dimensional shape. Based on the first coordinate information obtained in step S200, the maximum / minimum x / y coordinates of the vertices of the dynamic buffer zone (a two-dimensional continuous polygon) can be determined, thus determining the minimum bounding rectangle of the dynamic buffer zone. Furthermore, the second coordinate information is specifically (X... min Y min ), (X) min Y max ), (X) max Y min ), (X) max Y max ).

[0058] S410: Based on the second coordinate information of all optical cable routes, determine the candidate optical cable pair with the smallest overlapping outer rectangle, wherein the candidate optical cable pair contains two optical cable routes.

[0059] Specifically, based on the vertex coordinates (X) of a minimum bounding rectangle min Y min ), (X) min Y max ), (X) max Y min ), (X) max Y max The minimum bounding rectangle can be represented in coordinate range form: (Equation 1.3) By determining whether the coordinate ranges of the minimum bounding rectangles overlap, it can be determined whether two minimum bounding rectangles overlap. Specifically, if both the horizontal and vertical coordinate ranges overlap, it can be determined that the two minimum bounding rectangles overlap. In this case, the corresponding two optical cable routes are output as candidate optical cable pairs.

[0060] For example, such as Figure 7 The diagram shows the location distribution of the dynamic buffer zones and minimum bounding rectangles of optical cable routes 1, 2, and 3 within a certain area. The minimum bounding rectangles of optical cable routes 1 and 2 overlap, reflecting the following relationship in the coordinate range: (Equation 5.1) The minimum bounding rectangles of optical cable routes 1 and 2 do not overlap with the minimum bounding rectangle of optical cable route 3. This is reflected in the coordinate range as follows: (Equation 5.2) (Equation 5.3) Understandably, by using the vertex coordinates / coordinate range of the minimum bounding rectangle, fiber optic cable pairs with non-overlapping minimum bounding rectangles can be quickly filtered out. The remaining candidate pairs, however, cannot be ruled out as having the same route risk due to overlapping minimum bounding rectangles, requiring further precise judgment. This filtering method is highly beneficial for improving the efficiency of fiber optic cable route determination. First, the minimum bounding rectangle can, to some extent, characterize the range of the risk of the fiber optic cable route being the same route. When the minimum bounding rectangles are non-overlapping, the dynamic buffer zones cannot overlap, and the corresponding two fiber optic cable routes can be directly ruled out as having the same route risk without further precise comparison and calculation. Second, the characteristic that the minimum bounding rectangle is parallel to the coordinate axes of its coordinate system allows for rapid derivation after determining the extreme values ​​of the dynamic buffer zone vertex coordinates, enabling batch processing in the GIS system based on this implementation method, greatly improving processing efficiency.

[0061] S420: Based on the laying section information and first coordinate information of the optical cable candidate pair containing two optical cable routes, determine the dynamic buffer overlap rate, optical cable route direction consistency and dynamic buffer Hausdorff distance, and output the optical cable same route determination result.

[0062] Specifically, the dynamic buffer overlap rate of a candidate optical cable pair can be determined based on the dynamic buffer areas of the two optical cable routes included in the candidate pair, and the overlapping area of ​​their dynamic buffers, which will not be elaborated here. Meanwhile, a dynamic buffer overlap rate threshold can be determined based on the service requirements of different regions, for example, 80% in urban areas and 50% in rural areas. If the overlap rate exceeds the threshold, it is considered that the two optical cable routes included in the candidate pair have a risk of sharing the same route.

[0063] Specifically, the consistency of the optical cable routing directions of a candidate optical cable pair can be characterized by the angle between the start and end direction vectors of the two optical cable routes included in the candidate pair. The angle between the two vectors can be calculated using the cosine theorem, which will not be elaborated further here. Furthermore, an angle threshold can be determined based on the needs of different business scenarios, such as 15° in urban areas and 45° in the field. When the angle is less than the preset threshold, it indicates that the two optical cable routes have a high degree of consistency and a significant risk of being on the same route.

[0064] Specifically, the Hausdorff distance of the dynamic buffer of a candidate optical cable pair can be determined based on the dynamic buffers of the two optical cable routes included in the candidate pair, which will not be elaborated here. Meanwhile, the Hausdorff distance threshold can be determined according to the needs of different business scenarios, and is not limited here. The Hausdorff distance of the dynamic buffer represents the similarity between two optical cable routes. When the Hausdorff distance is less than the preset Hausdorff distance threshold, the two optical cable routes are considered to have a significant risk of being on the same route.

[0065] Furthermore, based on the determination of the dynamic buffer overlap rate, optical cable routing direction consistency, and dynamic buffer Hausdorff distance, the conclusion of co-routing can be obtained through a weighted summation method or a progressive comparison method, which will not be elaborated here. Those skilled in the art will clearly understand that, through the above implementation methods or other means, it is possible to obtain and output the optical cable co-routing determination result of the candidate optical cable pairs based on the determination of the dynamic buffer overlap rate, optical cable routing direction consistency, and dynamic buffer Hausdorff distance.

[0066] It is understood that, based on the technical solution provided in this embodiment, the risk range of co-routes of optical cable routes is characterized by the outer rectangle of the dynamic buffer, and the minimum overlap of the outer rectangle is used for judgment. Obviously irrelevant optical cable routes can be quickly eliminated, and local deviations can be accurately quantified in the remaining optical cable candidate pairs, thereby quickly and accurately realizing the co-routes of optical cables.

[0067] In some implementations, another method for determining optical cable co-routes is also provided. In this method, determining the candidate pairs of optical cables with the smallest overlapping bounding rectangles based on the second coordinate information of all optical cable routes includes: S500: Construct an R-Tree hierarchical structure for minimum bounding rectangles. The R-Tree hierarchical structure includes a root node, at least one intermediate node, and at least one leaf node. The root node contains all the intermediate nodes, and each intermediate node contains multiple different leaf nodes. Each leaf node can accommodate a preset number of minimum bounding rectangles. Different leaf nodes have different coordinate ranges, and different intermediate nodes also have different coordinate ranges.

[0068] As we can understand, R-Tree (Real Tree) groups spatial data according to their location and size, storing it in a series of rectangular regions (called "nodes"). Each node not only contains the spatial data itself but also a rectangular boundary that completely covers all the data within it. Thus, when querying data within a specific region, R-Tree can quickly filter out nodes that might contain the required data by comparing the query region with the node's rectangular boundary, and then delve deeper into more granular nodes for a more precise search, significantly reducing the amount of data that needs to be examined.

[0069] Specifically, such as Figure 8 The diagram illustrates an R-Tree hierarchical structure constructed in this embodiment, which includes different levels such as root nodes, intermediate nodes, and leaf nodes. There is exactly one root node, at least one intermediate node, and at least one leaf node. Furthermore, the root node contains all intermediate nodes, and each intermediate node contains a certain number of leaf nodes. Each leaf node can store a preset number of minimum bounding rectangles. This containment relationship refers not only to the containment relationship in coordinate ranges but also to the indexing and indexed relationship of data storage.

[0070] It is understandable that the R-Tree hierarchical structure is a data storage structure. In this embodiment, through the aforementioned inclusion relationship, all the smallest bounding rectangles can be uniquely connected to the leaf nodes, all the leaf nodes can be uniquely connected to the intermediate nodes, and all the intermediate nodes can be connected to the root node, so that data can be queried and indexed from the root node to the lower-level nodes.

[0071] Furthermore, the number of intermediate nodes and leaf nodes must be at least one, and the number of intermediate nodes and leaf nodes can be determined according to the size of the minimum bounding rectangle data storage. It is understandable that by setting multiple intermediate nodes and leaf nodes, all minimum bounding rectangles can be reasonably distributed for storage, enabling data queries to retrieve only a relevant portion of the data instead of querying all of the data. For example, when the number of minimum bounding rectangles to be stored is small (e.g., 50), only one intermediate node and one leaf node can be set up, with all minimum bounding rectangles stored in the leaf node. The root node contains the intermediate node, and the intermediate node contains the leaf node. Alternatively, when the number of minimum bounding rectangles to be stored is large (e.g., 2000), four intermediate nodes and 40 leaf nodes can be set up. The root node contains all four intermediate nodes, each intermediate node contains 10 leaf nodes, and each leaf node stores 50 minimum bounding rectangles. Of course, in this example, each intermediate node can also contain an unequal number of leaf nodes, and each leaf node can also contain an unequal number of minimum bounding rectangles, such as defining the boundaries of different nodes based on the coordinate range. The specific division method is not limited here.

[0072] Furthermore, in the R-Tree hierarchical structure of this embodiment, different nodes at each level are distinguished by setting different coordinate ranges. It can be understood that by setting different coordinate ranges for different nodes, the minimum bounding rectangle of the optical cable route can be stored in the corresponding nodes in an orderly manner, thereby achieving fast indexing and querying.

[0073] S510: Store all the minimum bounding rectangles into the leaf nodes based on the coordinate range of the leaf nodes and the second coordinate information.

[0074] Specifically, in this embodiment, an initial coordinate range can be set for each leaf node. When inserting a minimum bounding rectangle of data into the R-Tree, a suitable leaf node can be found to store it based on the node's coordinate range. For example, starting from the root node, the tree can be traversed downwards until a leaf node with overlapping coordinate ranges is found. Then, it is checked whether the node is full (e.g., a preset number of 50). If not, the new data is directly added; if full, the node needs to be split into two new nodes, and the remaining data and the new data are evenly distributed between these two nodes. The coordinate range of the intermediate node is then updated upwards. If the intermediate node also becomes full, the splitting and updating process continues until the root node is reached.

[0075] S520: Based on the second coordinate information of the optical cable route, query other intersecting minimum bounding rectangles in the R-Tree hierarchy to determine the candidate optical cable pairs with overlapping minimum bounding rectangles.

[0076] Specifically, in this embodiment, for any minimum bounding rectangle of an optical cable route, other intersecting minimum bounding rectangles can be queried in the R-Tree hierarchy. During the query, starting from the root node, the coordinate ranges of intermediate nodes are checked sequentially to see if they overlap with the target area. If there is an overlap, the same operation is performed on the child nodes and their descendant nodes until a leaf node is reached. Finally, the data from all leaf nodes that overlap with the target area are collected, which constitutes the query result.

[0077] For example, results can also be quickly retrieved based on input query criteria. For instance, the minimum bounding rectangle of a certain fiber optic cable route 1 has bottom-left coordinates of (120, 300) and top-right coordinates of (130, 310). Input search criteria: Quickly find other fiber optic cables less than 10 meters away from fiber optic cable route 1. The search starts from the root node, skipping irrelevant branches. For example, the root node is (0, 0, 1000, 1000) (the coordinate range is denoted as (X...). min Y min X max Y max If a node label (e.g., the coordinates of the bottom left and top right vertices of the rectangle) intersects with the query range, continue checking child nodes. If the middle node is "(100,200,200,400)", which intersects with the query range, continue checking leaf nodes. If the leaf node is "(120,280,125,305)", which intersects with the query range, return the fiber optic cable. If a node label does not intersect with the query range, such as "(50,50,80,80)", skip the entire branch.

[0078] It is understandable that the R-Tree hierarchical structure constructed based on this implementation method organizes the outer rectangles into a tree structure according to their spatial location, manages the minimum bounding rectangle, and performs efficient spatial filtering to accelerate spatial indexing. This reduces the computational complexity of optical cable co-routing determination from quadratic to logarithmic levels. Combined with dynamic buffers and multi-dimensional geometric analysis, it achieves a balance between high efficiency and high accuracy, making it particularly suitable for risk assessment and planning optimization of large-scale optical cable networks.

[0079] In some implementations, such as Figure 9 As shown, another method for determining co-route optical cables is also provided. This method, after generating a dynamic buffer and filtering candidate optical cable pairs through an R-Tree hierarchical structure, determines the dynamic buffer overlap rate, optical cable route direction consistency, and dynamic buffer Hausdorff distance based on the laying segment information and first coordinate information of the two optical cable routes contained in the candidate optical cable pairs. The method then outputs the co-route determination result, including: S600: Obtain the first coordinate information of the two optical cable routes in the optical cable candidate pair, and determine the dynamic buffer area and overlapping area of ​​the two optical cable routes in the optical cable candidate pair.

[0080] It is understandable that, given the coordinates of the vertices of the dynamic buffer, their shape, position, area, and overlapping area are all geometric elements that can be determined using geometric or analytical methods based on geometric principles. This will not be elaborated upon here and will not affect those skilled in the art's understanding of the specific implementation of this embodiment.

[0081] S610: Determine the overlap rate based on the area of ​​the overlapping region and the dynamic buffer area of ​​the two optical cable routes in the optical cable candidate pair.

[0082] Specifically, the dynamic buffer overlap rate of the optical cable candidate pair can be determined based on the dynamic buffer area of ​​the two optical cable routes included in the optical cable candidate pair, and the overlap area of ​​their dynamic buffers, which will not be elaborated here.

[0083] S620: When the overlap rate is not less than the first threshold, obtain the start and end point coordinate information of the two optical cable routes in the optical cable candidate pair, determine the direction of the two optical cable routes in the optical cable candidate pair according to the start and end point coordinate information, and determine the direction consistency of the optical cable candidate pair according to the direction.

[0084] Specifically, the overlap rate threshold for the dynamic buffer can be determined based on the business needs of different regions, such as 80% in urban areas and 50% in the field. If the overlap rate exceeds the threshold, it is considered that the two optical cable routes included in the candidate optical cable pair have the risk of being on the same route, and the next step of judgment is taken; otherwise, it is considered that the two optical cable routes do not have the risk of being on the same route, and the judgment result of different routes is directly output.

[0085] Furthermore, the consistency of the optical cable routing direction of the optical cable candidate pair can be characterized by the angle between the start and end direction vectors of the two optical cable routes contained in the candidate pair, and the angle between the two vectors can be solved by the cosine theorem, which will not be explained in detail here.

[0086] S630: When the directional consistency is not greater than the second threshold, obtain the location information of the two optical cable routes in the optical cable candidate pair, and determine the Hausdorff distance of the optical cable candidate pair based on the location information of the optical cable candidate pair.

[0087] Specifically, the included angle threshold can be determined according to the needs of different business scenarios, such as 15° in urban areas and 45° in the field. When the included angle is less than the preset included angle threshold, it indicates that the two optical cable routes have a high degree of consistency and there is a significant risk of co-routing, so the next step of judgment is performed; otherwise, it is considered that the two optical cable routes do not have the risk of co-routing, and the judgment result of different routes is directly output.

[0088] Furthermore, the Hausdorff distance of the dynamic buffer of the optical cable candidate pair can be determined based on the dynamic buffer of the two optical cable routes contained in the optical cable candidate pair, which will not be explained in detail here.

[0089] S640: When the Hausdorff distance between the candidate optical cable pairs is not greater than the third threshold, the two optical cable routes in the candidate optical cable pairs are determined to be the same route.

[0090] Specifically, the similarity between two optical cable routes is represented by the Hausdorff distance of their dynamic buffer zones. If the Hausdorff distance is less than or equal to a preset Hausdorff distance threshold, the two optical cable routes are considered to have a significant risk of being co-routed, and the conclusion that the candidate optical cable pair is co-routed is drawn, outputting the determination result of co-routed optical cables; otherwise, the determination result of different optical cable routes is output. The Hausdorff distance threshold can be determined according to the needs of different business scenarios and is not limited here.

[0091] It is understood that, based on the technical solution provided by this implementation method, on the one hand, a dynamic buffer zone representing the risk range of co-routing of optical cable routes can be generated based on the buffer radius and laying section information of optical cable routes in different regions, thereby adapting to the different business requirements of different regions in complex geographical environments; on the other hand, based on quickly screening out optical cable candidate pairs with co-routing risks, it is possible to further combine the dynamic buffer overlap rate, directional consistency, and Hausdorff distance in the remaining optical cable candidate pairs to accurately quantify local deviations, accurately determine the spatial proximity of optical cable routes, and the entire process can be automatically processed in batches in the GIS system, thereby achieving fast and accurate identification of optical cable co-routing.

[0092] In some implementations, such as Figure 10 As shown, another method for determining optical cable co-routes is also provided, including: S700: Data processing and feature extraction.

[0093] In this step, data processing and feature extraction are carried out on all optical cable routing information collected within the target network transmission system, specifically including the laying sections through which the optical cables are routed and the coordinate information of the endpoints of each laying section, to lay the foundation for subsequent judgment steps.

[0094] Specifically, this step includes: S701: Pretreatment and geometric repair.

[0095] Preprocessing includes outlier replacement and null value filling. Outliers can be replaced by smoothing filtering, and null values ​​can be filled by mean filling.

[0096] Geometric repair includes coordinate system 1 and breakpoint repair. Currently, the four common latitude and longitude coordinate systems are WGS84, BD-9, CGCS2000, and GCJ-02. These different coordinate systems have differences of 50-700 meters and cannot be used interchangeably. In this step, one coordinate system can be selected as the reference, and other coordinate types can be converted to this reference coordinate system to achieve coordinate system 1. It is understandable that since optical cable routes are composed of different laying segments connected end-to-end, physically connected laying segments may not be connected in the data due to errors in endpoint coordinate acquisition. In this step, if the latitude and longitude deviation between two endpoints is small, such as less than 2 meters, the two endpoints can be considered as the same endpoint. For example, if an optical cable consists of two laying segments with a slight deviation in the original data: End point of laying segment 1: (100.0, 200.0), Start point of laying segment 2: (100.1, 199.9), the system automatically corrects the start point of laying segment 2 to (100.0, 200.0) to ensure a seamless connection. Note that this is not limited to the rounding method. In practical applications, the latitude and longitude coordinates of most points are not integers. The coordinates of two points can be unified by taking the larger value, smaller value, average value, etc., to achieve breakpoint repair and ensure the geometric integrity and topological correctness of the optical cable routing data.

[0097] S702: Curvature Analysis and Key Node Marking.

[0098] In practical network construction and application, the paths traversed by optical fiber cables often exhibit curves, which need to be considered in route determination. In this step, sampling points are set at regular intervals along a specific optical fiber route. The curvature of the sampling point is characterized by calculating the rate of change of the directional angle (directional angle divided by the total length of adjacent line segments). For example, in an optical fiber route ABCD, the coordinates of each point are A(0,0)→B(10,0)→C(10,5)→D(15,5). Assuming sampling every 10 meters, the directional angle change for sampling point B is 90°, or 1.5708 rad / meter. The total length of adjacent line segments AB and BC is 15 meters, therefore the rate of change of the directional angle at point B is 0.10472 rad / meter. In this step, if the curvature of a sampling point reaches 0.12 rad / meter (>0.1), it is marked as a critical point.

[0099] Understandably, curvature calculation can effectively quantify the degree of bending of the optical cable route, providing a basis for subsequent route analysis.

[0100] S710: Dynamic buffer settings.

[0101] A buffer zone is a continuous polygonal area extending to both sides of the centerline of each optical cable route. Buffer zones characterize the risk range of co-routes; if the buffer zones of two optical cable routes overlap significantly, the likelihood of co-routes is also relatively high. Considering the significant differences in optical cable laying density across different areas (e.g., urban areas have significantly higher density than rural areas), using a uniform standard for buffer zone settings would greatly reduce the accuracy and efficiency of co-routes determination. Therefore, the concept of a dynamic buffer zone is introduced, adaptively adjusting the buffer zone range based on the environment and local density. Specifically, this includes: S711: Basic Radius Setting. The buffer zone basic radius can be set according to the area type where the optical cable route is located. For example, urban areas: basic radius 5 meters; rural areas: basic radius 25 meters. Of course, the area type and corresponding radius can be increased or decreased according to business analysis needs.

[0102] S712: Dynamic radius adjustment. The radius can be dynamically adjusted according to the density of bearing points per unit length. Where, dynamic radius = basic radius × (1 Segmented node density / Maximum node density).

[0103] The segment node density is the "original number of nodes + critical number of nodes" within a unit length of the current optical cable route. The maximum density is set based on experience, such as 100 nodes / km in cities and 50 nodes / km in the wild.

[0104] S713: Generate corresponding dynamic buffers based on the dynamic radius of each optical cable route. Examples for different scenarios are as follows: (1) Urban Scenario: A certain optical cable route is 100 meters long, with 5 original nodes and 3 new key nodes added through curvature analysis, for a total of 8 segment nodes. Maximum node density (preset empirical value): 100 nodes / km, basic radius of urban area (preset empirical value): 5 meters. Then the segment node density = 8 nodes / 0.1 km = 80 nodes / km, dynamic radius = 5 × (1 80 / 100) = 1 meter. Therefore, the dynamic buffer zone of the optical cable is a continuous polygon that extends vertically to both sides of its centerline to 1 meter.

[0105] (2) Field scenario: A certain optical cable route is 1000 meters long, with 8 original nodes, 0 new key nodes added through curvature analysis, and a total of 8 segment nodes. Maximum node density (preset empirical value): 50 nodes / km, basic radius of field area (preset empirical value): 25 meters. Then the segment node density = 8 nodes / 1 km = 8 nodes / km, dynamic radius = 25 × (1 (8 / 50) = 21 meters. Therefore, the dynamic buffer zone of the optical cable is a continuous polygon that extends vertically to both sides of its centerline to 21 meters.

[0106] Understandably, the dynamic buffer generates a dynamically adjusted protection zone for each optical cable, defining its spatial influence range to characterize the risk areas along the same route of the optical cable.

[0107] S720: Minimum Bounding Rectangle and Spatial Indexing Acceleration. The dynamic buffer is a continuous polygon with a complex shape. By simplifying the dynamic buffer to a minimum bounding rectangle (MBR), it facilitates the rapid exclusion of irrelevant fiber optic pairs, specifically including: S721: Generate outer rectangle.

[0108] Traverse all vertices in the dynamic buffer and extract their coordinates. In a GIS map, a fiber optic cable route consists of a point sequence P1(x1,y1), P2(x2,y2), ..., Pn(xn,yn). Extracting the coordinates of all nodes is actually extracting the latitude and longitude of the point resources.

[0109] Calculate the extreme coordinates: min x =min(x1,x2,…,xn), max x =max(x1,x2,…,xn),min y =min(y1,y2,…,yn),max y =max(y1,y2,…,yn).

[0110] A minimum bounding rectangle is generated with (minx, miny) as the bottom left vertex and (maxx, maxy) as the top right vertex. This minimum bounding rectangle (with sides parallel to the coordinate axes) completely encloses the dynamic buffer. The regular rectangle represents the influence range of the dynamic buffer to a certain extent, enabling fast spatial lookup and collision detection. If the minimum bounding rectangles of two optical cable routes do not overlap, the dynamic buffers cannot overlap, and they are directly determined to be different routes; otherwise, further analysis is required.

[0111] By using the minimum bounding rectangle, a large number of irrelevant optical cable pairs can be filtered out, leaving only some relevant optical cable pairs for further precise analysis, ensuring that the judgment process is efficient and accurate.

[0112] S722: R-Tree spatial index.

[0113] R-Tree is a balanced tree structure for efficiently processing spatial data. It groups spatial objects, each group represented by a minimum bounding rectangle (MBR), and these MBRs are then organized into tree nodes, ensuring ordered storage of spatial data. It is extremely efficient in handling spatial queries such as range queries and nearest neighbor queries. By organizing the bounding rectangles into a tree structure based on spatial location, it supports fast range queries, reducing computational complexity from O(n²) to O(nlogn).

[0114] (1) Generate R-Tree hierarchical structure Leaf node: Set the leaf node capacity (e.g., 50) to directly store the MBR of the optical cable route into the lowest leaf node.

[0115] Intermediate Node: Merges the MBRs of multiple leaf nodes into a larger rectangle, forming the upper-level node (intermediate node). For example, merging the MBRs of leaf nodes 1-50 generates an intermediate node labeled "covering coordinates X1-Y1 to X2-Y2".

[0116] Root node: Finally, the MBRs of all intermediate nodes are merged to form the top-level label.

[0117] (2) Inserting new objects (dynamically updating) Starting from the root node, select the smallest branch of the MBR that covers the coordinate range of the new object. If a leaf node is full (there are already 50 MBRs), split it into two leaf nodes and update the parent node label.

[0118] (3) Quick search Enter search criteria: such as quickly finding other optical cables less than 10 meters away from optical cable A.

[0119] Generate Dynamic Buffer MBR: Generate a 10-meter buffer MBR for optical cable A, such as the lower left coordinate of the outer rectangle being (120, 300) and the upper right coordinate being (130, 310).

[0120] The search begins from the root node, and irrelevant branches are skipped.

[0121] The root node label is "(0,0,1000,1000)", which intersects with the query range, so we continue to check the child nodes.

[0122] The intermediate node label is "(100,200,200,400)", which intersects with the query range. Continue checking the leaf nodes.

[0123] The leaf node label is “(120,280,125,305)”, which intersects with the query range, and the fiber optic cable is returned.

[0124] If a node label does not intersect with the query range (e.g., "(50,50,80,80)"), skip the entire branch.

[0125] R-Tree reduces the computational complexity of optical cable co-routing determination from quadratic to logarithmic levels through hierarchical MBR management and efficient spatial filtering. Combined with dynamic buffers and multi-dimensional geometric analysis, it achieves a balance between high efficiency and high accuracy, making it particularly suitable for risk assessment and planning optimization of large-scale optical cable networks.

[0126] S730: Mixed similarity calculation.

[0127] For the optical cable candidate pairs returned by the spatial index and their dynamic buffer, overlap rate, orientation consistency, and weighted Hausdorff distance are calculated, specifically including: S731: Overlap Rate Calculation: Overlap Rate = Intersection Area / min(Area of ​​Buffer 1, Area of ​​Buffer 2). In the above formula, the larger or average area of ​​the two buffers can also be used as the denominator. The goal of overlapping rate calculation is to quantify the spatial proximity of two optical cable paths, assist in determining whether they meet the co-routing condition, and quickly eliminate candidate pairs that are "locally close but overall unrelated".

[0128] If the overlap rate is less than the threshold (80% in cities / 50% in the wild), different routes are directly determined without further calculation.

[0129] If the overlap rate is greater than or equal to the threshold, proceed to the next indicator calculation.

[0130] S732: Directional Consistency Analysis.

[0131] Fiber optic cable route direction vector calculation: the vector from the starting point to the ending point, V=(xend xstart,yend ystart), the angle between the direction vectors can be derived based on the cosine theorem. Angle thresholds: same direction (<15°), partially same direction (15°~45°), opposite direction (>45°).

[0132] If the directional angle is greater than the threshold (15° in cities / 45° in the wild), different routes are directly determined without further calculation.

[0133] If the directional angle is less than or equal to the threshold, proceed to the final Hausdorff distance calculation.

[0134] S733: Weighted Hausdorff distance calculation.

[0135] The Hausdorff distance is the maximum distance between the nearest points in one set and another, reflecting the similarity of their overall shapes. The Hausdorff distance from set A to set B is a maximin function, defined as follows: H(A,B) = max{min{d(a,b)}} Where a and b are points in sets A and B respectively, and d(a,b) is any metric between these points.

[0136] Furthermore, higher weights are assigned to key nodes in the optical cable route to amplify their distance impact and improve sensitivity to local errors. For example, if the distance to a certain inflection point is calculated to be 12 meters using Hausdorff distance, it becomes 36 meters after adjustment using a weighting factor (weighting factor 3). The weighting factor is determined based on empirical values.

[0137] This step, after filtering based on overlap rate and directional consistency, further quantifies local deviations. If the weighted distance is greater than the threshold (10 meters in cities / 30 meters in the wild), it is determined to be a different route. Otherwise, it is determined to be the same route.

[0138] S740: Judgment rule selection: Adjust the threshold combination according to the environment type (urban / wilderness).

[0139] This step is used to determine the threshold combination for the new round of judgment after each round of judgment is completed, based on the different business areas and regions of the new round of judgment, so that the judgment result meets the business requirements.

[0140] It is understandable that the same-route determination method provided in this implementation method can generate different dynamic buffers by using optical cable paths in different regions, which can adapt to the business analysis needs in complex geographical environments; the minimum bounding rectangle spatial index can accelerate the process and quickly eliminate obviously irrelevant optical cable routes, significantly improving the overall processing and determination efficiency; further, the hybrid similarity combination algorithm can further eliminate obviously irrelevant or locally close optical cable routes, filter paths with large differences in direction, and accurately quantify local deviations in the remaining candidate pairs, thereby achieving accurate and efficient optical cable same-route determination.

[0141] In some implementations, such as Figure 11 As shown, a device for determining the same route of optical cables is also provided, comprising: The acquisition module 810 is used to acquire the buffer radius and laying segment information of the optical cable route. The optical cable route includes at least two laying segments, and the laying segment information includes the endpoint coordinate information of the laying segments. The dynamic buffer generation module 820 is used to generate a dynamic buffer of the optical cable route based on the buffer radius and laying section information of the optical cable route, and obtain the first coordinate information of the optical cable route. The first coordinate information is the vertex coordinate information of the dynamic buffer of the optical cable route. The same route determination module 830 is used to determine the overlap rate of the dynamic buffer, the consistency of the optical cable route direction, and the Hausdorff distance of the dynamic buffer based on the laying section information and the first coordinate information of any two optical cable routes, and output the same route determination result of the optical cable.

[0142] Based on the optical cable co-routing determination device provided in this embodiment, a dynamic buffer is generated to characterize the co-routing risk range of optical cable routes. It can adapt to different business requirements in complex geographical environments. Based on the overlap rate of the dynamic buffer, the consistency of the optical cable route direction, and the Hausdorff distance of the dynamic buffer, the similarity between two optical cable routes is determined. It can accurately determine the spatial proximity of optical cable routes. Moreover, the entire process can be processed in batches in a GIS system, which can efficiently and accurately realize optical cable co-routing determination.

[0143] In some embodiments, a storage medium is also provided on which a computer program is stored. When executed by a processor, the computer program is capable of implementing the steps of any of the methods described in the foregoing embodiments.

[0144] In some embodiments, a computer program product is also provided, including a computer program / instructions. When executed by a processor, the computer program / instructions are capable of implementing the steps of the method described in any of the foregoing embodiments.

[0145] Those skilled in the art will recognize that the units and algorithm steps of the various examples described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are implemented in hardware or software depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of this application.

[0146] Those skilled in the art will clearly understand that, for the sake of convenience and brevity, the specific working processes of the systems, devices, and units described above can be referred to the corresponding processes in the foregoing method embodiments, and will not be repeated here.

[0147] In the several embodiments provided in this application, it should be understood that the disclosed systems, apparatuses, and methods can be implemented in other ways. For example, the apparatus embodiments described above are merely illustrative; for instance, the division of units is only a logical functional division, and in actual implementation, there may be other division methods. For example, multiple units or components may be combined or integrated into another system, or some features may be ignored or not executed. Furthermore, the coupling or direct coupling or communication connection shown or discussed may be through some interfaces; the indirect coupling or communication connection between apparatuses or units may be electrical, mechanical, or other forms.

[0148] The units described as separate components may or may not be physically separate. The components shown as units may or may not be physical units; that is, they may be located in one place or distributed across multiple network units. Some or all of the units can be selected to achieve the purpose of this embodiment according to actual needs.

[0149] In addition, the functional units in the various embodiments of this application can be integrated into one processing unit, or each unit can exist physically separately, or two or more units can be integrated into one unit.

[0150] If the aforementioned functions are implemented as software functional units and sold or used as independent products, they can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of this application, in essence, or the part that contributes to the prior art, or a portion of the technical solution, can be embodied in the form of a software product. This computer software product is stored in a storage medium and includes several instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) to execute all or part of the steps of the methods described in the various embodiments of this application. The aforementioned storage medium includes various media capable of storing program code, such as USB flash drives, portable hard drives, read-only memory (ROM), random access memory (RAM), magnetic disks, or optical disks.

[0151] The above description is merely a specific embodiment of this application, but the scope of protection of this application is not limited thereto. Any variations or substitutions that can be easily conceived by those skilled in the art within the scope of the technology disclosed in this application should be included within the scope of protection of this application. Therefore, the scope of protection of this application should be determined by the scope of the claims.

Claims

1. A method for determining co-route optical cables, characterized in that, include: Obtain the buffer radius and laying segment information of the optical cable route, wherein the optical cable route includes at least two laying segments, and the laying segment information includes the endpoint coordinate information of the laying segment; Based on the buffer radius and laying section information of the optical cable route, a dynamic buffer of the optical cable route is generated to obtain the first coordinate information of the optical cable route, wherein the first coordinate information is the vertex coordinate information of the dynamic buffer of the optical cable route; Based on the laying segment information and first coordinate information of any two optical cable routes, determine the dynamic buffer overlap rate, optical cable route direction consistency and dynamic buffer Hausdorff distance, and output the optical cable same route determination result.

2. The optical cable co-routing determination method according to claim 1, characterized in that, Before obtaining the buffer radius and laying section information of the optical cable route, the method further includes: Obtain the endpoint coordinates of all laying segments in the target optical network transmission system; When the distance between any two endpoints in all laying sections is less than or equal to a first preset distance, their coordinate information is corrected to the same parameters.

3. The optical cable co-routing determination method according to claim 1, characterized in that, Before obtaining the buffer radius and laying section information of the optical cable route, the method further includes: Sampling points are set at preset distances along the optical cable route to obtain the direction change angle of the sampling points. The curvature of the sampling points is determined based on the direction change angle of the sampling points and the total length of the adjacent sampling segments of the sampling points. If the curvature of the sampling point is greater than or equal to the preset curvature, the sampling point is marked as a key node.

4. The optical cable co-routing determination method according to claim 3, characterized in that, After marking the sampling points as key nodes, the method further includes: Obtain the basic radius, segment node density, and maximum node density of the optical cable route, wherein the segment node density is determined by the number of original nodes and the number of critical nodes per unit length of the optical cable route, and the original nodes are the endpoints of each laying segment included in the optical cable route; The buffer radius of the optical cable route is determined based on the base radius, the segment node density, and the maximum node density.

5. The optical cable co-routing determination method according to any one of claims 1-4, characterized in that, The process involves determining the dynamic buffer overlap rate, optical cable route direction consistency, and dynamic buffer Hausdorff distance based on the laying segment information and first coordinate information of any two optical cable routes, and outputting the optical cable co-routes determination result, including: Based on the first coordinate information, the minimum bounding rectangle of the dynamic buffer is generated, and the second coordinate information of the optical cable route is obtained. The second coordinate information is the vertex coordinate information of the minimum bounding rectangle of the dynamic buffer of the optical cable route. Based on the second coordinate information of all optical cable routes, determine the candidate pairs of optical cables with the smallest overlapping bounding rectangles, wherein the candidate pairs of optical cables contain two of the optical cable routes; Based on the laying segment information and first coordinate information of the two optical cable routes included in the optical cable candidate pair, the dynamic buffer overlap rate, optical cable route direction consistency and dynamic buffer Hausdorff distance are determined, and the optical cable same route determination result is output.

6. The optical cable co-routing determination method according to claim 5, characterized in that, The step of determining the candidate optical cable pairs with the smallest overlapping circumscribed rectangles based on the second coordinate information of all optical cable routes includes: Construct an R-Tree hierarchical structure for the minimum bounding rectangle. The R-Tree hierarchical structure includes a root node, at least one intermediate node, and at least one leaf node. The root node contains all the intermediate nodes, and each intermediate node contains multiple different leaf nodes. Each leaf node can accommodate a preset number of minimum bounding rectangles. Different leaf nodes have different coordinate ranges, and different intermediate nodes also have different coordinate ranges. Based on the coordinate range of the leaf node and the second coordinate information, store all the minimum bounding rectangles into the leaf node; Based on the second coordinate information of the optical cable route, other intersecting minimum bounding rectangles are queried in the R-Tree hierarchy to determine the candidate optical cable pairs with overlapping minimum bounding rectangles.

7. The optical cable co-routing determination method according to claim 6, characterized in that, The process involves determining the dynamic buffer overlap rate, optical cable route direction consistency, and dynamic buffer Hausdorff distance based on the laying segment information and first coordinate information of the optical cable candidate pair, and outputting the optical cable co-route determination result, including: Obtain the first coordinate information of the two optical cable routes in the optical cable candidate pair, and determine the dynamic buffer area and overlapping area of ​​the two optical cable routes in the optical cable candidate pair. The overlap rate is determined based on the area of ​​the overlapping region and the dynamic buffer area of ​​the two optical cable routes in the optical cable candidate pair; When the overlap rate is not less than a first threshold, the origin and destination coordinates of the two optical cable routes in the optical cable candidate pair are obtained, the directions of the two optical cable routes in the optical cable candidate pair are determined according to the origin and destination coordinates, and the direction consistency of the optical cable candidate pair is determined according to the directions. When the directional consistency is not greater than the second threshold, the location information of the two optical cable routes in the optical cable candidate pair is obtained, and the Hausdorff distance of the optical cable candidate pair is determined based on the location information of the optical cable candidate pair. When the Hausdorff distance of the candidate optical cable pair is not greater than the third threshold, the two optical cable routes in the candidate optical cable pair are determined to be the same route.

8. A device for determining the same route of optical cables, characterized in that, include: The acquisition module is used to acquire the buffer radius and laying segment information of the optical cable route, wherein the optical cable route includes at least two laying segments, and the laying segment information includes the endpoint coordinate information of the laying segment; The dynamic buffer generation module is used to generate a dynamic buffer of the optical cable route based on the buffer radius and laying section information of the optical cable route, and obtain the first coordinate information of the optical cable route, wherein the first coordinate information is the vertex coordinate information of the dynamic buffer of the optical cable route. The same route determination module is used to determine the overlap rate of the dynamic buffer, the consistency of the optical cable route direction, and the Hausdorff distance of the dynamic buffer based on the laying section information and the first coordinate information of any two optical cable routes, and output the same route determination result of the optical cable.

9. A readable computer storage medium, characterized in that, It stores computer programs, among which, When executed by a processor, the computer program implements the steps of the method described in any one of claims 1-7.

10. A computer program product, characterized in that, Includes a computer program / instructions that, when executed by a processor, implement the steps of the method described in any one of claims 1-7.

Images