An engineering information tree modeling method and system for digitalizing an irrigation district

Abstract

The application discloses a kind of digital irrigation area engineering information tree model modeling method and system, it is related to irrigation area water network data processing technical field, including according to river source estuary engineering instance subset, based on spatial intersection algorithm and the key node set of engineering information tree based on recursive depth-first traversal algorithm is constructed, according to associated engineering instance subset set and key node set, based on spatial near neighbor algorithm, shortest distance point algorithm constructs the main subsidiary node set of engineering information tree;According to associated engineering instance subset set and main subsidiary node set, based on spatial near neighbor algorithm constructs the secondary subsidiary node set of engineering information tree;According to the key node set of engineering information tree, main subsidiary node set and secondary subsidiary node set, the engineering information tree model of irrigation area engineering is constructed.The application realizes irrigation area engineering information sharing, improves the collaborative management efficiency of irrigation area engineering information.

Description

Technical Field

[0001] This invention relates to the field of irrigation district water network data processing technology, and in particular to a method and system for modeling an engineering information tree model of a digital irrigation district. Background Technology

[0002] The main problems with traditional irrigation district engineering information management are: Irrigation districts are widely distributed, and daily operation and management are generally carried out by separate management units and engineering manuals. This results in a lack of distribution and relationship maps of irrigation district projects, leading to poor information sharing and low collaborative management efficiency. Furthermore, during the continued construction, upgrading, and modernization of irrigation district projects, there is currently no effective irrigation district engineering relationship model to provide decision support for accurately assessing the current layout and overall condition of the projects and ancillary facilities. A scientifically sound and reasonable irrigation district engineering relationship model has also not yet been constructed to effectively improve the efficiency of water resource allocation and management.

[0003] Therefore, a modeling method and system for an engineering information tree model of digital irrigation districts was developed to solve the above problems. Summary of the Invention

[0004] This invention proposes a modeling method and system for an engineering information tree model of a digital irrigation district, in order to solve the problems of poor information sharing and low efficiency of collaborative management in existing irrigation districts.

[0005] The present invention achieves the above objectives through the following technical solutions:

[0006] This invention provides a method for modeling an engineering information tree model of a digital irrigation district, comprising:

[0007] Obtain the irrigation district project dataset, which includes basic project information and geographical information. The geographical information includes the coordinate point set of the project.

[0008] The irrigation district engineering dataset is encoded to obtain encoded data;

[0009] The coded data is subjected to feature extraction of Heyuan Estuary engineering type, resulting in a set of Heyuan Estuary engineering instance subsets. Based on the set of Heyuan Estuary engineering instance subsets, a set of key nodes of the engineering information tree is constructed using a spatial intersection algorithm and a recursive depth-first traversal algorithm.

[0010] Engineering relationship features are extracted from the coded data to obtain a subset of associated engineering instances. Based on the subset of associated engineering instances and the set of key nodes, a set of main and auxiliary nodes of the engineering information tree is constructed using the spatial nearest neighbor algorithm and the shortest distance point algorithm. The engineering relationship features include the relationship between engineering projects and the station number information of the engineering projects.

[0011] Based on the subset of associated project instances and the set of primary and secondary nodes, construct the set of secondary secondary nodes of the project information tree using the spatial nearest neighbor algorithm;

[0012] The engineering information tree model of the irrigation district project is constructed based on the key node set, primary and secondary node set, and secondary secondary node set of the engineering information tree.

[0013] Furthermore, obtain the irrigation district project dataset, including:

[0014] Obtain basic project information, including project name, type, structure, management unit, and administrative region;

[0015] Obtain engineering geographic information, including the longitude and latitude information of the project.

[0016] Furthermore, the irrigation district engineering dataset is uniformly encoded to obtain encoded data, including:

[0017] The first coded data is obtained by sequentially assigning the coding length and number of bits to the irrigation district engineering dataset;

[0018] The final encoded data is obtained by assigning project type subcode, project area subcode, project level subcode, and quantity subcode to the first encoded data.

[0019] Furthermore, feature extraction of Heyuan Estuary Engineering Types is performed on the coded data to obtain a subset of Heyuan Estuary Engineering Instances, including:

[0020] Extract a subset of channel engineering instances from the coded data;

[0021] Extract a subset of river engineering instances from the coded data;

[0022] Extract a subset of lake engineering instances from the coded data;

[0023] Extract a subset of reservoir project instances from the coded data;

[0024] Construct a set of river source and estuary engineering instance subsets based on the subsets of canal engineering instances, river engineering instances, lake engineering instances, and reservoir engineering instances.

[0025] Furthermore, based on a subset of engineering examples from the Heyuan Estuary, a set of key nodes for the engineering information tree is constructed using a spatial intersection algorithm and a recursive depth-first traversal algorithm. This set includes:

[0026] For each channel engineering instance in the subset of channel engineering instances, a channel source engineering sequence and a channel estuary engineering sequence are generated sequentially. This includes: obtaining the starting point of the coordinate point set corresponding to the current channel engineering instance; using the Euclidean distance formula in GIS to determine whether the starting point intersects with the coordinate point sets of the remaining channel engineering instances in the subset of channel engineering instances, the coordinate point sets of the remaining river engineering instances in the subset of river engineering instances, the coordinate point sets of the remaining lake engineering instances in the subset of lake engineering instances, and the coordinate point sets of the remaining reservoir engineering instances in the subset of reservoir engineering instances. If they intersect, the current channel engineering instance is generated based on the engineering instances corresponding to all points intersecting with the starting point. For the channel source engineering sequence of the instance, obtain the termination point of the coordinate point set corresponding to the current channel engineering instance, and call the Euclidean distance formula in GIS to determine whether the termination point intersects with the coordinate point sets of the remaining channel engineering instances in the channel engineering instance subset, the coordinate point sets of the river engineering instances in the river engineering instance subset, the coordinate point sets of the lake engineering instances in the lake engineering instance subset, and the coordinate point sets of the reservoir engineering instances in the reservoir engineering instance subset. If they intersect, generate the channel estuary engineering sequence based on the engineering instances corresponding to all points intersecting with the termination point, and generate the channel source estuary engineering sequence based on the channel source engineering sequence and the channel estuary engineering sequence.

[0027] Similarly, for each river engineering instance in the subset of river engineering instances, a river source engineering sequence and a river estuary engineering sequence are generated sequentially, and then the river source estuary engineering sequence is obtained.

[0028] Similarly, for each lake engineering instance in the subset of lake engineering instances, a sequence of lake source engineering sequences and a sequence of lake estuary engineering sequences are generated sequentially, and then the sequence of lake source estuary engineering sequences is obtained.

[0029] Similarly, for each reservoir project instance in the subset of reservoir project instances, a reservoir source project sequence and a reservoir estuary project sequence are generated sequentially, and then the reservoir source estuary project sequence is obtained.

