Pipeline edge connecting method, equipment, medium and product

Abstract

The invention discloses a pipeline edge connecting method and device, a medium and a product, and relates to the field of computer aided design, and the pipeline edge connecting method comprises the steps that a to-be-analyzed pipeline data set is acquired, and an adjacent pipeline record table is generated based on pipeline information of each pipeline in the pipeline data set, the adjacent pipeline record table comprises a plurality of groups of adjacent pipeline pairs, each group of adjacent pipeline pairs comprises two pipelines with an adjacent relationship, performing feature consistency check on the adjacent pipeline pairs based on the pipeline information, and performing edge connection processing on the two pipelines in the adjacent pipeline pairs passing the feature consistency check, by means of the method, possible fractures or missing parts in pipeline data can be made up, and the connection relation between adjacent pipelines is more complete and continuous. The adjacent pipelines can be automatically recognized and connected, the pipeline data processing efficiency is improved, the data processing period is greatly shortened, and the requirement for large-scale pipeline data management can be met.

Description

Technical Field

[0001] This application relates to the field of computer-aided design technology, and in particular to a pipeline splicing method, device, medium, and product. Background Technology

[0002] In the survey of urban underground drainage pipelines, given the vast coverage area and complex road network, the overall survey area is typically scientifically divided into several survey zones to improve operational efficiency and data management quality. Each zone is then assigned to a specialized team to complete the on-site surveying tasks. During the data integration phase, a rigorous edge-joining process must be implemented to address the connection of pipeline data at the boundaries of different survey zones and the integration of new pipelines with existing networks. This ensures the spatial continuity and integrity of the drainage pipelines and avoids analytical errors or management blind spots caused by data gaps.

[0003] Traditional methods typically involve manual review of drawings for pipework connection. However, this approach is time-consuming and labor-intensive, and relies heavily on the expertise of the personnel handling the work, resulting in low efficiency in pipework connection. Summary of the Invention

[0004] This application provides a pipeline splicing method, equipment, medium, and product to solve the technical problem of low pipeline splicing efficiency in the prior art.

[0005] To achieve the above objectives, this application proposes a pipeline splicing method, the method comprising:

[0006] Obtain the pipeline dataset to be analyzed, and generate an adjacent pipeline record table based on the pipeline information of each pipeline in the pipeline dataset. The adjacent pipeline record table includes multiple pairs of adjacent pipelines, and each pair of adjacent pipelines includes two pipelines that are adjacent to each other.

[0007] Based on the pipeline information, a feature consistency check is performed on the adjacent pipeline pairs, and the two pipelines in the adjacent pipeline pairs that pass the feature consistency check are then joined together. ...

[0008] In addition, to achieve the above objectives, this application also proposes a terminal device, the device comprising: a memory, a processor, and a computer program stored in the memory and executable on the processor, the computer program being configured to implement the steps of the pipeline splicing method described above.

[0009] In addition, to achieve the above objectives, this application also proposes a storage medium, which is a computer-readable storage medium, on which a computer program is stored, and when the computer program is executed by a processor, it implements the steps of the pipeline splicing method described above.

[0010] In addition, to achieve the above objectives, this application also provides a computer program product, which includes a computer program that, when executed by a processor, implements the steps of the pipeline splicing method described above.

[0011] One or more technical solutions proposed in this application have at least the following technical effects:

[0012] By acquiring the pipeline dataset to be analyzed and generating an adjacent pipeline record table based on the pipeline information of each pipeline in the dataset, the adjacent pipeline record table includes multiple pairs of adjacent pipelines. Each pair consists of two pipelines that are adjacent to each other. By organizing the originally disorganized pipeline data according to their adjacency relationships, the storage and management of pipeline data becomes clearer and more systematic, facilitating subsequent querying, retrieval, and updating operations, thus greatly improving data management efficiency. Then, based on the pipeline information, a feature consistency check is performed on the adjacent pipeline pairs to improve the reliability of the pipeline data. For adjacent pipeline pairs that pass the feature consistency check, edge joining processing is performed on the two pipelines to compensate for any breaks or missing parts in the pipeline data, making the connection between adjacent pipelines more complete and continuous. In summary, this embodiment, by generating an adjacent pipeline record table, performing feature consistency checks, and edge joining processing using a computer, can quickly process large amounts of pipeline data, improve the efficiency of pipeline data processing, significantly shorten the data processing cycle, and meet the needs of large-scale pipeline data management. Attached Figure Description

[0013] The accompanying drawings, which are incorporated in and form part of this specification, illustrate embodiments consistent with this application and, together with the description, serve to explain the principles of this application.

[0014] To more clearly illustrate the technical solutions in the embodiments of this application or the prior art, the drawings used in the description of the embodiments or the prior art will be briefly introduced below. Obviously, for those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0015] Figure 1 A schematic flowchart of an embodiment of the pipeline splicing method of this application is provided;

[0016] Figure 2 This is a schematic diagram illustrating the spatial distribution characteristics of adjacent pipelines in one scenario, as provided in this embodiment.

[0017] Figure 3 This is a schematic diagram illustrating the spatial distribution characteristics of adjacent pipelines in another scenario, as provided in this embodiment.

[0018] Figure 4This is a schematic diagram illustrating an anomaly in the flow direction relationship between pipelines provided in this embodiment;

[0019] Figure 5 This is a schematic diagram of the first adjacent pipeline connection method provided in this embodiment;

[0020] Figure 6 This is a schematic diagram of the second adjacent pipeline connection method provided in this embodiment;

