Routing curve based method, system, and apparatus for charting a marine pipeline route

Abstract

The present application belongs to the field of marine pipeline structure design, and particularly relates to a marine pipeline routing map framing method, system and device based on routing curves, aiming to solve the problem that the existing image map framing excessively relies on manual experience and the framing position is prone to information inconsistency. The present application comprises: acquiring a to-be-framed routing map, setting a framing window according to a target map output ratio and map output size, segmenting the to-be-framed routing map through the framing window, determining the intersection of the routing curve and the framing window, and automatically selecting whether to generate a sub-window and automatically framing the image according to the number of intersections. The present application designs an automatic image framing method, which is suitable for marine pipeline routing map automatic generation and has the characteristics of simplicity, accuracy, rapidity, high efficiency and the like, and avoids the problem of inconsistent connection point information caused by manual intervention in framing, thereby improving the design efficiency.

Description

Technical Field

[0001] This invention belongs to the field of marine pipeline structure design, and specifically relates to a method, system and equipment for dividing marine pipeline routing maps based on routing curves. Background Technology

[0002] A marine pipeline route map is a comprehensive document, integrating project area information, engineering location index information, plan view information, water depth, seabed elevation, geological information, pipeline mileage and elevation, pipeline specifications, trenching method and depth, maximum allowable span length, lateral and longitudinal scale, elevation system, legend, and explanations into a single "three-in-one" map. Some of this data comes from basic documents, while others must be determined by the designers themselves.

[0003] Currently, the division of marine pipeline route maps is mainly done manually, which is a complex process that relies excessively on the design experience of designers, and errors such as inconsistencies in the division location are prone to occur. As for the computer-automated drawing technology available on the market, it cannot effectively divide the map when dealing with routes with large bends. Summary of the Invention

[0004] To address the aforementioned problems in existing technologies, namely, that current image map partitioning relies excessively on manual experience and is prone to inconsistencies in partitioning locations, this invention provides a method for partitioning marine pipeline routing maps based on routing curves, comprising:

[0005] Step S100: Obtain the routing map to be divided into sections;

[0006] Step S200: Set a segmentation window according to the target output scale and output size, and segment the routing map to be segmented through the segmentation window to obtain a segmented routing map.

[0007] In some preferred embodiments, the routing curve is a curve composed of straight line segments and circular arc segments, automatically generated based on the coordinates of the routing IP point and the radius of curvature.

[0008] In some preferred embodiments, step S200 includes:

[0009] Step S210: Based on the routing map to be divided, set the division window according to the target output ratio and output size;

[0010] Step S220: Define the four sides of the frame-splitting window: start side Es, end side Ee, left side El, and right side Er.

[0011] Step S230: Set the midpoint of the starting edge Es at the route starting point position as the starting point of the segmentation;

[0012] Step S240: Adjust the angle of the segmentation window. Specifically, if the routing curve at the starting point of the segmentation is a straight line, then make the starting edge Es perpendicular to the routing curve; if the routing curve at the starting point of the segmentation is an arc, then make the starting edge Es perpendicular to the tangent at that point.

[0013] Step S250: Search for the intersection points of the routing curve with the endpoint edge Ee, the left edge El, and the right edge Er, and obtain the number of intersection points between the segmented window and the routing curve and the edges where the intersection points are located;

[0014] Step S260: If the routing curve does not intersect with the left side El and the right side Er, but intersects with the destination side Ee, complete this round of segmentation to obtain the segmented map of the t-th initial segmented routing map.

[0015] Step S270: Set the intersection of the routing curve and the endpoint edge Ee as the starting point of the (t+1)th segmentation of the routing map to be segmented, and let t = t+1;

[0016] Step S280: Repeat steps S230-S270 to obtain all the segmented routing subgraphs until the routing graph to be segmented has no intersection with the endpoint edge Ee, the left edge El, and the right edge Er. Combine all the segmented routing subgraphs into a segmented routing graph.

[0017] In some preferred embodiments, step S260 further includes the case where the routing curve intersects with either the left edge El or the right edge Er at one point;

[0018] Step S261A: Set the intersection point that has only one intersection point and is not on the endpoint edge Ee as the first intersection point, and determine the coordinates of the first intersection point;