[0030] Construct a set of river source and estuary engineering sequences based on the sequences of canal river source and estuary engineering projects, river river source and estuary engineering projects, lake river source and estuary engineering projects, and reservoir river source and estuary engineering projects;

[0031] Convert the set of river source and estuary sequences into a directed graph of engineering relationships;

[0032] Based on a recursive depth-first traversal algorithm, the directed graph of engineering relationships is modeled according to the opposite direction of the river mouth, and the set of key nodes of the engineering information tree is output. Each key node in the set corresponds to an engineering instance.

[0033] Furthermore, when the key node is a multi-source node, the flow parameters of all source nodes of the key node are sorted, the source node with the largest flow parameter is set as the main source of the multi-source node and assigned a corresponding main source identifier, and the remaining source nodes are set as the subordinate sources of the multi-source node and assigned corresponding subordinate source identifiers. The key node pointed to by multiple source nodes is a multi-source node.

[0034] Furthermore, based on the set of key nodes, a segmented sequence set of the key node set is constructed using the circular region intersection algorithm, including:

[0035] The circular region intersection algorithm generates a segmented sequence for each engineering instance in the key node set according to the sequence.

[0036] Specifically, a sequence of ring regions is pre-defined, which includes several ring regions. Each ring region includes a set of coordinate points. The Euclidean distance formula in GIS is called to sequentially determine whether each coordinate point in the coordinate point set corresponding to the engineering instance of the key node set intersects with each ring region. If they intersect, the coordinates of the two points where the coordinate point set corresponding to the engineering instance intersects with the corresponding ring region are obtained. Based on the coordinates of the two intersection points and the direction of the coordinate point set corresponding to the engineering instance, the starting and ending points of the corresponding ring region segment are determined. This process is repeated to obtain the starting and ending points of all ring region segments. A segmentation sequence is generated based on the starting and ending points of all ring region segments.

[0037] Construct a set of segmented sequences of the key node set based on the segmented sequences of all project instances in the key node set.

[0038] Furthermore, based on the subset of associated project instances and the set of key nodes, a set of main and subordinate nodes of the project information tree is constructed using spatial nearest neighbor and shortest distance point algorithms, including:

[0039] For each engineering instance in the key node set, a sequence of associated relationship data is generated, including: obtaining the starting point of the coordinate point set corresponding to the current engineering instance as the current reference point; judging the proximity relationship between the current reference point and the coordinate point set corresponding to each engineering instance in the associated engineering instance subset set based on the spatial nearest neighbor algorithm and the preset nearest neighbor length; filtering out engineering instances that satisfy the proximity relationship with the current reference point; using the preset nearest neighbor length as a fixed step size; obtaining the next coordinate point that intersects the current engineering instance's coordinate point set with the circle with the current reference point as the center and the preset nearest neighbor length as the radius; similarly, filtering out engineering instances that satisfy the proximity relationship with the next current reference point; and so on, until there are no coordinate points that intersect with the circle; then, taking the last coordinate point in the coordinate point set corresponding to the current engineering instance as the next current reference point; finally, filtering out all engineering instances that satisfy the proximity relationship with the current engineering instance; and generating the associated relationship data sequence of the current engineering instance based on all engineering instances that satisfy the proximity relationship with the current engineering instance.

[0040] In the spatial nearest neighbor algorithm, the nearest neighbor relationship refers to the distance between the current reference point and the coordinate point set corresponding to all engineering instances in the associated data sequence calculated by calling the Euclidean distance formula in GIS. A distance less than or equal to the preset nearest neighbor length is considered a nearest neighbor relationship; the preset nearest neighbor length is the nearest neighbor length of the spatial nearest neighbor algorithm.

[0041] A set of association relationship data sequences is constructed based on the association relationship data sequences of all engineering instances in the set of key nodes;

[0042] Simultaneously, for each engineering instance in the key node set, a chainage information data sequence is generated sequentially, including: for each current reference point of the current engineering instance, the Euclidean distance formula in GIS is called to calculate the distance between the current reference point and the coordinate point set corresponding to all engineering instances in the associated data sequence, and the calculation results are sorted. The shortest distance after sorting is used as the basis to obtain the coordinate point with the shortest distance relative to the current reference point in the coordinate point set corresponding to all engineering instances in the associated data sequence. The curve length of the shortest distance coordinate point relative to the starting point of the coordinate point set of the current engineering instance is converted according to the preset chainage format to generate the chainage information associated with the current reference point. This process is repeated until all chainage information associated with the current engineering instance is generated, and a chainage information data sequence is generated based on all chainage information associated with the current engineering instance.

[0043] A set of station number information data sequences is constructed based on the station number information data sequences of all engineering instances in the set of key nodes;

[0044] Construct a set of primary and secondary nodes based on the set of association relationship data sequences and the set of station number information data sequences.

[0045] Furthermore, based on the subset of associated project instances and the set of primary and secondary nodes, a set of secondary secondary nodes for the project information tree is constructed using the spatial nearest neighbor algorithm, including:

[0046] For each project instance in the set of primary and secondary nodes, a next-level association data sequence is generated sequentially, including: obtaining the starting point of the coordinate point set corresponding to the current project instance as the current reference point; judging the proximity relationship between the current reference point and the coordinate point set corresponding to each project instance in the subset of associated project instances based on the spatial nearest neighbor algorithm and the preset nearest neighbor length; filtering out project instances that satisfy the nearest neighbor relationship with the current reference point; using the preset nearest neighbor length as a fixed step size; obtaining the next coordinate point that intersects the current project instance's coordinate point set with the circle with the current reference point as the center and the preset nearest neighbor length as the radius; similarly, filtering out project instances that satisfy the nearest neighbor relationship with the next current reference point; and so on, until there are no coordinate points that intersect with the circle; then, taking the last coordinate point in the coordinate point set corresponding to the current project instance as the next current reference point; finally, filtering out all project instances that satisfy the nearest neighbor relationship with the current project instance; and generating the next-level association data sequence of the current project instance based on all project instances that satisfy the nearest neighbor relationship with the current project instance.

[0047] The next-level relationship data sequence set is constructed based on the next-level relationship data sequence of all project instances in the main and subordinate node set;

[0048] The set of secondary subordinate nodes is formed by the set of data sequences of the next level of association and the set of data sequences of station number information.

[0049] The present invention also provides a system for the engineering information tree modeling method for a digital irrigation district, comprising:

[0050] The acquisition module is used to acquire irrigation district project dataset, which includes basic project information and geographical information of the project, including a set of coordinate points of the project.

[0051] The encoding module is used to encode the irrigation district engineering dataset to obtain encoded data;

[0052] The first construction module is used to extract the characteristics of Heyuan River Estuary engineering types from the encoded data, obtain a set of Heyuan River Estuary engineering instance subsets, and construct a set of key nodes of the engineering information tree based on the set of Heyuan River Estuary engineering instance subsets, using a spatial intersection algorithm and a recursive depth-first traversal algorithm.