[0021] Figure 7 This is a schematic diagram of the third adjacent pipeline connection method provided in this embodiment;

[0022] Figure 8 This is a schematic diagram of the equipment structure of the hardware operating environment involved in the pipeline connection method in this application embodiment.

[0023] The purpose, features, and advantages of this application will be further explained in conjunction with the embodiments and with reference to the accompanying drawings. Detailed Implementation

[0024] It should be understood that the specific embodiments described herein are merely illustrative of the technical solutions of this application and are not intended to limit this application.

[0025] To better understand the technical solution of this application, a detailed description will be provided below in conjunction with the accompanying drawings and specific implementation methods.

[0026] In urban underground drainage pipeline surveys, due to the large survey area and numerous roads, it is usually necessary to divide the work into different survey areas, each completed by a different work group. When data is entered into the database, the boundaries of adjacent survey areas need to be joined to ensure the connectivity and spatial integrity of the drainage pipelines. On the other hand, when re-surveying the original pipelines, the new survey data needs to be merged with the existing drainage pipeline data before being entered into the database. Traditionally, this is done through manual review of drawings; however, this method is time-consuming, labor-intensive, and highly dependent on the expertise of the personnel handling the data, resulting in low efficiency in pipeline joining.

[0027] To address the aforementioned problems, this application provides a pipeline connection method. This method relates to emerging software and new information technology services. The executing entity in this embodiment can be a terminal device with data processing, network communication, and program execution functions, such as a tablet computer, personal computer, or server. The following description uses a terminal device as an example to illustrate this embodiment and the subsequent embodiments.

[0028] Please see Figure 1 , Figure 1 This is a schematic flowchart of an embodiment of the pipeline splicing method of this application.

[0029] In this embodiment, the pipeline splicing method includes steps S10 to S20:

[0030] Step S10: Obtain the pipeline dataset to be analyzed, and generate an adjacent pipeline record table based on the pipeline information of each pipeline in the pipeline dataset. The adjacent pipeline record table includes multiple pairs of adjacent pipelines, and each pair of adjacent pipelines includes two pipelines that are adjacent to each other.

[0031] It should be noted that in pipeline surveying, the overall survey area is usually divided into several sub-survey areas for mapping. In this case, it is necessary to connect the pipelines at the boundaries of different survey areas. The pipeline dataset to be analyzed in this situation includes pipeline data from each of the adjacent survey areas that falls within a preset boundary range. The preset boundary range is set according to the actual situation. Furthermore, if new pipelines are discovered after surveying a survey area, it is also necessary to connect these new pipelines with the existing pipelines within the survey area. In this case, the pipeline dataset to be analyzed includes both the new pipelines and the existing pipelines. Therefore, in this embodiment, the pipeline dataset to be analyzed includes both newly added pipeline data and existing pipeline data, or it includes pipeline data from each of the adjacent survey areas that falls within a preset boundary range, or it simultaneously includes pipeline data from each of the adjacent survey areas that falls within a preset boundary range and both newly added and existing pipeline data within any survey area.

[0032] Terminal devices can filter pipeline data that meet preset conditions from the Geographic Information System (GIS) database and import newly added pipeline data obtained from surveying and mapping fieldwork to form a pipeline dataset to be analyzed.

[0033] In some embodiments, after acquiring the pipeline dataset, the terminal device can determine the positional relationship between pipelines based on the pipeline information of each pipeline, form adjacent pipeline pairs by combining two pipelines that are determined to be adjacent, generate identification information for each pair of adjacent pipelines, and write this identification information into the adjacent record table so that the adjacent pipeline pairs can be connected according to the contents of the adjacent record table in the future.

[0034] In some embodiments, pipeline information includes, but is not limited to, pipeline identifier, start point identifier, start point location, end point identifier, and end point location, wherein the start point location can be set as the upstream point of the pipeline and the end point location can be set as the downstream point of the pipeline.

[0035] In some embodiments, the terminal device can calculate the distance between two pipelines based on their respective start and end positions, and determine whether the distance is greater than a preset lower tolerance limit and less than a preset upper tolerance limit. If so, the two pipelines are determined to be adjacent; otherwise, they are determined not to be adjacent. The preset lower tolerance limit and the preset upper tolerance limit can be set according to actual conditions. For example, the preset lower tolerance limit can be set to 0, and the preset upper tolerance limit can be set to 2 meters.

[0036] Step S20: Based on pipeline information, perform feature consistency checks on adjacent pipeline pairs, and perform edge connection processing on the two pipelines in the adjacent pipeline pairs that pass the feature consistency check.

[0037] It should be noted that the feature consistency check is a verification of the consistency and / or reasonableness of the performance results of two pipelines on preset features.

[0038] In some embodiments, pipeline information includes pipeline type, pipeline attributes, and pipeline elevation. The terminal device can check whether the pipeline types and attributes of two related pipelines in adjacent pipeline pairs are consistent, and whether the difference in pipeline elevation is less than or equal to a preset difference threshold. If so, the adjacent pipeline pair is determined to have passed the feature consistency check; otherwise, it is determined that the adjacent pipeline pair has failed the feature consistency check. For adjacent pipeline pairs that pass the feature consistency check, the terminal device needs to connect the two pipelines in the adjacent pipeline pair to make the two adjacent pipelines spatially connected. For two pipelines that fail the feature consistency check, no processing is performed.