[0019] Step S262A: A first segmentation sub-window W1 is generated between the segmentation start point and the first intersection point. The starting edge Es1 of the first segmentation sub-window W1 coincides with the starting edge Es of the segmentation window W. The length LW1 of the first segmentation sub-window W1 is the distance from the segmentation start point to the first intersection point.

[0020] Step S263A: Set the second segmented sub-window W2, determine the starting edge Es2 of the second segmented sub-window with the first intersection point as the midpoint, and set the length LW2 of W2 to LW2 = LW - LW1, where LW is the length of the segmented window and LW1 is the length of the first segmented sub-window. Set the second segmented sub-window as the current segmented sub-window, and return to the method of step S240 to obtain the segmented routing graph.

[0021] In some preferred embodiments, step S260 further includes the case where the routing curve intersects with the left edge E1, the right edge Er, or the endpoint edge Ee at two points;

[0022] Step S261B: Set the intersection of the two routing curves with the left side El or the intersection of the routing curve with the right side Er as the second intersection and the third intersection.

[0023] Step S262B: Select the midpoint of the routing curve between the starting point of the segmentation and the second or third intersection point as the first marker point;

[0024] Step S263B: A third sub-window W3 is generated between the starting point of the sub-window and the first marker point. The starting edge Es3 of the third sub-window W3 coincides with the starting edge Es of the sub-window W and is perpendicular to the routing curve.

[0025] Step S264B: Set the fourth segmented sub-window W4. Determine the starting edge Es4 of the fourth segmented sub-window with the first marker point as the midpoint. Set the length LW4 of the fourth segmented sub-window W4 to LW4 = LW - LW3, where LW is the length of the segmented window and LW3 is the length of the third segmented sub-window. Take the fourth segmented sub-window W as the current segmented sub-window and return to the method in step S240 to obtain the segmented routing graph.

[0026] In some preferred embodiments, step S260 further includes the case where the routing curve intersects with the left edge E1, the right edge Er, or the endpoint edge Ee at more than two points;

[0027] In step S261C, based on the mileage sorting of the intersection points, sub-windows are generated sequentially from the intersection of the endpoint edge of the previous segmented sub-window and the routing curve, returning to the method in step S261A to obtain the segmented routing map.

[0028] In some preferred embodiments, after the segmentation of the sub-window is completed, the starting point of the new segmentation window is moved to the ending point of the segmentation sub-window, and the segmentation continues.

[0029] In some preferred embodiments, the step of setting the sheet division window according to the target drawing scale and drawing size is specifically as follows: let the drawing height be Hp, the drawing width be Wp, the plan drawing scale be Sd, the drawing scale be Sp, the sheet division window height be: HW = Hp * Sp / Sd, and the sheet division window length be LW = Wp * Sp / Sd.

[0030] In another aspect, the present invention proposes a routing curve marine pipeline routing map segmentation system, comprising: an image acquisition module, a preliminary segmentation module, and a segmentation validity verification module;

[0031] The image acquisition module is configured to acquire the routing map to be segmented;

[0032] The preliminary segmentation module is configured to set a segmentation window based on the target output scale and output size, and to segment the routing map to be segmented through the segmentation window to obtain a segmented routing map.

[0033] A third aspect of the present invention provides an electronic device comprising: at least one processor; and a memory communicatively connected to at least one of the processors; wherein the memory stores instructions executable by the processor for implementing the above-described method for dividing a marine pipeline route map.

[0034] In a fourth aspect, the present invention provides a computer-readable storage medium storing computer instructions for execution by the computer to implement the above-described method for dividing the routing curve of a marine pipeline route map.

[0035] The beneficial effects of this invention are:

[0036] (1) The marine pipeline route map tiling method based on route curve proposed in this invention designs an image tiling method that is automatically executed in electronic processing equipment, avoiding the problem of inconsistent connection point information caused by manual intervention in tiling, and improving design efficiency and map output reliability. Attached Figure Description

[0037] Other features, objects, and advantages of this application will become more apparent from the following detailed description of non-limiting embodiments with reference to the accompanying drawings:

[0038] Figure 1 This is a flowchart illustrating the method for dividing a marine pipeline route map based on a routing curve in an embodiment of the present invention.

[0039] Figure 2 This invention is a flowchart illustrating the process of setting a segmentation window based on the target output ratio and output size, and segmenting the routing map to be segmented through the segmentation window to obtain a segmented routing map.

[0040] Figure 3 This is a flowchart of the algorithm for pipe image framing in an embodiment of the present invention;

[0041] Figure 4 This is a schematic diagram of the automatic generation process of marine pipeline route map in an embodiment of the present invention, showing the division of the map window. Detailed Implementation

[0042] The present application will now be described in further detail with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are for illustrative purposes only and are not intended to limit the invention. Furthermore, it should be noted that, for ease of description, only the parts relevant to the invention are shown in the accompanying drawings.

[0043] It should be noted that, unless otherwise specified, the embodiments and features described in this application can be combined with each other. This application will now be described in detail with reference to the accompanying drawings and embodiments.

[0044] This invention provides a method for map tiling of marine pipeline routes based on routing curves. This method is an image tiling method that is automatically executed in electronic processing equipment, avoiding the problem of inconsistent connection point information caused by manual intervention in tiling, and improving design efficiency and map output reliability.

[0045] The method includes:

[0046] Step S100: Obtain the routing map to be divided into sections;

[0047] Step S200: Set a segmentation window according to the target output scale and output size, and segment the routing map to be segmented through the segmentation window to obtain a segmented routing map.

[0048] To more clearly explain the marine pipeline route map segmentation method based on route curves of this invention, the following will be combined with... Figure 1 The steps in the embodiments of the present invention will be described in detail below.

[0049] The first embodiment of the marine pipeline route map segmentation method based on route curves of the present invention includes:

[0050] Currently, digitalization and intelligentization are development trends, and design automation has become an inevitable requirement for digitalization and intelligentization. As one of the essential deliverables in marine pipeline engineering, the automatic map segmentation function of routing maps is extremely important, especially for marine pipeline routes with large bends, for which there is currently no mature method for automatic map segmentation. This invention mainly realizes the automatic map segmentation function of marine pipeline routing maps based on routing curves, map scale, IP coordinates of routing curves, and radius of curvature, thus promoting the development of digital design.

[0051] In this embodiment, the routing curve is a curve composed of straight line segments and arc segments generated based on the coordinates and radius of curvature of the routing IP point. For a known routing IP point, the routing IP point is a triple Pi(X,Y,R), where X and Y are the coordinates of Pi, and R is the radius of curvature of the point, R>=0; when R>0, the point is an elastic laying point of a circle with radius R; when R=0, the point Pi is the endpoint of a straight line segment; for routing IP points P0..Pn, n>=2.

[0052] The algorithm for generating the routing curve is as follows:

[0053] D1, which is invalid when n < 2; i serves as the traversal counter for the routing points.

[0054] D2, the high point Pi-1 = P0 is used as the previous point.

[0055] D2, when I < n - 1, read points Pi and Pi+1. Otherwise, exit.

[0056] D21, when the R of Pi is 0, a straight line segment is formed between Pi-1 and Pi, and jump to S2.

[0057] D22, when the R of Pi > 0, calculate the vectors v1 = (Pi-1, Pi) and v2 = (Pi, Pi+1); convert the reverse vectors v1 and v2 into unit vectors. Calculate the cross product of vectors v1 and v2, v3 = v1 X v2; unitize the vector v3. Calculate the included angle angle between vectors v1 and v2. Calculate the elastic laying data at point Pi

[0058] T = R / tan(angle). Calculate the tangent point Pt1 of the circle and the side (Pi-1, Pi), Pt1 = Pi - v1 * T; calculate the tangent point Pt2 of the circle and the side (Pi, Pi+1), Pt2 = Pi + v2 * T; rotate v2 by 90 degrees around v3 to obtain the vector v4, calculate the center of the circle, Pc = Pt2 + v4 * R; the calculated arc Arc starts at Pt1, ends at Pt2, and has the center Pc, which is the elastic laying curve of point Pi. The points Pi-1, Pi, and Pi+1 are divided into three parts, the line segment (Pi-1, Pt1), the arc Arc, and the line segment (Pt2, Pi+1). Set Pi-1 = Pt2 and jump to S2.