[0053] The second construction module is used to extract engineering relationship features from the encoded data to obtain a subset of associated engineering instances. Based on the subset of associated engineering instances and the set of key nodes, the main and auxiliary node set of the engineering information tree is constructed using the spatial nearest neighbor algorithm and the shortest distance point algorithm. The engineering relationship features include the relationship between engineering projects and the station number information of the engineering projects.

[0054] The third construction module is used to construct a set of secondary subordinate nodes of the engineering information tree based on the spatial nearest neighbor algorithm, according to the set of subsets of associated engineering instances and the set of primary and secondary nodes.

[0055] The modeling module is used to construct an engineering information tree model of the irrigation area project based on the key node set, primary and secondary node set, and secondary secondary node set of the engineering information tree.

[0056] The beneficial effects of this invention are as follows:

[0057] This invention proposes a modeling method and system for an engineering information tree model of a digital irrigation district, which realizes global topological information management of irrigation district projects. It not only supports the overall evaluation and planning of irrigation district projects, but also effectively meets the operation and management of irrigation district water network information and relationships. By establishing an irrigation district engineering information tree model, it provides an information foundation for intelligent scheduling and grid management of irrigation district water resources projects, supports the construction of methods and systems for irrigation district water resources prediction and decision-making, and ultimately establishes higher quality and more scientific and effective irrigation district project utilization and management capabilities. Attached Figure Description

[0058] Figure 1 This is a flowchart illustrating a method for modeling an engineering information tree model of a digital irrigation district, as described in an embodiment of this application.

[0059] Figure 2 This is a schematic diagram illustrating the generation of the association sequence of the engineering information tree in this embodiment of the application. Detailed Implementation

[0060] To make the objectives, technical solutions, and advantages of the embodiments of the present invention clearer, the technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some, not all, of the embodiments of the present invention. The components of the embodiments of the present invention described and shown in the accompanying drawings can generally be arranged and designed in various different configurations.

[0061] Therefore, the following detailed description of the embodiments of the invention provided in the accompanying drawings is not intended to limit the scope of the claimed invention, but merely to illustrate selected embodiments of the invention. All other embodiments obtained by those skilled in the art based on the embodiments of the invention without inventive effort are within the scope of protection of the invention.

[0062] The specific embodiments of the present invention will now be described in detail with reference to the accompanying drawings.

[0063] like Figure 1 As shown, the present invention provides a method and system for modeling engineering information trees in digital irrigation districts, comprising:

[0064] S1: Obtain the irrigation district project dataset, which includes basic project information and geographical information. The geographical information includes the coordinate point set of the project.

[0065] S2: Encode the irrigation district engineering dataset to obtain encoded data;

[0066] S3: Extract the feature of Heyuan River Estuary project type from the encoded data to obtain a set of Heyuan River Estuary project instance subsets. Based on the set of Heyuan River Estuary project instance subsets, construct a set of key nodes of the project information tree based on the spatial intersection algorithm and the recursive depth-first traversal algorithm.

[0067] S4: Extract engineering relationship features from the coded data to obtain a subset of associated engineering instances. Based on the subset of associated engineering instances and the set of key nodes, construct the main and auxiliary node set of the engineering information tree using the spatial nearest neighbor algorithm and the shortest distance point algorithm. The engineering relationship features include the relationship between engineering projects and the station number information of the engineering projects.

[0068] S5: Based on the subset of associated project instances and the set of primary and secondary nodes, construct the set of secondary secondary nodes of the project information tree using the spatial nearest neighbor algorithm;

[0069] S6: Construct an engineering information tree model for the irrigation district project based on the set of key nodes, primary and secondary nodes, and secondary nodes of the engineering information tree.

[0070] Among them, "river source" refers to the source of the river, and "river mouth" refers to the end of the river.

[0071] In one embodiment, obtaining an irrigation district project dataset includes:

[0072] Obtain basic project information, including project name, type, structure, management unit, and administrative region;

[0073] Obtain engineering geographic information, including the longitude and latitude information of the project.

[0074] In one embodiment, the irrigation district engineering dataset is uniformly encoded to obtain encoded data, including:

[0075] The first coded data is obtained by sequentially assigning the coding length and number of bits to the irrigation district engineering dataset;

[0076] The final encoded data is obtained by assigning project type subcode, project area subcode, project level subcode, and quantity subcode to the first encoded data.

[0077] In one embodiment, the encoded data is subjected to river source and estuary engineering type feature extraction to obtain a subset of river source and estuary engineering instance sets, including:

[0078] Extract a subset of channel engineering instances from the coded data;

[0079] Extract a subset of river engineering instances from the coded data;

[0080] Extract a subset of lake engineering instances from the coded data;

[0081] Extract a subset of reservoir project instances from the coded data;

[0082] Construct a set of river source and estuary engineering instance subsets based on the subsets of canal engineering instances, river engineering instances, lake engineering instances, and reservoir engineering instances.

[0083] Specifically, given a set of engineering datasets P1, obtain the corresponding subset of engineering instances Pps={PC, PR, PL, PRe} based on the characteristics of the river source and estuary engineering types. PC is the subset of canal engineering instances, PR is the subset of river engineering instances, PL is the subset of lake engineering instances, and PRe is the subset of reservoir engineering instances.

[0084] Specifically, for the canal project instance subset PC, the starting point Pfcp and ending point Plcp of the first canal project instance Ppc are obtained first. The starting point Pfcp is then used to determine whether it intersects with the point sets of the remaining canal project instances, the point sets of the river project instance subset PR, the point sets of the lake project instance subset PL, and the point sets of the reservoir project instance subset PRE using the Euclidean distance formula in GIS. If they intersect, the canal, river, lake, or reservoir project corresponding to that point is included in the source project sequence of Ppc. Then, the ending point Plcp is used to determine whether it intersects with the point sets of the remaining canal project instances, the point sets of the river project instance subset PR, the point sets of the lake project instance subset PR, and the point sets of the reservoir project instance subset PR using the Euclidean distance formula in GIS. If they intersect, the canal, river, lake, or reservoir project corresponding to that point is included in the estuary project sequence of the first canal project instance Ppc.

[0085] Repeat the above process to obtain the second channel project instance and generate its corresponding river source and estuary sequence;

[0086] After the loop ends, the source and estuary sequence Pcsd of all channel engineering instances is generated;