[0039] This embodiment acquires the pipeline dataset to be analyzed and generates an adjacent pipeline record table based on the pipeline information of each pipeline in the dataset. The adjacent pipeline record table includes multiple pairs of adjacent pipelines, each pair consisting of two pipelines that are adjacent to each other. By organizing the originally disorganized pipeline data according to their adjacency relationships, the storage and management of pipeline data becomes clearer, facilitating subsequent querying, retrieval, and updating operations, thus significantly improving data management efficiency. Then, based on the pipeline information, a feature consistency check is performed on the adjacent pipeline pairs to improve the reliability of the pipeline data. For adjacent pipeline pairs that pass the feature consistency check, edge joining processing is performed on the two pipelines to compensate for any breaks or missing parts in the pipeline data, making the connection relationship between adjacent pipelines more complete and continuous. In summary, this embodiment, through automated generation of the adjacent pipeline record table, feature consistency checks, and edge joining processing, can quickly process large amounts of pipeline data, improving the efficiency of pipeline data processing, significantly shortening the data processing cycle, and meeting the needs of large-scale pipeline data management.

[0040] In this embodiment, the implementation scheme for step S10 above, which generates an adjacent pipeline record table based on the pipeline information of each pipeline in the pipeline dataset, may include:

[0041] In one feasible implementation, step S10 may include steps S101 to S102:

[0042] S101, calculate the distance between any two pipelines based on the starting and ending positions of each pipeline.

[0043] In pipeline data processing and analysis scenarios, considering the diverse spatial distribution of each pipeline relative to its adjacent pipelines, which may originate from various directions, distance determination requires a comprehensive consideration of distance calculation methods under all possible scenarios. Furthermore, the rules for determining pipeline adjacency based on distance must be flexibly adjusted for different situations.

[0044] Therefore, the above S101 may include: calculating the distance between the end point of the first pipeline and the start point of the second pipeline, and using it as the first distance between the first pipeline and the second pipeline; calculating the distance between the start point of the first pipeline and the start point of the second pipeline to obtain a first result value; and calculating the distance between the end point of the first pipeline and the end point of the second pipeline to obtain a second result value, and selecting the result value with the smallest value from the first result value and the second result value as the second distance between the first pipeline and the second pipeline.

[0045] It should be noted that the adjacency relationship between pipelines covers two scenarios. Please refer to [link / reference]. Figure 2 , Figure 2 A schematic diagram illustrating the spatial distribution characteristics of adjacent pipelines in one scenario is shown, such as... Figure 2 As shown, in the first case, the endpoint a of pipeline A and the starting point b of pipeline B are relatively close. In this situation, the distance between pipeline A and pipeline B calculated using the positions of endpoint a and starting point b can more effectively measure the proximity between pipeline A and pipeline B. Figure 3 As shown, Figure 3This diagram illustrates the spatial distribution characteristics of adjacent pipelines in another scenario, where the two pipelines are approximately parallel. In this case, if the traditional method of calculating the distance between pipelines A and B based on the endpoint of pipeline A and the starting point of pipeline B, and then using this distance to measure their proximity, is used, the judgment of their adjacency is prone to error and cannot accurately reflect the actual situation. Therefore, for this type of situation, measuring the proximity of pipeline B using the distance between the endpoints of pipeline A and B and / or the distance between the starting points of pipeline B and B, more accurately reflects the actual spatial relationship characteristics.

[0046] The starting and ending points of the pipelines can be characterized by longitude and latitude. Existing formulas for calculating longitude and latitude distances can be used to calculate the distances between the starting and ending points of the first and second pipelines.

[0047] S102, when the distance is less than the preset adjacent fault tolerance limit, determine that there is an adjacent relationship between the two pipelines, and record the two pipelines as an adjacent pipeline pair in the adjacent relationship record table.

[0048] Specifically, if the first distance is less than a preset first adjacent fault tolerance threshold, then it is determined that there is an adjacent relationship between the first pipeline and the second pipeline; or, if the second distance is less than a preset second adjacent fault tolerance threshold, then it is determined that there is an adjacent relationship between the first pipeline and the second pipeline. It should be noted that the preset first adjacent fault tolerance threshold and the preset second adjacent fault tolerance threshold can be the same or different, and this application does not limit this.

[0049] By taking into account the diversity of the relative positions of each pipeline with its adjacent pipelines in spatial distribution, adopting different distance calculation methods to measure the distance between the first pipeline and the second pipeline, and adaptively adjusting the rules for pipeline adjacency, the adjacency relationship between pipelines can be determined more accurately.

[0050] In another feasible implementation, step S10 may include S101' to S102':

[0051] S101' For each pipeline, a circular buffer area is constructed with the center point of the pipeline as the center and a preset radius value, and other pipelines with at least a preset number of points within the buffer area are regarded as the neighboring pipelines of the pipeline.

[0052] The preset quantity is greater than or equal to 1. The location of the pipeline center point can be represented by (a, b), where a is the longitude of the pipeline center point and b is the latitude of the pipeline center point. The longitude of the pipeline center point a = (longitude of the pipeline starting point + longitude of the pipeline ending point) / 2, and the latitude of the pipeline center point b = (latitude of the pipeline starting point + latitude of the pipeline ending point) / 2.