[0059] D23, connect all the line segments in sequence to form the routing curve.

[0060] Step S100, obtain the routing map to be sub-divided;

[0061] In the conventional independent design, the drawing of the image of the ocean pipeline usually includes: (1) sub-divide according to the overall curve characteristics of the routing to form multiple sheets that meet the design requirements; (2) preliminarily determine the longitudinal section axis of the pipeline according to the burial depth requirements of the ocean pipeline; (3) make local adjustments to the pipeline burial depth, optimize the design, and determine the longitudinal section axis of the pipeline; (4) supplement the pipeline information at the key points on the routing, including horizontal mileage and elevation information; (5) insert legends, explanations, corner stamps, etc. The sub-dividing of the ocean pipeline routing map sheets is mainly manually divided by humans. The dividing process is complex, and errors such as inconsistent information are likely to occur in the sub-dividing positions.

[0062] Step S200: Set a map segmentation window according to the target map output ratio and map output size, and segment the route map to be segmented through the map segmentation window to obtain a segmented route map;

[0063] In this embodiment, step S200 includes:

[0064] Step S210: Based on the routing map to be divided, set the division window according to the target output ratio and output size;

[0065] In this embodiment, the step of setting the sheet division window according to the target drawing scale and drawing size is as follows: set the drawing height Hp, the drawing width Wp, the plan drawing scale Sd, the drawing scale Sp, and the sheet division window height as: HW = Hp * Sp / Sd, and the sheet division window length as LW = Wp * Sp / Sd.

[0066] Step S220: Define the four sides of the frame-splitting window: start side Es, end side Ee, left side El, and right side Er.

[0067] Step S230: Set the route starting point as the segmentation starting point, and set the midpoint of the starting point edge Es as the segmentation starting point;

[0068] Step S240: Adjust the angle of the segmentation window. Specifically, if the routing curve at the starting point of the segmentation is a straight line, then make the starting edge Es perpendicular to the routing curve; if the routing curve at the starting point of the segmentation is an arc, then make the starting edge Es perpendicular to the tangent at that point.

[0069] In this embodiment, the routing curve is a curve composed of straight line segments and arc segments generated based on the coordinates of the routing IP point and the radius of curvature; the routing curve is a polyline describing the pipeline route.

[0070] Step S250: Search for the intersection points of the routing curve with the endpoint edge Ee, the left edge El, and the right edge Er, and obtain the number of intersection points between the segmented window and the routing curve and the edges where the intersection points are located;

[0071] Step S260: If the routing curve does not intersect with the left side El and the right side Er, but intersects with the destination side Ee, complete this round of segmentation to obtain the t-th segmented routing subgraph.

[0072] In this embodiment, step S260 further includes the case where the routing curve intersects with either the left edge El or the right edge Er at one point;

[0073] Step S261A: Set the intersection point that has only one intersection point and is not on the endpoint edge Ee as the first intersection point, and determine the coordinates of the first intersection point;

[0074] Step S262A: A first segmentation sub-window W1 is generated between the segmentation start point and the first intersection point. The starting edge Es1 of the first segmentation sub-window W1 coincides with the starting edge Es of the segmentation window W. The length LW1 of the first segmentation sub-window W1 is the distance from the segmentation start point to the first intersection point.

[0075] Step S263A: Set the second segmented sub-window W2, determine the starting edge Es2 of the second segmented sub-window with the first intersection point as the midpoint, and set the length LW2 of W2 to LW2 = LW - LW1, where LW is the length of the segmented window and LW1 is the length of the first segmented sub-window. Set the second segmented sub-window as the current segmented sub-window, and return to the method of step S240 to obtain the segmented routing graph.

[0076] In particular, when the intersection point is at one corner of the bottom edge of the frame window, it is considered as having only one intersection point with the end edge.

[0077] In this embodiment, step S260 further includes the case where the routing curve intersects with the left edge E1, the right edge Er, or the endpoint edge Ee at two points;