[0087] Specifically, for the river engineering instance subset PR, the starting point Pfrp and ending point Plrp of the first channel engineering instance Ppr are obtained first. The starting point Pfrp is then used to determine whether it intersects with the point sets of the remaining river engineering instances, the point sets of the channel engineering instance subset PC, the point sets of the lake engineering instance subset PL, and the point sets of the reservoir engineering instance subset PRe using the Euclidean distance formula in GIS. If they intersect, the river, channel, lake, or reservoir engineering instance corresponding to that point is included in the source engineering sequence of Ppr. Then, the ending point Plrp is used to determine whether it intersects with the point sets of the remaining river engineering instances, the point sets of the channel engineering instance subset PC, the point sets of the lake engineering instance subset PL, and the point sets of the reservoir engineering instance subset PRe using the Euclidean distance formula in GIS. If they intersect, the river, channel, lake, or reservoir engineering instance corresponding to that point is included in the estuary engineering sequence of Ppr.

[0088] Repeat the above process to obtain the second river engineering instance and generate its corresponding river source and estuary sequence;

[0089] After the loop ends, the source and estuary sequences Prsd for all river engineering instances are generated;

[0090] Similarly, generate the source and estuary sequence Plsd for all lake engineering instances and the source and estuary sequence Presd for all reservoir engineering instances;

[0091] Specifically, the established set of river source and estuary sequences, Psd={Pcsd, Prsd, Plsd, Presd}, is transformed into a directed graph of engineering relationships, Gp. Gp is ​​a dictionary set. The keys of the directed graph of engineering relationships are the river source nodes, and the values ​​are the list of estuary nodes pointed to by the river source nodes (i.e., the nodes pointed to by the edges originating from that node). For example, the expression of the directed graph of engineering relationships is as follows:

[0092] Gp={Gpre, Gpr, Gpl, Gpc};

[0093] Gpre={'Pre1':['Pc1','Pc2'],'Pre2':['Pc3'],'Pre3':['Pc4']...'Pren':[]};

[0094] Gpr={'Pr1':['Pr2','Pc2'],'Pr2':['Pc5'],'Pr3':['Pc6']...'Prn':[]};

[0095] Gpl={'Pl1':['Pc1','Pc7'],'Pl2':['Pc2'],'Pl3':['Pc8']......'Pln':[]};

[0096] Gpc={'Pc1':['Pre4','Pc9'],'Pc2':['Pr4','Pc'],'Pc3':['Pc10','Pl4'],'Pc4':['Pre1','Pc5','Pc6']...'Pcn':['Pren']};

[0097] Gpre is the reservoir project index in the directed graph of engineering relationships. Pre1, Pre2, Pre3, and Pren all represent reservoir nodes (i.e., river source nodes, and also keys in the directed graph of engineering relationships, and so on). Pc1 and Pc2 are the channel nodes pointed to by reservoir node Pre1 (i.e., the list of river mouth nodes, and also values ​​in the directed graph of engineering relationships, and so on). Pc3 is the channel node pointed to by reservoir node Pre2, Pc4 is the channel node pointed to by reservoir node Pre3, and so on, until reservoir node Pren. The list of river mouth nodes pointed to by reservoir node Pren is not elaborated in the above expression.

[0098] Gpr is the river engineering index in the directed graph of engineering relationships. Pr1, Pr2, Pr3, and Prn all represent river nodes. Pr2 and Pc2 are the river nodes and channel nodes pointed to by river node Pr1, Pc5 is the channel node pointed to by river node Pr2, Pc6 is the channel node pointed to by river node Pr3, and so on, up to river node Prn. The list of river mouth nodes pointed to by river node Prn is not repeated in the above expression.

[0099] Gpl is the lake project index in the directed graph of project relationships. Pl1, Pl2, Pl3, and Pln all represent lake nodes. Pc1 and Pc7 are the channel nodes pointed to by lake node Pl1, Pc2 is the channel node pointed to by lake node Pl2, Pc8 is the channel node pointed to by lake node Pl3, and so on, up to lake node Pln. The list of estuary nodes pointed to by lake node Pln is not repeated in the above expression.

[0100] Gpc is the channel project index in the directed graph of project relationships. Pc1, Pc2, Pc3, Pc4, and Pcn all represent channel nodes. Pre4 and Pc9 are the reservoir nodes pointed to by channel node Pc1. Pr4 and Pc are the river nodes and channel nodes pointed to by channel node Pc2. Pc10 and Pl4 are the channel nodes and lake nodes pointed to by channel node Pc3. Pre1, Pc5, and Pc6 are the reservoir nodes and channel nodes pointed to by channel node Pc4, and so on, up to channel node Pcn. The list of estuary nodes pointed to by channel node Pcn is not repeated in the above expression.

[0101] A multi-source node refers to a node pointed to by multiple source nodes. The multi-source characteristic of a key node can be understood as a key node having multiple parent key nodes. To ensure the uniqueness of key nodes in the tree model, this scheme encodes the multi-source characteristics using feature identifiers. Key nodes under the main source are identified and encoded with "#$", while key nodes under other sources are identified and encoded with "#@". The identifier encoding under the main source provides the basis for continuing the DFS traversal, while the identifier encoding under other sources provides the basis for physical relationships. Specifically, the multi-source characteristics are determined by sorting the flow parameter values ​​corresponding to the preset source projects in order of magnitude, with the largest parameter value being the main source and other values ​​being other sources.

[0102] Specifically, for Gp, a recursive depth-first search (DFS) algorithm is used to model the relationship in the opposite direction of the river mouth, and the key node set Tp of the engineering information tree is output. The recursive depth-first search algorithm is an existing algorithm, and the calculation process is an existing calculation process, so it will not be described in detail in this paper; ":" represents the river source relationship, "#$" represents the main river source identifier of the river source node, and "#@" represents the subordinate river source identifier of the river source node. The expression of the key node of the engineering information tree, taking the channel node Pc1 as an example, is as follows:

[0103] Tp [Pc1] [Heyuan]={'Pc1':['Pre1#$':['Pc4'],'Pl1#@']}.

[0104] In this expression, for channel node Pc1 in the key node set Tp, along the river source direction, reservoir node Pre1 and lake node Pl1 are river source nodes pointing to channel node Pc1. Therefore, channel node Pc1 is a multi-river source node, where reservoir node Pre1 is the main river source of channel node Pc1, lake node Pl1 is the secondary river source of channel node Pc1, and channel node Pc4 is the river source node of reservoir node Pre1.

[0105] Specifically, when a critical node is a multi-source node, the flow parameters of all source nodes of the critical node are sorted. The source node with the largest flow parameter is set as the main source of the multi-source node and assigned a corresponding main source identifier. The remaining source nodes are set as secondary sources of the multi-source node and assigned corresponding secondary source identifiers. A critical node pointed to by multiple source nodes is a multi-source node. The flow parameter of channel nodes is the maximum design flow, the flow parameter of river nodes is the maximum design flow, the flow parameter of lake nodes is the outflow from the lake, and the flow parameter of reservoir nodes is the maximum downstream discharge flow.

[0106] In one embodiment, it further includes:

[0107] A sequence of annular regions is predefined. The sequence of annular regions includes several annular regions, and each annular region includes a set of coordinate points.