[0053] S102' Calculate the distance between the end point of the pipeline and the starting point of the selected neighboring pipelines, and calculate the distance between the starting point of the pipeline and the end point of the selected neighboring pipelines, and select the distance with the smallest calculated distance value as the first distance; and calculate the distance between the end point of the pipeline and the end point of the neighboring pipelines, and the distance between the end point of the pipeline and the starting point of the neighboring pipelines, and select the distance with the smallest calculated distance value as the second distance between the pipeline and the neighboring pipelines. If the first distance / the second distance is less than the preset adjacent fault tolerance upper limit value, then the pipeline and its neighboring pipelines are formed into an adjacent pipeline pair.

[0054] For example, if the buffer zone of pipeline A intersects with both pipeline B and pipeline C (i.e., some points of both pipeline B and pipeline C fall within the buffer zone of pipeline A), and the first distance between pipeline A and pipeline B and the first distance between pipeline A and pipeline C are both less than the preset adjacent fault tolerance upper limit, then adjacent pipeline pairs (A,B) and adjacent (A,C) are generated.

[0055] In this implementation, a circular buffer zone with a preset radius is generated based on the center point of a single pipeline. This buffer zone serves as the reference range for spatial filtering, effectively covering areas around the pipeline where there may be adjacent relationships. Simultaneously, considering the differences in diameter parameters among different pipelines, the filtered adjacent pipelines undergo secondary verification to ensure that their spatial distance from the target pipeline meets the requirements, thus achieving refined identification and characteristic adjustment of pipeline spatial proximity relationships.

[0056] Considering that different adjacent pipeline pairs may have different situations and different connection methods, this embodiment distinguishes adjacent pipeline pairs with different spatial distribution characteristics. Therefore, in a feasible implementation, the above step S102 or 102' may further include: if it is determined that there is an adjacent relationship between the first pipeline and the second pipeline based on the first distance, the first pipeline and the second pipeline are formed into a first type of adjacent relationship pair; if it is determined that there is an adjacent relationship between the first pipeline and the second pipeline based on the second distance, the first pipeline and the second pipeline are formed into a second type of adjacent relationship pair.

[0057] In this embodiment, a first pipeline and a second pipeline that satisfy the first distance being less than a preset first adjacent fault tolerance upper limit are classified as a first type of adjacent relationship pair, that is, adjacent pipeline pairs whose endpoints are relatively close to the starting points of the second pipeline are classified as first type of adjacent relationship pairs. A first pipeline and a second pipeline that satisfy the second distance being less than a preset second adjacent fault tolerance upper limit are classified as a second type of adjacent relationship pair, that is, adjacent pipeline pairs that may exhibit an approximately parallel spatial relationship are classified as second type of adjacent relationship pairs.

[0058] By taking into account the diversity of the relative positions of each pipeline with its adjacent pipelines in spatial distribution, adopting different distance calculation methods to measure the distance between the first pipeline and the second pipeline, and adaptively adjusting the rules for pipeline adjacency, the adjacency relationship between pipelines can be determined more accurately.

[0059] Furthermore, in one feasible implementation, the pipeline information includes pipeline type, attributes, pipeline elevation, starting burial depth, and ending burial depth. In step S20 above, performing a consistency check operation for each first-type adjacent relationship pair may include A3 to A5:

[0060] A3. Based on the pipeline elevation of the first pipeline and the pipeline elevation of the second pipeline, calculate the elevation difference between the first pipeline and the second pipeline.

[0061] Specifically, the terminal equipment can calculate the absolute value of the difference between the pipeline elevation of the first pipeline and the pipeline elevation of the second pipeline to obtain the elevation difference value.

[0062] A4. Perform a feature consistency check operation for each first-type adjacent relationship pair: determine whether the flow direction relationship between the first pipeline and the second pipeline is correct based on the pipeline elevation of the first pipeline and the pipeline elevation of the second pipeline; if the pipeline types of the first pipeline and the second pipeline in the first-type adjacent relationship pair are consistent, the attributes are consistent, the elevation difference between the first pipeline and the second pipeline does not exceed the preset difference threshold, and the flow direction relationship between the first pipeline and the second pipeline is correct, then determine that the first-type adjacent pipeline pair passes the feature consistency check.

[0063] Specifically, pipeline types include rainwater and sewage. Pipeline attributes refer to the diameter parameters of the corresponding drainage pipeline.

[0064] Specifically, based on the starting and ending burial depths of the first pipeline, and the starting and ending burial depths of the second pipeline, it is determined whether the flow direction relationship between the first and second pipelines satisfies a preset flow direction characteristic constraint. If so, the flow direction relationship between the first and second pipelines is determined to be correct; otherwise, the flow direction relationship between the first and second pipelines is abnormal. Specifically, the preset flow direction characteristic constraint is that the burial depth values ​​of the pipe points (including the starting and ending points) between the first and second pipelines show a gradually decreasing trend. For example, if the starting burial depth of the first pipeline is 2.0m and the ending burial depth is 1.5m, while the starting burial depth of the second pipeline is 1.5m and the ending burial depth is 1.0m, then the first and second pipelines satisfy the trend of gradually decreasing burial depth values.

[0065] Please see Figure 4 , Figure 4 A schematic diagram illustrating an anomaly in the flow direction relationship between pipelines is shown. For example... Figure 4 As shown, the burial depth of the end point of pipeline A is greater than the burial depth of the starting point of pipeline B, and the burial depth of the starting point of pipeline B is greater than the burial depth of the end point of pipeline B. Therefore, it can be determined that the burial depth values ​​of pipelines A and B do not meet the trend of gradually decreasing, thus indicating that the flow direction relationship between pipelines A and B is abnormal.