[0078] Step S261B: Set the intersection of the two routing curves with the left side El or the intersection of the routing curve with the right side Er as the second intersection and the third intersection.

[0079] Step S262B: Select the midpoint of the routing curve between the starting point of the segmentation and the second or third intersection point as the first marker point;

[0080] Step S263B: A third sub-window W3 is generated between the starting point of the sub-window and the first marker point. The starting edge Es3 of the third sub-window W3 coincides with the starting edge Es of the sub-window W and is perpendicular to the routing curve.

[0081] Step S264B: Set the fourth segmented sub-window W4. Determine the starting edge Es4 of the fourth segmented sub-window with the first marker point as the midpoint. Set the length LW4 of the fourth segmented sub-window W4 to LW4 = LW - LW3, where LW is the length of the segmented window and LW3 is the length of the third segmented sub-window. Take the fourth segmented sub-window W as the current segmented sub-window and return to the method in step S240 to obtain the segmented routing graph.

[0082] In this embodiment, step S260 further includes the case where the routing curve intersects with the left edge E1, the right edge Er, or the endpoint edge Ee at more than two points;

[0083] In step S261C, based on the mileage sorting of the intersection points, sub-windows are generated sequentially from the intersection of the endpoint edge of the previous segmented sub-window and the routing curve, returning to the method in step S261A to obtain the segmented routing map.

[0084] Step S270: Set the intersection of the routing curve and the endpoint edge Ee as the starting point of the (t+1)th segmentation of the routing map to be segmented, and let t = t+1;

[0085] In this embodiment, after the segmentation of the sub-window is completed, the starting point of the new segmentation window is moved to the ending point of the segmentation sub-window, and the segmentation continues.

[0086] Step S280: Repeat steps S210-S270 to obtain all the segmented routing subgraphs until the routing graph to be segmented has no intersection with the endpoint edge Ee, the left edge El, and the right edge Er. Combine all the segmented routing subgraphs into a segmented routing graph.

[0087] The algorithm flow for pipeline image framing in this embodiment is as follows: Figure 3 As shown, Figure 3 The algorithm flow shown fully demonstrates that this invention can be directly applied to electronic processing devices. After starting, the window size is determined first, then the route start point is set, the starting edge of the window is moved to the start point, and then the window direction is adjusted according to the current position curve direction. The relationship between the route curve and the window edge is calculated, and it is determined whether there is an intersection. If there is no intersection, the last segment is generated and the process ends. If there is no intersection, it is determined whether there is only an intersection with the end edge. If so, a segment is generated, the starting edge of the window is moved to the intersection, and a new window is set. Otherwise, there is one or more intersections with the side edge. The angle is adjusted to divide the sub-windows, the starting edge of the segment window is moved to the end edge of the last sub-window, and a new window is set.

[0088] In this embodiment, the sum of the lengths of the generated sub-windows Wi is less than or equal to the length of the segmented window W, and the height of the sub-windows is equal to the height of the segmented window.

[0089] The automatically generated marine pipeline routing map window of this invention is divided as follows: Figure 4 As shown, in Figure 4 In the first five windows from left to right, the routing curves only intersect with the starting edge Es and the ending edge Ee. The sixth window shows a situation where the right side of the window intersects with the routing curve at two points. P1 and P2 are the intersections of the initially set segmented windows, and Ww1 and Ww2 are segmented sub-windows. The large-angle routing curves are segmented by planning sub-windows through this invention.

[0090] Another embodiment of the present invention provides a routing curve marine pipeline routing map segmentation system, the system comprising an image acquisition module, a preliminary segmentation module, and a segmentation validity verification module;

[0091] The image acquisition module is configured to acquire the routing map to be segmented;

[0092] The preliminary segmentation module is configured to set a segmentation window based on the target output scale and output size, and to segment the routing map to be segmented through the segmentation window to obtain a segmented routing map.

[0093] This invention has been applied to multiple marine pipeline projects, successfully achieving automatic generation of routing maps. Compared with manual map division and drawing, it significantly improves efficiency, and to date, no inconsistencies have been found in the maps due to map division; the error rate for map generation is 0%. Dividing a 15-kilometer marine pipeline into 15 maps takes only 40 seconds.