[0108] For each engineering instance in the key node set, a segmented sequence is generated sequentially. The Euclidean distance formula within the GIS is used to sequentially determine whether each coordinate point in the coordinate point set corresponding to the engineering instance intersects with each annular region. If an intersection occurs, the coordinates of the two points where the coordinate point set of the engineering instance intersects with the corresponding annular region are obtained. Based on the coordinates of the two intersection points and the direction of the coordinate point set corresponding to the engineering instance, the start and end points of the corresponding annular region segment are determined. This process is repeated to obtain the start and end points of all annular region segments. A segmented sequence is then generated based on the start and end points of all annular region segments. The direction of the coordinate point set corresponding to the engineering instance refers to the direction of the point set sequence from the start point to the end point. An annular region segment refers to a segment on the physical engineering entity corresponding to this annular region, and each annular region segment has a start point, an end point, and intermediate points.

[0109] Construct a segmented sequence set based on the segmented sequences of all project instances in the key node set.

[0110] Specifically, for the current engineering instance Pp in the river source and estuary sequence set, given a set of annular regions OR={Or1, Or2, ..., Orn}, where Or1, Or2, ..., Orn are each annular region, and each annular region is represented by a set of coordinate points, Ori={p1, p2, ..., pn}, where p1, p2, ..., pn are each coordinate point in the annular region Ori. For the coordinate point set Ptl of the current engineering instance Pp, the coordinate points in Ptl and the points in Ori are judged according to the spatial intersection formula to obtain the two intersecting coordinate points of the linear engineering Ptl and the annular region Ori, and the starting point and ending point of the segment are determined according to the direction of Pt1, namely Ps1 and Ps2 respectively.

[0111] Similarly, the intersection coordinates of all annular regions within OR with Ptl are calculated, and the intersection points are used as the starting and ending points of the segmented data according to the flow direction to generate a set of segmented sequences.

[0112] In one embodiment, based on the set of subsets of associated project instances and the set of key nodes, a set of main and auxiliary nodes of the project information tree is constructed using the spatial nearest neighbor algorithm and the shortest distance point algorithm.

[0113] Specifically, such as Figure 2As shown, the analysis algorithm for geospatial nearest neighbor association under a fixed step size is as follows: For each key node, for the set of coordinate points Ptl corresponding to the current engineering instance Pp in the key node set, the starting point Po1 in Ptl is taken as the current reference point. Based on the spatial nearest neighbor algorithm and the preset nearest neighbor length R, the nearest neighbor relationship between the current reference point Po1 and the set of coordinate points Pd corresponding to each engineering instance P1i in the associated engineering instance subset set is determined. If the preset nearest neighbor length R is within the set, a nearest neighbor relationship exists. Then, P1i is included in the association relationship data sequence of the current engineering instance Pp in the key node set, and engineering instances that satisfy the nearest neighbor relationship with the current reference point are selected.

[0114] The next current reference point of the current project instance Pp is obtained by using a preset nearest neighbor length R as a fixed step size. Based on the preset fixed step size R radius, a circle with radius R centered on the current reference point Po1 is calculated for the coordinate point set of the current project instance Pp to obtain the next intersecting coordinate point as the next current reference point Po2. This process is repeated. When there is no intersecting coordinate point, the last coordinate point in the coordinate point set corresponding to the current project instance is taken as Po2, and the last coordinate point Po2 is taken as the next current reference point. This process is repeated to obtain the subsequent current reference points Po3, Po4...Pon. Finally, all project instances that satisfy the nearest neighbor relationship with the current project instance are selected, and the association relationship data sequence of the current project instance is generated based on all project instances that satisfy the nearest neighbor relationship with the current project instance.

[0115] The association relationship data sequence set Ppr={P1, P2, ..., Pn} is constructed based on the association relationship data sequence of all engineering instances in the key node set, where P1, P2, ..., Pn are the respective association relationship data sequences;

[0116] Simultaneously, for each engineering instance in the key node set, a chainage information data sequence is generated sequentially, including: for each current reference point of the current engineering instance, the Euclidean distance formula in GIS is called to calculate the distance between the current reference point and the coordinate point set corresponding to all engineering instances in the associated data sequence, and the calculation results are sorted. The shortest distance after sorting is used as the basis to obtain the coordinate point with the shortest distance relative to the current reference point in the coordinate point set corresponding to all engineering instances in the associated data sequence. The curve length of the shortest distance coordinate point relative to the starting point of the coordinate point set of the current engineering instance is converted according to the preset chainage format to generate the chainage information associated with the current reference point. This process is repeated until all chainage information associated with the current engineering instance is generated, and a chainage information data sequence is generated based on all chainage information associated with the current engineering instance.

[0117] Specifically, based on the above nearest neighbor relationship judgment, a relationship judgment is made between the associated relationship data sequence and the key node set to obtain the station number sequence. Specifically, for the coordinate point set Pd corresponding to the engineering instance P1i in the associated engineering instance subset set Ppr, the Euclidean distance formula in GIS space is called to calculate and sort the distances between all coordinate points of the current engineering instance Pp in the key node set. The shortest distance is used to obtain the nearest distance point Ppt of P1i relative to Pp. After the curve length of Ppt relative to the starting point of Pp is converted according to the preset station number format, the station number information of P1i associated with Pp is generated. The station number information is included in the station number information data sequence corresponding to the associated sequence of P1i associated with Pp.

[0118] Repeat the above process, calculate and sort the distance between the coordinate point set Pd2 corresponding to the next engineering instance in the associated engineering instance subset set Ppr and all coordinate points of the current engineering instance Pp in the Po key node set, and so on, until all station information associated with the current engineering instance Pp is generated, and generate a station information data sequence based on all station information associated with the current engineering instance Pp.

[0119] A set of station number information data sequences is constructed based on the station number information data sequences of all engineering instances in the set of key nodes;

[0120] Construct a set of primary and secondary nodes based on the set of association relationship data sequences and the set of station number information data sequences.

[0121] In one embodiment, based on the subset of associated project instances and the set of primary and secondary nodes, a set of secondary secondary nodes of the project information tree is constructed using a spatial nearest neighbor algorithm, including:

[0122] For each project instance in the set of primary and secondary nodes, a next-level association data sequence is generated sequentially, including: obtaining the starting point of the coordinate point set corresponding to the current project instance as the current reference point; judging the proximity relationship between the current reference point and the coordinate point set corresponding to each project instance in the subset of associated project instances based on the spatial nearest neighbor algorithm and the preset nearest neighbor length; filtering out project instances that satisfy the nearest neighbor relationship with the current reference point; using the preset nearest neighbor length as a fixed step size; obtaining the next coordinate point that intersects the current project instance's coordinate point set with the circle with the current reference point as the center and the preset nearest neighbor length as the radius; similarly, filtering out project instances that satisfy the nearest neighbor relationship with the next current reference point; and so on, until there are no coordinate points that intersect with the circle; then, taking the last coordinate point in the coordinate point set corresponding to the current project instance as the next current reference point; finally, filtering out all project instances that satisfy the nearest neighbor relationship with the current project instance; and generating the next-level association data sequence of the current project instance based on all project instances that satisfy the nearest neighbor relationship with the current project instance.