[0066] A5. Perform a feature consistency check operation for each second type of adjacent relationship pair: If the first pipeline and the second pipeline in the second type of adjacent relationship pair have the same pipeline type and the same attributes, and the elevation difference value does not exceed the preset difference threshold, then the second type of adjacent pipeline pair is determined to pass the feature consistency check.

[0067] Understandably, since the first and second pipelines in the second type of adjacent relationship pair are approximately parallel in space, there is no need to make an abnormal judgment on their flow direction relationship.

[0068] In the above implementation scheme, by classifying adjacent pipeline pairs and performing feature consistency checks on adjacent pipeline pairs according to different classifications, the consistency checks on the features of adjacent pipeline pairs can be performed in combination with different scenarios, which improves the accuracy and reliability of pipeline consistency verification and provides a solid data foundation for subsequent analysis and application.

[0069] In one feasible implementation, S20 above involves performing a jointing process on the two pipelines in an adjacent pipeline pair that has passed the feature consistency check, including S206 to S208:

[0070] S206, identify the upstream and downstream pipelines in each group of first-class adjacent pairs that pass the feature consistency check.

[0071] Specifically, if the first pipeline is an upstream pipeline, then the second pipeline is a downstream pipeline; if the second pipeline is a downstream pipeline, then the first pipeline is an upstream pipeline.

[0072] For the first type of adjacent relationship pairs that pass the feature consistency check, the adjacent relationship pairs satisfy the condition that the burial depth values ​​of the pipe points gradually decrease. Therefore, the terminal equipment can determine the upstream pipeline and the downstream pipeline based on the starting and ending burial depths of the two pipelines in the first type of adjacent relationship pair. For example, if the ending burial depth of the first pipeline is greater than the starting burial depth of the second pipeline, then the first pipeline is determined to be the upstream pipeline and the second pipeline to be the downstream pipeline; if the ending burial depth of the first pipeline is less than the starting burial depth of the second pipeline, then the second pipeline is determined to be the upstream pipeline and the first pipeline to be the downstream pipeline.

[0073] S207. For each pair of first-class adjacent relationships that passes the feature consistency check, determine whether there is a break in the upstream pipeline in the pair of first-class adjacent relationships, obtain the break analysis result, and connect the upstream pipeline and downstream pipeline in the pair of first-class adjacent relationships according to the pipeline connection method that matches the first distance and the break analysis result.

[0074] In some embodiments, the terminal device can determine whether there is a break in the first pipeline to be connected by the following step B1, and obtain the break analysis result:

[0075] Step B1: Determine whether the point facility associated with the end point of the upstream pipeline is a drainage outlet; if the point facility associated with the end point of the upstream pipeline is a drainage outlet, then it is determined that there is a break in the upstream pipeline; otherwise, it is determined that there is no break in the upstream pipeline.

[0076] In some embodiments, pipeline information includes point facilities associated with the endpoint of the pipeline. Thus, the terminal device can determine whether the point facility associated with the endpoint of the upstream pipeline to be connected is a drain outlet or whether it is connected to other pipelines. If the point facility associated with the endpoint of the upstream pipeline is a drain outlet and is not connected to other pipelines, it is determined that there is a break in the upstream pipeline. If the point facility associated with the endpoint of the upstream pipeline is not a drain outlet or is connected to other pipelines, it is determined that there is no break in the upstream pipeline.

[0077] In some embodiments, the terminal device can connect the upstream and downstream pipelines in the first type of adjacent relationship pair through the following steps B3-B4:

[0078] Step B3: If there is a break in the upstream pipeline in the first type of adjacent relationship pair and the first distance is less than the preset first offset threshold, then modify the starting position of the downstream pipeline in the first type of adjacent relationship pair to the ending position of the upstream pipeline to connect the upstream pipeline and the downstream pipeline.

[0079] like Figure 5 As shown, there exist pipelines A and B that form a first type of adjacent relationship pair, where pipeline A is the upstream pipeline and pipeline B is the downstream pipeline. The point facility associated with the end point a of the upstream pipeline A is a drainage outlet. At this time, it is determined that the upstream pipeline A has a break. At the same time, the first distance between pipeline A and pipeline B is less than the preset first offset threshold. Then, the starting point b of the downstream pipeline B is modified to the ending point a of the upstream pipeline A, and the point facility associated with the starting point b of the downstream pipeline B is deleted.

[0080] Step B4: If there is a break in the upstream pipeline in the first type of adjacent relationship pair and the first distance is greater than or equal to the preset first offset threshold, then a third pipeline is added between the upstream pipeline and the downstream pipeline in the first type of adjacent relationship pair. The starting position of the third pipeline is set as the ending position of the upstream pipeline, and the ending position of the third pipeline is set as the starting position of the downstream pipeline.

[0081] like Figure 6 As shown, there exist pipelines A and B that form a first type of adjacent relationship pair. Pipeline A is the upstream pipeline, and pipeline B is the downstream pipeline. The upstream pipeline A has a break. At the same time, the first distance between pipeline A and pipeline B is greater than or equal to a preset first offset threshold. Then, a third pipeline C is added between pipeline A and pipeline B. The starting position of the third pipeline C is set to the ending position a of the upstream pipeline A, and the ending position of the third pipeline C is set to the starting position a of the downstream pipeline B.

[0082] S208, for each pair of second-class adjacent relationships that pass the feature consistency check, connect the first pipeline and the second pipeline in the pair of second-class adjacent relationships according to the pipeline connection method that matches the second distance.