[0094] An electronic device according to a third embodiment of the present invention includes: at least one processor; and a memory communicatively connected to at least one of the processors; wherein the memory stores instructions executable by the processor, the instructions being executed by the processor to implement the above-described method for dividing a routing curve for a marine pipeline route map.

[0095] A fourth embodiment of the present invention provides a computer-readable storage medium storing computer instructions, which are executed by the computer to implement the above-described method for dividing the routing curve of a marine pipeline routing map.

[0096] Those skilled in the art will understand that, for the sake of convenience and brevity, the specific working process and related descriptions of the storage device and processing device described above can be referred to the corresponding processes in the foregoing method embodiments, and will not be repeated here.

[0097] The terms “first”, “second”, etc., are used to distinguish similar objects, not to describe or indicate a specific order or sequence.

[0098] The term "comprising" or any other similar term is intended to cover non-exclusive inclusion, such that a process, method, article, or apparatus / device that comprises a list of elements includes not only those elements but also other elements not expressly listed, or elements inherent in such process, method, article, or apparatus / device.

[0099] The technical solution of the present invention has been described above with reference to the preferred embodiments shown in the accompanying drawings. However, it will be readily understood by those skilled in the art that the scope of protection of the present invention is obviously not limited to these specific embodiments. Without departing from the principles of the present invention, those skilled in the art can make equivalent changes or substitutions to the relevant technical features, and the technical solutions after these changes or substitutions will all fall within the scope of protection of the present invention.

Claims

1. A method for dividing a marine pipeline route map based on a routing curve, characterized in that, The method includes: Step S100: Obtain the route map to be divided into sections; Step S200: Set a map segmentation window according to the target map output ratio and map output size, and segment the route map to be segmented through the map segmentation window to obtain a segmented route map; Step S200 includes: Step S210: Based on the routing map to be divided, set the division window according to the target output ratio and output size; Step S220: Define the four sides of the frame-splitting window: start side Es, end side Ee, left side El, and right side Er. Step S230: Set the route starting point as the segmentation starting point, and set the midpoint of the starting point edge Es as the segmentation starting point; Step S240: Adjust the angle of the segmentation window. Specifically, if the routing curve at the starting edge Es is a straight line, then make the starting edge Es perpendicular to the routing curve; if the routing curve at the starting point of the segmentation is an arc, then make the starting edge Es perpendicular to the tangent at that point. Step S250: Search for the intersection points of the routing curve with the endpoint edge Ee, the left edge El, and the right edge Er, and obtain the number of intersection points between the segmented window and the routing curve and the edges where the intersection points are located; Step S260: If the routing curve does not intersect with the left side El and the right side Er, but intersects with the destination side Ee, complete this round of segmentation to obtain the t-th segmented routing subgraph. Step S270: Set the intersection of the routing curve and the endpoint edge Ee as the starting point of the (t+1)th segmentation of the routing map to be segmented, and let t=t+1; Step S280: Repeat steps S230-S270 to obtain all the segmented routing subgraphs until the routing graph to be segmented has no intersection with the endpoint edge Ee, the left edge El, and the right edge Er. Combine all the segmented routing subgraphs into a segmented routing graph.

2. The method for dividing a marine pipeline route map according to claim 1, characterized in that, The routing curve is a curve composed of straight line segments and arc segments, generated based on the coordinates of the routing IP point and the radius of curvature.

3. The method for dividing a marine pipeline route map according to claim 1, characterized in that, Step S260 also includes the routing curve and the left side. El or right side Er The case where there is one intersection point; Step S261A: The edge with only one intersection point and not at the endpoint. Ee The intersection point is set as the first intersection point, and the coordinates of the first intersection point are determined. Step S262A: Generate a first framing sub-window between the framing start point and the first intersection point. W1 First sub-window W1 starting edge Es1 With sectional window W starting edge Es Overlapping; among them, the first segmented sub-window W1 length LW1 The distance from the starting point of the segmentation to the first intersection point; Step S263A: Set the second frame sub-window W2 The starting edge of the second segmented sub-window is determined by using the first intersection point as the midpoint. Es2 , W2 length LW2 Set as LW2 = LW - LW1 ,in LW The length of the frame window, LW1 Set the length of the first segmented sub-window, set the second segmented sub-window as the current segmented sub-window, return to step S240, and then obtain the segmented routing map.