[0123] The next-level relationship data sequence set is constructed based on the next-level relationship data sequence of all project instances in the main and subordinate node set;

[0124] The set of secondary subordinate nodes is formed by the set of data sequences of the next level of association and the set of data sequences of station number information.

[0125] In one embodiment, an engineering information tree model for irrigation district engineering is constructed based on the key node set, primary and secondary node set, secondary secondary node set, and segment sequence set of the engineering information tree.

[0126] The advantages of this invention compared to existing technologies are:

[0127] 1. By integrating the upstream and downstream, water flow direction, and correlation characteristics of irrigation district projects, the topological structure of irrigation district project information becomes more comprehensive, more intuitive, and the topological relationships are clearer and easier to maintain;

[0128] 2. By integrating GIS features into automated irrigation district engineering information modeling, the networking of irrigation district projects, the operation and management of engineering information, and the daily maintenance of projects become faster and more efficient, reducing the waste of manpower.

[0129] 3. By establishing an irrigation district engineering relationship model consistent with actual geographical features, the irrigation district can more scientifically and efficiently grasp dynamic information of the water network, water resource utilization information, and geographical feature information in terms of engineering utilization management and water resource scheduling management, thus supporting the timeliness and accuracy of water resource forecasting and decision-making.

[0130] 4. By integrating the segmented characteristics of irrigation district projects, the system provides data support and systematic means for the projects to be compatible with project scale, flexibly scheduled, and collaboratively managed, thereby improving the adaptability of project information management.

[0131] The above description is only a preferred embodiment of the present invention. It should be noted that for those skilled in the art, several improvements and modifications can be made without departing from the technical principles of the present invention, and these improvements and modifications should also be considered within the scope of protection of the present invention.

Claims

1. A method for modeling an engineering information tree model of a digital irrigation district, characterized in that, include: Obtain the irrigation district project dataset, which includes basic project information and geographical information. The geographical information includes the coordinate point set of the project. The irrigation district engineering dataset is encoded to obtain encoded data; The coded data is subjected to feature extraction of Heyuan Estuary engineering type, resulting in a set of Heyuan Estuary engineering instance subsets. Based on the set of Heyuan Estuary engineering instance subsets, a set of key nodes of the engineering information tree is constructed using a spatial intersection algorithm and a recursive depth-first traversal algorithm. Engineering relationship features are extracted from the coded data to obtain a subset of associated engineering instances. Based on the subset of associated engineering instances and the set of key nodes, a set of main and auxiliary nodes of the engineering information tree is constructed using the spatial nearest neighbor algorithm and the shortest distance point algorithm. The engineering relationship features include the relationship between engineering projects and the station number information of the engineering projects. Based on the subset of associated project instances and the set of primary and secondary nodes, construct the set of secondary secondary nodes of the project information tree using the spatial nearest neighbor algorithm; Construct an engineering information tree model for the irrigation district project based on the key node set, primary and secondary node set, and secondary node set of the engineering information tree; The coded data is subjected to feature extraction of Heyuan Estuary engineering type, resulting in a subset of Heyuan Estuary engineering instances, including: Extract a subset of channel engineering instances from the coded data; Extract a subset of river engineering instances from the coded data; Extract a subset of lake engineering instances from the coded data; Extract a subset of reservoir project instances from the coded data; Construct a set of river source and estuary engineering instance subsets based on the subsets of canal engineering instances, river engineering instances, lake engineering instances, and reservoir engineering instances; Based on a subset of engineering examples from the Heyuan estuary, a set of key nodes for constructing an engineering information tree using a spatial intersection algorithm is generated, including: For each channel engineering instance in the subset of channel engineering instances, a channel source engineering sequence and a channel estuary engineering sequence are generated sequentially. This includes: obtaining the starting point of the coordinate point set corresponding to the current channel engineering instance; using the Euclidean distance formula in GIS to determine whether the starting point intersects with the coordinate point sets of the remaining channel engineering instances in the subset of channel engineering instances, the coordinate point sets of the remaining river engineering instances in the subset of river engineering instances, the coordinate point sets of the remaining lake engineering instances in the subset of lake engineering instances, and the coordinate point sets of the remaining reservoir engineering instances in the subset of reservoir engineering instances. If they intersect, the current channel engineering instance is generated based on the engineering instances corresponding to all points intersecting with the starting point. For the channel source engineering sequence of the instance, obtain the termination point of the coordinate point set corresponding to the current channel engineering instance, and call the Euclidean distance formula in GIS to determine whether the termination point intersects with the coordinate point sets of the remaining channel engineering instances in the channel engineering instance subset, the coordinate point sets of the river engineering instances in the river engineering instance subset, the coordinate point sets of the lake engineering instances in the lake engineering instance subset, and the coordinate point sets of the reservoir engineering instances in the reservoir engineering instance subset. If they intersect, generate the channel estuary engineering sequence based on the engineering instances corresponding to all points intersecting with the termination point, and generate the channel source estuary engineering sequence based on the channel source engineering sequence and the channel estuary engineering sequence. Similarly, for each river engineering instance in the subset of river engineering instances, a river source engineering sequence and a river estuary engineering sequence are generated sequentially, and then the river source estuary engineering sequence is obtained. Similarly, for each lake engineering instance in the subset of lake engineering instances, a sequence of lake source engineering sequences and a sequence of lake estuary engineering sequences are generated sequentially, and then the sequence of lake source estuary engineering sequences is obtained. Similarly, for each reservoir project instance in the subset of reservoir project instances, a reservoir source project sequence and a reservoir estuary project sequence are generated sequentially, and then the reservoir source estuary project sequence is obtained. Construct a set of river source and estuary engineering sequences based on the sequences of canal river source and estuary engineering projects, river river source and estuary engineering projects, lake river source and estuary engineering projects, and reservoir river source and estuary engineering projects; Convert the set of river source and estuary sequences into a directed graph of engineering relationships; Based on a recursive depth-first traversal algorithm, the directed graph of engineering relationships is modeled according to the opposite direction of the river mouth, and the set of key nodes of the engineering information tree is output. Each key node in the set corresponds to an engineering instance. Based on the subset of associated project instances and the set of key nodes, a set of primary and secondary nodes for the project information tree is constructed using spatial nearest neighbor and shortest distance point algorithms, including: For each engineering instance in the key node set, a sequence of associated relationship data is generated, including: obtaining the starting point of the coordinate point set corresponding to the current engineering instance as the current reference point; judging the proximity relationship between the current reference point and the coordinate point set corresponding to each engineering instance in the associated engineering instance subset set based on the spatial nearest neighbor algorithm and the preset nearest neighbor length; filtering out engineering instances that satisfy the proximity relationship with the current reference point; using the preset nearest neighbor length as a fixed step size; obtaining the next coordinate point that intersects the current engineering instance's coordinate point set with the circle with the current reference point as the center and the preset nearest neighbor length as the radius; similarly, filtering out engineering instances that satisfy the proximity relationship with the next current reference point; and so on, until there are no coordinate points that intersect with the circle; then, taking the last coordinate point in the coordinate point set corresponding to the current engineering instance as the next current reference point; finally, filtering out all engineering instances that satisfy the proximity relationship with the current engineering instance; and generating the associated relationship data sequence of the current engineering instance based on all engineering instances that satisfy the proximity relationship with the current engineering instance. A set of association relationship data sequences is constructed based on the association relationship data sequences of all engineering instances in the set of key nodes; Simultaneously, for each engineering instance in the key node set, a chainage information data sequence is generated sequentially, including: for each current reference point of the current engineering instance, the Euclidean distance formula in GIS is called to calculate the distance between the current reference point and the coordinate point set corresponding to all engineering instances in the associated data sequence, and the calculation results are sorted. The shortest distance after sorting is used as the basis to obtain the coordinate point with the shortest distance relative to the current reference point in the coordinate point set corresponding to all engineering instances in the associated data sequence. The curve length of the shortest distance coordinate point relative to the starting point of the coordinate point set of the current engineering instance is converted according to the preset chainage format to generate the chainage information associated with the current reference point. This process is repeated until all chainage information associated with the current engineering instance is generated, and a chainage information data sequence is generated based on all chainage information associated with the current engineering instance. A set of station number information data sequences is constructed based on the station number information data sequences of all engineering instances in the set of key nodes; Construct a set of primary and secondary nodes based on the set of association relationship data sequences and the set of station number information data sequences; Based on the subset of associated project instances and the set of primary and secondary nodes, a set of secondary secondary nodes for constructing the project information tree is built using the spatial nearest neighbor algorithm, including: For each project instance in the set of primary and secondary nodes, a next-level association data sequence is generated sequentially, including: obtaining the starting point of the coordinate point set corresponding to the current project instance as the current reference point; judging the proximity relationship between the current reference point and the coordinate point set corresponding to each project instance in the subset of associated project instances based on the spatial nearest neighbor algorithm and the preset nearest neighbor length; filtering out project instances that satisfy the nearest neighbor relationship with the current reference point; using the preset nearest neighbor length as a fixed step size; obtaining the next coordinate point that intersects the current project instance's coordinate point set with the circle with the current reference point as the center and the preset nearest neighbor length as the radius; similarly, filtering out project instances that satisfy the nearest neighbor relationship with the next current reference point; and so on, until there are no coordinate points that intersect with the circle; then, taking the last coordinate point in the coordinate point set corresponding to the current project instance as the next current reference point; finally, filtering out all project instances that satisfy the nearest neighbor relationship with the current project instance; and generating the next-level association data sequence of the current project instance based on all project instances that satisfy the nearest neighbor relationship with the current project instance. The next-level relationship data sequence set is constructed based on the next-level relationship data sequence of all project instances in the main and subordinate node set; The set of secondary subordinate nodes is formed by the set of data sequences of the next level of association and the set of data sequences of station number information.