[0083] In some embodiments, S208 may include: if the second distance is less than a preset first offset threshold, then merging the first pipeline and the second pipeline in the second type of adjacent relationship pair. The preset first offset threshold is less than a preset first adjacent fault tolerance upper limit, and the preset first offset threshold is less than a preset second adjacent fault tolerance upper limit.

[0084] Understandably, the first and second pipelines in the second type of adjacent pipeline pair are approximately parallel in space. When the distance between the first and second pipelines is less than the preset first offset threshold, it is considered that the data of the first / second pipeline collected by the staff during field surveying has deviated, and the two are actually the same pipeline. At this time, the first / second pipeline is deleted to merge the first and second pipelines.

[0085] Specifically, the pipeline information also includes a pipeline source identifier, which determines whether the pipeline is a newly added pipeline or an existing pipeline in the database. When merging the first and second pipelines in a second type of adjacency pair, if the pipeline source identifier determines that the first pipeline is a newly added pipeline, then the first pipeline is deleted; if the pipeline source identifier determines that the second pipeline is a newly added pipeline, then the second pipeline is deleted.

[0086] like Figure 7 As shown, there exist pipelines A and B that form a second type of adjacent relationship pair. If pipeline A and pipeline B pass the feature consistency check and the distance between pipeline A and pipeline B is less than the first preset offset threshold, then pipeline A or pipeline B will be deleted. At the same time, the point settings associated with the starting point a1 of pipeline A and the point settings associated with the starting point b1 of pipeline B will be merged, and the point settings associated with the ending point a2 of pipeline A and the point settings associated with the ending point b2 of pipeline B will be merged.

[0087] The above implementation plan fully considers the differences in spatial distribution characteristics of different adjacent pipeline pairs, and adopts adaptive connection relationships for various types of adjacent pipeline pairs to achieve connection operations, which can effectively connect adjacent pipelines and ensure the spatial continuity and integrity of drainage pipelines.

[0088] Considering that pipelines are spatially close, but their directions differ significantly, they may not actually be parallel. Therefore, in another implementation, S208 may include: if the second distance is less than a preset second adjacent fault tolerance threshold, extracting a first direction vector based on the starting position a1 and ending position a2 of the first pipeline, and extracting a second direction vector based on the starting position b1 and ending position b2 of the second pipeline, and assigning the starting point position of the second direction vector to the starting point position of the first direction vector to move the position of the first direction vector so that the starting points of the first and second direction vectors coincide, and then calculating the angle between the first and second direction vectors after the position movement. If the angle is less than a preset angle threshold, it is determined that the first and second pipelines meet a preset parallel condition, and the first and second pipelines are merged.

[0089] Compared to schemes that rely solely on distance to determine the adjacency of pipelines, this scheme further incorporates vector analysis of the angles between pipelines to more accurately identify their spatial relationship. Understandably, even if two pipelines are spatially close, they may not be truly adjacent if their directions differ significantly. This scheme effectively eliminates this possibility by calculating the angles, thus determining the parallelism between pipelines more accurately.

[0090] This application provides a terminal device, which includes: at least one processor; and a memory communicatively connected to the at least one processor; wherein the memory stores instructions executable by the at least one processor, which are executed by the at least one processor to enable the at least one processor to perform the pipeline connection method in the above embodiments.

[0091] The following is for reference. Figure 8 The diagram illustrates a structural schematic of a terminal device suitable for implementing embodiments of this application. The terminal device in the embodiments of this application may include, but is not limited to, mobile terminals such as mobile phones, laptops, digital broadcast receivers, PDAs (Personal Digital Assistants), PADs (Portable Application Descriptions), PMPs (Portable Media Players), in-vehicle terminals (e.g., in-vehicle navigation terminals), and fixed terminals such as digital TVs and desktop computers. Figure 8 The terminal device shown is merely an example and should not impose any limitations on the functionality and scope of use of the embodiments of this application.

[0092] like Figure 8 As shown, the terminal device may include a processing unit 1001 (e.g., a central processing unit, a graphics processing unit, etc.), which can perform various appropriate actions and processes according to a program stored in a read-only memory (ROM) 1002 or a program loaded from a storage device 1003 into a random access memory (RAM) 1004. The RAM 1004 also stores various programs and data required for the operation of the terminal device. The processing unit 1001, ROM 1002, and RAM 1004 are interconnected via a bus 1005. An input / output (I / O) interface 1006 is also connected to the bus. Typically, the following systems can be connected to the I / O interface 1006: input devices 1007 including, for example, a touchscreen, touchpad, keyboard, mouse, image sensor, microphone, accelerometer, gyroscope, etc.; output devices 1008 including, for example, a liquid crystal display (LCD), speaker, vibrator, etc.; storage devices 1003 including, for example, magnetic tape, hard disk, etc.; and communication devices 1009. Communication device 1009 allows terminal devices to communicate wirelessly or wiredly with other devices to exchange data. Although terminal devices with various systems are shown in the figures, it should be understood that implementation or possession of all the systems shown is not required. More or fewer systems may be implemented alternatively.

[0093] Specifically, according to the embodiments disclosed in this application, the processes described above with reference to the flowcharts can be implemented as computer software programs. For example, embodiments disclosed in this application include a computer program product comprising a computer program carried on a computer-readable medium, the computer program containing program code for performing the methods shown in the flowcharts. In such embodiments, the computer program can be downloaded and installed from a network via a communication device, or installed from storage device 1003, or installed from ROM 1002. When the computer program is executed by processing device 1001, it performs the functions defined in the methods of the embodiments disclosed in this application.