4. The method for dividing a marine pipeline route map according to claim 1, characterized in that, Step S260 also includes the routing curve and the left side. El right side Er or the end point Ee The case where there are two intersection points; Step S261B: Connect the two routing curves with the left side. El The intersection or routing curve with the right side Er The intersection points are set as the second and third intersection points; Step S262B: Select the midpoint of the routing curve between the starting point of the segmentation and the second or third intersection point as the first marker point; Step S263B: Generate a third sub-window for framing between the framing start point and the first marker point. W3 Third sub-window W3 starting edge Es3 With sectional window W starting edge Es Coincident and perpendicular to the routing curve; Step S264B: Set the fourth frame sub-window W4 The starting edge of the fourth sub-window is determined by using the first marker point as the midpoint. Es4 Fourth sub-window W4 length LW4 Set as LW4 = LW - LW3 ,in LW The length of the frame window, LW3 The length of the third sub-window is used to define the fourth sub-window. W As the current segmented sub-window, return to the method in step S240 to obtain the segmented routing map.

5. The method for dividing a marine pipeline route map according to claim 4, characterized in that, Step S260 also includes the routing curve and the left side. El right side Er or the end point Ee The case where there are more than two intersection points; In step S261C, based on the mileage sorting of the intersection points, sub-windows are generated sequentially from the intersection points of the endpoint edge of the previous segmented sub-window and the routing curve, returning to the method of step S261 to obtain the segmented routing map.

6. The method for dividing a marine pipeline route map according to any one of claims 3-5, characterized in that, After the segmentation of the sub-window is completed, the starting point of the new segmentation window is moved to the ending point of the segmentation sub-window, and the segmentation continues.

7. The method for dividing a marine pipeline route map according to claim 1, characterized in that, The step of setting a sheet division window based on the target drawing scale and drawing size specifically involves setting the drawing height. Hp drawing width Wp Plan scale Sd Output scale Sp The height of the frame segment window is: HW= Hp Sp / Sd Frame window length LW = Wp Sp / Sd .

8. A routing curve marine pipeline routing map segmentation system, the system comprising an image acquisition module, a preliminary segmentation module, and a segmentation validity verification module; The image acquisition module is configured to acquire the routing map to be segmented; The preliminary segmentation module is configured to set a segmentation window according to the target output ratio and output size, and to segment the routing map to be segmented through the segmentation window to obtain a segmented routing map; The preliminary segmentation module is further configured as follows: Based on the routing map to be divided, set the division window according to the target output ratio and output size; Define the four sides of the frame window: the start side Es, the end side Ee, the left side El, and the right side Er; Set the route start point as the segmentation start point, and set the midpoint of the start point edge Es as the segmentation start point; Adjust the angle of the segmentation window. Specifically, if the routing curve at the starting edge Es is a straight line, then make the starting edge Es perpendicular to the routing curve; if the routing curve at the starting point of the segmentation is an arc, then make the starting edge Es perpendicular to the tangent at that point. Search for the intersections of the routing curve with the endpoint edge Ee, the left edge El, and the right edge Er, and obtain the number of intersections between the segmented window and the routing curve and the edges where the intersections are located; If the routing curve does not intersect with the left side El and the right side Er, but does intersect with the destination side Ee, then complete this round of segmentation to obtain the t-th segmented routing subgraph. Set the intersection of the routing curve and the endpoint edge Ee as the starting point of the (t+1)th segmentation of the routing map to be segmented, and let t=t+1; Repeat the above process to obtain all the segmented routing subgraphs until the routing graph to be segmented has no intersection with the destination edge Ee, the left edge El, and the right edge Er. Combine all the segmented routing subgraphs into a segmented routing graph.

9. An electronic device, comprising: At least one processor; And a memory communicatively connected to at least one of the processors; wherein the memory stores instructions executable by the processor to implement the routing curve marine pipeline routing map segmentation method according to any one of claims 1-7.

Images