2. The method for modeling an engineering information tree model of a digital irrigation district according to claim 1, characterized in that, Obtain the irrigation district project dataset, including: Obtain basic project information, including project name, type, structure, management unit, and administrative region; Obtain engineering geographic information, including the longitude and latitude information of the project.

3. The method for modeling an engineering information tree model of a digital irrigation district according to claim 1, characterized in that, The irrigation district project dataset is uniformly encoded to obtain encoded data, including: The first coded data is obtained by sequentially assigning the coding length and number of bits to the irrigation district engineering dataset; The final encoded data is obtained by assigning project type subcode, project area subcode, project level subcode, and quantity subcode to the first encoded data.

4. The method for modeling an engineering information tree model of a digital irrigation district according to claim 1, characterized in that, When the critical node is a multi-source node, the flow parameters of all source nodes of the critical node are sorted, and the source node with the largest flow parameter is set as the main source of the multi-source node and assigned a corresponding main source identifier. The remaining source nodes are set as the subordinate sources of the multi-source node and assigned corresponding subordinate source identifiers. Among them, the critical node pointed to by multiple source nodes is the multi-source node.

5. The method for modeling an engineering information tree model of a digital irrigation district according to claim 1, characterized in that, It also includes a set of segmented sequences of key nodes constructed based on the ring region intersection algorithm, including: The circular region intersection algorithm generates a segmented sequence for each engineering instance in the key node set according to the sequence. Specifically, a sequence of ring regions is pre-defined, which includes several ring regions. Each ring region includes a set of coordinate points. The Euclidean distance formula in GIS is called to sequentially determine whether each coordinate point in the coordinate point set corresponding to the engineering instance of the key node set intersects with each ring region. If they intersect, the coordinates of the two points where the coordinate point set corresponding to the engineering instance intersects with the corresponding ring region are obtained. Based on the coordinates of the two intersection points and the direction of the coordinate point set corresponding to the engineering instance, the starting and ending points of the corresponding ring region segment are determined. This process is repeated to obtain the starting and ending points of all ring region segments. A segmentation sequence is generated based on the starting and ending points of all ring region segments. Construct a set of segmented sequences of the key node set based on the segmented sequences of all project instances in the key node set.