[0094] The terminal device provided in this application, employing the pipeline splicing method in the above embodiments, can solve the technical problem of low pipeline splicing efficiency. Compared with the prior art, the beneficial effects of the terminal device provided in this application are the same as those of the pipeline splicing method provided in the above embodiments, and other technical features of this terminal device are the same as those disclosed in the method of the previous embodiment, and will not be repeated here.

[0095] It should be understood that the various parts disclosed in this application can be implemented using hardware, software, firmware, or a combination thereof. In the description of the above embodiments, specific features, structures, materials, or characteristics can be combined in any suitable manner in one or more embodiments or examples.

[0096] 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.

[0097] This application provides a computer-readable storage medium having computer-readable program instructions (i.e., a computer program) stored thereon, the computer-readable program instructions being used to execute the pipeline splicing method in the above embodiments.

[0098] The computer-readable storage medium provided in this application may be, for example, a USB flash drive, but is not limited to, electrical, magnetic, optical, electromagnetic, infrared, or semiconductor systems, devices, or any combination thereof. More specific examples of computer-readable storage media may include, but are not limited to: electrical connections having one or more wires, portable computer disks, hard disks, random access memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM or flash memory), optical fiber, portable compact disk read-only memory (CD-ROM), optical storage devices, magnetic storage devices, or any suitable combination thereof. In this embodiment, the computer-readable storage medium may be any tangible medium containing or storing a program that can be used by or in conjunction with an instruction execution system, system, or device. The program code contained on the computer-readable storage medium may be transmitted using any suitable medium, including but not limited to: wires, optical cables, RF (Radio Frequency), etc., or any suitable combination thereof.

[0099] The aforementioned computer-readable storage medium may be included in the terminal device; or it may exist independently and not assembled into the terminal device.

[0100] Computer program code for performing the operations of this application can be written in one or more programming languages ​​or a combination thereof, including object-oriented programming languages ​​such as Java, Smalltalk, and C++, as well as conventional procedural programming languages ​​such as "C" or similar programming languages. The program code can be executed entirely on the user's computer, partially on the user's computer, as a standalone software package, partially on the user's computer and partially on a remote computer, or entirely on a remote computer or server. In cases involving remote computers, the remote computer can be connected to the user's computer via any type of network—including a Local Area Network (LAN) or a Wide Area Network (WAN)—or can be connected to an external computer (e.g., via the Internet using an Internet service provider).

[0101] The flowcharts and block diagrams in the accompanying drawings illustrate the architecture, functionality, and operation of possible implementations of systems, methods, and computer program products according to various embodiments of this application. In this regard, each block in a flowchart or block diagram may represent a module, segment, or portion of code containing one or more executable instructions for implementing a specified logical function. It should also be noted that in some alternative implementations, the functions indicated in the blocks may occur in a different order than those indicated in the drawings. For example, two consecutively indicated blocks may actually be executed substantially in parallel, and they may sometimes be executed in reverse order, depending on the functions involved. It should also be noted that each block in the block diagrams and / or flowcharts, and combinations of blocks in the block diagrams and / or flowcharts, can be implemented using a dedicated hardware-based system that performs the specified function or operation, or using a combination of dedicated hardware and computer instructions.

[0102] The modules described in the embodiments of this application can be implemented in software or hardware. The names of the modules do not necessarily limit the functionality of the unit itself.

[0103] The storage medium provided in this application can solve the technical problem of low pipeline splicing efficiency. Compared with the prior art, the beneficial effects of the storage medium provided in this application are the same as those of the pipeline splicing method provided in the above embodiments, and will not be repeated here.

[0104] This application also provides a computer program product, including a computer program that, when executed by a processor, implements the steps of the pipeline connection method described above.

[0105] The computer program product provided in this application can solve the technical problem of low pipeline splicing efficiency. Compared with the prior art, the beneficial effects of the computer program product provided in this application are the same as the beneficial effects of the pipeline splicing method provided in the above embodiments, and will not be repeated here.

[0106] The above description is only a part of the embodiments of this application and does not limit the patent scope of this application. All equivalent structural transformations made under the technical concept of this application and using the contents of the specification and drawings of this application, or direct / indirect applications in other related technical fields, are included in the patent protection scope of this application.

Claims

1. A pipeline splicing method, characterized in that, The method includes: Obtain the pipeline dataset to be analyzed, and generate an adjacent pipeline record table based on the pipeline information of each pipeline in the pipeline dataset. The adjacent pipeline record table includes multiple pairs of adjacent pipelines, and each pair of adjacent pipelines includes two pipelines that are adjacent to each other. Based on the pipeline information, a feature consistency check is performed on the adjacent pipeline pairs, and the two pipelines in the adjacent pipeline pairs that pass the feature consistency check are joined together.

2. The pipeline splicing method as described in claim 1, characterized in that, The pipeline information includes the start and end positions of the pipeline. The step of generating an adjacent pipeline record table based on the pipeline information of each pipeline in the pipeline dataset includes: Based on the starting position and the ending position of each pipeline, calculate the distance between any two pipelines; When the distance is less than the preset adjacent fault tolerance limit, it is determined that there is an adjacent relationship between the two pipelines, and the two pipelines are recorded as the adjacent pipeline pair in the adjacent relationship record table.