6. A system for modeling an engineering information tree model of a digital irrigation district as described in any one of claims 1-5, characterized in that, include: The acquisition module is used to acquire irrigation district project dataset, which includes basic project information and geographical information of the project, including a set of coordinate points of the project. The encoding module is used to encode the irrigation district engineering dataset to obtain encoded data; The first construction module is used to extract the characteristics of Heyuan River Estuary engineering types from the encoded data to obtain a set of Heyuan River Estuary engineering instance subsets. Based on the set of Heyuan River Estuary engineering instance subsets, a set of key nodes of the engineering information tree is constructed using the spatial intersection algorithm. The second construction module is used to extract engineering relationship features from the encoded data to obtain a subset of associated engineering instances. Based on the subset of associated engineering instances and the set of key nodes, the main and auxiliary node set of the engineering information tree is constructed using the spatial nearest neighbor algorithm and the shortest distance point algorithm. The engineering relationship features include the relationship between engineering projects and the station number information of the engineering projects. The third construction module is used to construct a set of secondary subordinate nodes of the project information tree based on the spatial nearest neighbor algorithm, according to the set of subsets of associated project instances and the set of primary and secondary nodes. The modeling module is used to construct an engineering information tree model of the irrigation area project based on the key node set, main auxiliary node set, and secondary auxiliary node set of the engineering information tree. The coded data is subjected to feature extraction of Heyuan Estuary engineering type, resulting in a subset of Heyuan Estuary engineering instances, including: Extract a subset of channel engineering instances from the coded data; Extract a subset of river engineering instances from the coded data; Extract a subset of lake engineering instances from the coded data; Extract a subset of reservoir project instances from the coded data; Construct a set of river source and estuary engineering instance subsets based on the subsets of canal engineering instances, river engineering instances, lake engineering instances, and reservoir engineering instances; Based on a subset of engineering examples from the Heyuan estuary, a set of key nodes for constructing an engineering information tree using a spatial intersection algorithm is generated, including: For each channel engineering instance in the subset of channel engineering instances, a channel source engineering sequence and a channel estuary engineering sequence are generated sequentially. This includes: obtaining the starting point of the coordinate point set corresponding to the current channel engineering instance; using the Euclidean distance formula in GIS to determine whether the starting point intersects with the coordinate point sets of the remaining channel engineering instances in the subset of channel engineering instances, the coordinate point sets of the remaining river engineering instances in the subset of river engineering instances, the coordinate point sets of the remaining lake engineering instances in the subset of lake engineering instances, and the coordinate point sets of the remaining reservoir engineering instances in the subset of reservoir engineering instances. If they intersect, the current channel engineering instance is generated based on the engineering instances corresponding to all points intersecting with the starting point. For the channel source engineering sequence of the instance, obtain the termination point of the coordinate point set corresponding to the current channel engineering instance, and call the Euclidean distance formula in GIS to determine whether the termination point intersects with the coordinate point sets of the remaining channel engineering instances in the channel engineering instance subset, the coordinate point sets of the river engineering instances in the river engineering instance subset, the coordinate point sets of the lake engineering instances in the lake engineering instance subset, and the coordinate point sets of the reservoir engineering instances in the reservoir engineering instance subset. If they intersect, generate the channel estuary engineering sequence based on the engineering instances corresponding to all points intersecting with the termination point, and generate the channel source estuary engineering sequence based on the channel source engineering sequence and the channel estuary engineering sequence. Similarly, for each river engineering instance in the subset of river engineering instances, a river source engineering sequence and a river estuary engineering sequence are generated sequentially, and then the river source estuary engineering sequence is obtained. Similarly, for each lake engineering instance in the subset of lake engineering instances, a sequence of lake source engineering sequences and a sequence of lake estuary engineering sequences are generated sequentially, and then the sequence of lake source estuary engineering sequences is obtained. Similarly, for each reservoir project instance in the subset of reservoir project instances, a reservoir source project sequence and a reservoir estuary project sequence are generated sequentially, and then the reservoir source estuary project sequence is obtained. Construct a set of river source and estuary engineering sequences based on the sequences of canal river source and estuary engineering projects, river river source and estuary engineering projects, lake river source and estuary engineering projects, and reservoir river source and estuary engineering projects; Convert the set of river source and estuary sequences into a directed graph of engineering relationships; Based on a recursive depth-first traversal algorithm, the directed graph of engineering relationships is modeled according to the opposite direction of the river mouth, and the set of key nodes of the engineering information tree is output. Each key node in the set corresponds to an engineering instance. Based on the subset of associated project instances and the set of key nodes, a set of primary and secondary nodes for the project information tree is constructed using spatial nearest neighbor and shortest distance point algorithms, including: For each engineering instance in the key node set, a sequence of associated relationship data is generated, including: obtaining the starting point of the coordinate point set corresponding to the current engineering instance as the current reference point; judging the proximity relationship between the current reference point and the coordinate point set corresponding to each engineering instance in the associated engineering instance subset set based on the spatial nearest neighbor algorithm and the preset nearest neighbor length; filtering out engineering instances that satisfy the proximity relationship with the current reference point; using the preset nearest neighbor length as a fixed step size; obtaining the next coordinate point that intersects the current engineering instance's coordinate point set with the circle with the current reference point as the center and the preset nearest neighbor length as the radius; similarly, filtering out engineering instances that satisfy the proximity relationship with the next current reference point; and so on, until there are no coordinate points that intersect with the circle; then, taking the last coordinate point in the coordinate point set corresponding to the current engineering instance as the next current reference point; finally, filtering out all engineering instances that satisfy the proximity relationship with the current engineering instance; and generating the associated relationship data sequence of the current engineering instance based on all engineering instances that satisfy the proximity relationship with the current engineering instance. A set of association relationship data sequences is constructed based on the association relationship data sequences of all engineering instances in the set of key nodes; Simultaneously, for each engineering instance in the key node set, a chainage information data sequence is generated sequentially, including: for each current reference point of the current engineering instance, the Euclidean distance formula in GIS is called to calculate the distance between the current reference point and the coordinate point set corresponding to all engineering instances in the associated data sequence, and the calculation results are sorted. The shortest distance after sorting is used as the basis to obtain the coordinate point with the shortest distance relative to the current reference point in the coordinate point set corresponding to all engineering instances in the associated data sequence. The curve length of the shortest distance coordinate point relative to the starting point of the coordinate point set of the current engineering instance is converted according to the preset chainage format to generate the chainage information associated with the current reference point. This process is repeated until all chainage information associated with the current engineering instance is generated, and a chainage information data sequence is generated based on all chainage information associated with the current engineering instance. A set of station number information data sequences is constructed based on the station number information data sequences of all engineering instances in the set of key nodes; Construct a set of primary and secondary nodes based on the set of association relationship data sequences and the set of station number information data sequences; Based on the subset of associated project instances and the set of primary and secondary nodes, a set of secondary secondary nodes for constructing the project information tree using the spatial nearest neighbor algorithm is constructed, including: For each project instance in the set of primary and secondary nodes, a next-level association data sequence is generated sequentially, including: obtaining the starting point of the coordinate point set corresponding to the current project instance as the current reference point; judging the proximity relationship between the current reference point and the coordinate point set corresponding to each project instance in the subset of associated project instances based on the spatial nearest neighbor algorithm and the preset nearest neighbor length; filtering out project instances that satisfy the nearest neighbor relationship with the current reference point; using the preset nearest neighbor length as a fixed step size; obtaining the next coordinate point that intersects the current project instance's coordinate point set with the circle with the current reference point as the center and the preset nearest neighbor length as the radius; similarly, filtering out project instances that satisfy the nearest neighbor relationship with the next current reference point; and so on, until there are no coordinate points that intersect with the circle; then, taking the last coordinate point in the coordinate point set corresponding to the current project instance as the next current reference point; finally, filtering out all project instances that satisfy the nearest neighbor relationship with the current project instance; and generating the next-level association data sequence of the current project instance based on all project instances that satisfy the nearest neighbor relationship with the current project instance. The next-level relationship data sequence set is constructed based on the next-level relationship data sequence of all project instances in the main and subordinate node set; The set of secondary subordinate nodes is formed by the set of data sequences of the next level of association and the set of data sequences of station number information.

Images