3. The pipeline splicing method as described in claim 2, characterized in that, The calculation of the distance between any two pipelines based on the starting position and the ending position of each pipeline includes: Calculate the distance between the end point of the first pipeline and the start point of the second pipeline, and use it as the first distance between the first pipeline and the second pipeline; The distance between the starting point of the first pipeline and the starting point of the second pipeline is calculated to obtain a first result value, and the distance between the ending point of the first pipeline and the ending point of the second pipeline is calculated to obtain a second result value. The result value with the largest value between the first result value and the second result value is selected as the second distance between the first pipeline and the second pipeline. The step of determining that there is an adjacency relationship between the two pipelines when the distance is less than a preset adjacent fault tolerance upper limit includes: If the first distance is less than the preset first adjacent fault tolerance upper limit, or the second distance is less than the preset second adjacent fault tolerance upper limit, then it is determined that there is an adjacent relationship between the first pipeline and the second pipeline.

4. The pipeline splicing method as described in claim 3, characterized in that, The method further includes: If an adjacency relationship is determined between the first pipeline and the second pipeline based on the first distance, the first pipeline and the second pipeline are grouped into a first type of adjacency pair. If an adjacency relationship is determined between the first pipeline and the second pipeline based on the second distance, the first pipeline and the second pipeline are grouped into a second type of adjacency pair; Furthermore, the pipeline information includes pipeline type, attributes, pipeline elevation, starting burial depth, and ending burial depth. The method also includes: Based on the pipeline elevation of the first pipeline and the pipeline elevation of the second pipeline, calculate the elevation difference between the first pipeline and the second pipeline; Perform a feature consistency check operation on each of the first type of adjacent relationships: Based on the starting and ending burial depths of the first pipeline and the starting and ending burial depths of the second pipeline, determine whether the flow direction relationship between the first pipeline and the second pipeline is correct; if the pipeline types and attributes of the first pipeline and the second pipeline in the first type of adjacent relationship pair are consistent, the elevation difference between the first pipeline and the second pipeline does not exceed the preset difference threshold, and the flow direction relationship between the first pipeline and the second pipeline is correct, then determine that the first type of adjacent pipeline pair passes the feature consistency check; Perform a feature consistency check operation on each of the second type of adjacent relationships: If the first pipeline and the second pipeline in the second type of adjacent relationship pair have the same pipeline type, the same attributes, and the elevation difference value does not exceed the preset difference threshold, then the second type of adjacent pipeline pair is determined to pass the feature consistency check.

5. The pipeline splicing method as described in claim 4, characterized in that, The process of joining two pipelines in the adjacent pipeline pair that have passed the feature consistency check includes: Determine the upstream and downstream pipelines in each pair of the first type of adjacent relationships that pass the feature consistency check, wherein if the first pipeline is an upstream pipeline, then the second pipeline is a downstream pipeline, and if the second pipeline is a downstream pipeline, then the first pipeline is an upstream pipeline. For each pair of adjacent relationships of the first type that passes the feature consistency check, it is determined whether there is a break in the upstream pipeline, and the break analysis result is obtained. The upstream pipeline and the downstream pipeline are then connected according to the pipeline connection method that matches the first distance and the break analysis result. For each pair of second-type adjacent relationships that passes the feature consistency check, connect the first pipeline and the second pipeline in the pair of second-type adjacent relationships according to the pipeline connection method that matches the second distance.

6. The pipeline splicing method as described in claim 5, characterized in that, The pipeline information includes the point facilities associated with the endpoint of the pipeline. The step of determining whether the first pipeline in the first type of adjacent relationship pair has a break, and obtaining the break analysis result, includes: Determine whether the point facility associated with the end point of the upstream pipeline is a drainage outlet; If the point facility associated with the end point of the upstream pipeline is a drainage outlet, then it is determined that the upstream pipeline has a break; otherwise, it is determined that the upstream pipeline does not have a break.

7. The pipeline splicing method as described in claim 5 or 6, characterized in that, The connection of the upstream pipeline and the downstream pipeline according to the pipeline connection method matching the first distance and the severed end analysis result includes: If the upstream pipeline in the first type of adjacent relationship pair has a break and the first distance is less than a preset first offset threshold, then the starting position of the downstream pipeline in the first type of adjacent relationship pair is modified to the ending position of the upstream pipeline to connect the upstream pipeline and the downstream pipeline. If the upstream pipeline in the first type of adjacent relationship pair has a break and the first distance is greater than or equal to the preset first offset threshold, then a third pipeline is added between the upstream pipeline and the downstream pipeline in the first type of adjacent relationship pair, wherein the starting position of the third pipeline is set as the ending position of the upstream pipeline, and the ending position of the third pipeline is set as the starting position of the downstream pipeline. The step of connecting the first pipeline and the second pipeline in the second type of adjacent relationship pair according to the pipeline connection method matching the second distance includes: If the second distance is less than a preset first offset threshold, then the first pipeline and the second pipeline in the second type of adjacent relationship pair are merged.

8. A terminal device, characterized in that, The device includes: a memory, a processor, and a computer program stored in the memory and executable on the processor, the computer program being configured to implement the steps of the pipeline splicing method as described in any one of claims 1 to 7.

9. A storage medium, characterized in that, The storage medium is a computer-readable storage medium, and a computer program is stored on the storage medium. When the computer program is executed by a processor, it implements the steps of the pipeline splicing method as described in any one of claims 1 to 7.

10. A computer program product, characterized in that, The computer program product includes a computer program that, when executed by a processor, implements the steps of the pipeline splicing method as described in any one of claims 1 to 7.

Images