CN-122019510-A - Automatic grading and polymorphic parameter calculation method for coastal wetland tidal ditch network

CN122019510ACN 122019510 ACN122019510 ACN 122019510ACN-122019510-A

Abstract

The application discloses an automatic grading and polymorphic parameter calculation method for a tidal canal network of a coastal wetland, which relates to the technical field of data processing and comprises the steps of obtaining SHP format files of edge points of the tidal canal network of the coastal wetland; the SHP format file comprises two-dimensional coordinates and basic attribute information of tide and ditch edge points, a tide and ditch central line is generated according to each tide and ditch edge point in the SHP format file, a topology tree is generated according to the tide and ditch central line and each tide and ditch edge point, the tide and ditch are identified in a grading mode according to the topology tree, the tide and ditch obtained through identification are stored in a structuring mode according to the level, structuring data of the tide and ditch are obtained, and various morphological parameters of the tide and ditch are calculated according to the structuring data. The method takes the SHP format file as the unique input, classifies and stores the tidal channel based on the SHP format file in a structured way, then calculates the morphological parameters of the tidal channel, and can realize the high efficiency, the precision and the practicability of the morphological data processing of the tidal channel.

Inventors

ZHU ZHENCHANG
JIANG ZHITONG
ZHU QIN
GAO WEILUN
MENG JINLU
ZHOU QIAN
YANG ZHIFENG

Assignees

南方海洋科学与工程广东省实验室(广州)

Dates

Publication Date: 20260512
Application Date: 20260311

Claims (10)

1. The method for automatically classifying and calculating the polymorphic parameters of the coastal wetland tidal channel network is characterized by comprising the following steps of: the method comprises the steps of obtaining an SHP format file of a tidal ditch network edge point of the coastal wetland, wherein the SHP format file comprises two-dimensional coordinates and basic attribute information of the tidal ditch edge point; Generating a tidal channel center line according to each tidal channel edge point in the SHP format file; Generating a topology tree according to the tide ditch central line and each tide ditch edge point; Classifying and identifying the tide grooves according to the topological tree, and carrying out structured storage on the identified tide grooves according to the class to obtain structured data of the tide grooves; and calculating various morphological parameters of the tidal channel according to the structured data.
2. The method for automatically grading and calculating parameters of a tidal channel network of a coastal wetland according to claim 1, wherein generating a tidal channel center line according to each tidal channel edge point in the SHP format file comprises the following steps: responding to the selection operation of an operator in the visual interface according to the actual sea-entering position of the tide channel, and selecting the midpoint of the sea-entering position of the tide channel as a root node; The root node is used as a starting point, the root node is pushed to the direction of the inner side of a tidal channel, two tidal channel edge points with the nearest current section distance are selected according to a preset interval, and then the midpoint coordinates of the two tidal channel edge points are calculated and recorded in sequence according to the generation sequence; When four tide ditch edge points are identified and correspond to two side edges of two branches, judging as a branch road, adopting a depth priority principle, traversing one branch to the tail end completely, returning to a branch road position, traversing the other branch, connecting all middle points in series according to the traversing sequence to form the tide ditch central line comprising a main trunk and each level of branches, and synchronously recording the generation sequence index of each middle point.
3. The method for automatically grading and calculating parameters of a tidal ditch network of a coastal wetland according to claim 1, wherein the topology tree is generated according to the tidal ditch center line and each tidal ditch edge point, and the method comprises the following steps: Traversing all midpoints in the central line of the tidal channel, counting the number of tidal channel line segments connected with each midpoint, and taking the number of the tidal channel line segments as the degree of the points; Determining a root node, a bifurcation point, an end point and a common point according to the degree of the point; The method comprises the steps of starting from a root node, performing forward traversal by adopting a left priority order, firstly, completely traversing a branch to an end point, then returning to the nearest bifurcation point, and continuously traversing the unfinished branch, generating a node connection relation table in the traversal process, recording the upper node index, the subordinate node index, the associated line segment index and the degree of the point of each node, simultaneously generating a line segment index table, and recording the starting point index, the end point index, the included common point coordinates and the generation order of each line segment; And forming the topology tree with the root node as the top based on the node connection relation table.
4. A method for automatically classifying and calculating parameters of a tidal channel network of a coastal wetland according to claim 3, wherein the steps of classifying and identifying the tidal channels according to the topological tree and structuring and storing the identified tidal channels according to the class to obtain structured data of the tidal channels comprise the following steps: The method comprises the steps of presetting five groups of hierarchical two-dimensional arrays which correspond to one-level to five-level tidal ditches respectively, wherein each row of each group of arrays stores all point coordinates of one same-level tidal ditch, and the sequence and the traversing sequence are kept consistent; presetting five groups of bifurcation point arrays, which respectively correspond to one-level to five-level tidal ditches, wherein each row of each group of arrays stores bifurcation point coordinates, point degrees and associated line segment indexes of a corresponding level; initializing a global grading counter for counting the number of each level of tide channels, and initializing a branch grade recording table for recording the tide channel grade of all branches subordinate to each node; Forward traversing to a first end point, marking the end point as a stable state, classifying the end point as one stage, and recording the end point into a branch level record table; traversing upwards along the direction from the tail end point to the root node, classifying the line segments formed by the tail end point and the common points along the way into one stage, sequentially storing the one-stage tidal channel two-dimensional array, and correspondingly increasing the number of the one-stage tidal channels in the global hierarchical counter; When all subordinate branches of any node are the same level tidal channel, the upper line segment corresponding to the corresponding node is classified into subordinate level to be promoted by one level, the point coordinates of the high level tidal channel are stored into a classified two-dimensional array of the corresponding level, the number of the corresponding level in the global classified counter is correspondingly increased, the coordinates of the corresponding node, the degree of the point and the index of the associated line segment are stored into a branch point array of the corresponding level, the above steps are repeated upwards until the root node is reached, the judgment and storage of all level tidal channels are completed, and if five levels are reached, the classification is terminated.
5. The method for automatically grading and calculating polymorphic parameters of a tidal channel network of a coastal wetland according to claim 1, wherein the calculating of the morphological parameters of the tidal channel according to the structured data comprises the following steps: and calculating basic parameters, curvature parameters, density and bifurcation rate of the tidal channel as the morphological parameters according to the structured data.
6. The method for automatically classifying and calculating parameters of a multi-morphology of a tidal ditch network of a coastal wetland according to claim 4, wherein the method further comprises the steps of: And converting all the morphological parameters into compatible files of hydrologic and geomorphic coupling simulation software.
7. The method for automatically grading and calculating polymorphic parameters of the tidal current network of the coastal wetland according to claim 6, wherein the step of converting all the morphological parameters into compatible files of hydrologic and geomorphic coupling simulation software comprises the steps of: Based on the hierarchical two-dimensional array and the bifurcation point array, the data coding and format conversion are completed according to the Bohr file format specification of the Delff three-dimensional software, and the method specifically comprises the following steps: Extracting point coordinates of all tidal furrows in the hierarchical two-dimensional array, including common points and nodes, and reserving two decimal places according to the coordinate precision required by Delff three-dimensional requirements for standardization processing; associating the grade of each tide ditch with the association relation of bifurcation points, and organizing data according to the structural requirements of the Bohr file; and generating a Bohr file.
8. An automatic grading and polymorphic parameter calculating device for a tidal ditch network of a coastal wetland, which is characterized by comprising: The system comprises a data acquisition unit, a data processing unit and a data processing unit, wherein the data acquisition unit is used for acquiring an SHP format file of a tidal channel network edge point of the coastal wetland, and the SHP format file comprises two-dimensional coordinates and basic attribute information of the tidal channel edge point; a central line generating unit, configured to generate a tidal channel central line according to each tidal channel edge point in the SHP format file; A topology tree generation unit, configured to generate a topology tree according to the tidal channel center line and each tidal channel edge point; the structured storage unit is used for classifying and identifying the tide grooves according to the topological tree and carrying out structured storage on the tide grooves obtained by identification according to the class to obtain structured data of the tide grooves; and the parameter calculation unit is used for calculating various morphological parameters of the tidal channel according to the structural data.
9. An electronic device comprising a processor and a memory; the memory is used for storing programs; The processor executing the program implements the method of any one of claims 1 to 7.
10. A computer-readable storage medium, characterized in that the storage medium stores a program that is executed by a processor to implement the method of any one of claims 1 to 7.

Description

Automatic grading and polymorphic parameter calculation method for coastal wetland tidal ditch network Technical Field The application relates to the technical field of data processing, in particular to a coastal wetland tidal channel network automatic grading and polymorphic parameter calculating method. Background The coastal wetland is a special ecological system formed by land and ocean interaction, has important functions of ecological regulation, carbon sink storage and the like, and is a key component of a global ecological safety pattern. The tidal ditch network is used as a core hydrologic corridor inside the coastal wetland and consists of main tidal ditches, branches and junction points at all levels, the morphological characteristics of the tidal ditch network directly influence the hydrologic communication efficiency, the material transportation process and the organic carbon burial potential of the wetland, and the tidal ditch network is also a basic data support for coastal wetland landform evolution simulation, ecological protection planning and engineering design. At present, vector data (mostly in SHP format) of the tide ditch edge points can be obtained through the technical means of remote sensing image interpretation, field measurement and the like, and the data is a core basis of the subsequent tide ditch morphological analysis. However, for the subsequent processing technology of the SHP format edge point data, a complete integrated solution is not formed yet, and the related technology is still dispersed in three independent links, so that obvious limitations exist. Disclosure of Invention In view of the above, the embodiments of the present application provide a method and related equipment for automatically classifying and calculating parameters of a tidal channel network of a coastal wetland, so as to accurately classify the tidal channel and improve the calculation efficiency of the morphological parameters of the tidal channel. An aspect of the embodiment of the application provides a method for automatically classifying and calculating polymorphic parameters of a tidal channel network of a coastal wetland, which comprises the following steps: the method comprises the steps of obtaining an SHP format file of a tidal ditch network edge point of the coastal wetland, wherein the SHP format file comprises two-dimensional coordinates and basic attribute information of the tidal ditch edge point; Generating a tidal channel center line according to each tidal channel edge point in the SHP format file; Generating a topology tree according to the tide ditch central line and each tide ditch edge point; Classifying and identifying the tide grooves according to the topological tree, and carrying out structured storage on the identified tide grooves according to the class to obtain structured data of the tide grooves; and calculating various morphological parameters of the tidal channel according to the structured data. In some embodiments, the generating a tidal channel centerline from each of the tidal channel edge points in the SHP format file includes the steps of: responding to the selection operation of an operator in the visual interface according to the actual sea-entering position of the tide channel, and selecting the midpoint of the sea-entering position of the tide channel as a root node; The root node is used as a starting point, the root node is pushed to the direction of the inner side of a tidal channel, two tidal channel edge points with the nearest current section distance are selected according to a preset interval, and then the midpoint coordinates of the two tidal channel edge points are calculated and recorded in sequence according to the generation sequence; When four tide ditch edge points are identified and correspond to two side edges of two branches, judging as a branch road, adopting a depth priority principle, traversing one branch to the tail end completely, returning to a branch road position, traversing the other branch, connecting all middle points in series according to the traversing sequence to form the tide ditch central line comprising a main trunk and each level of branches, and synchronously recording the generation sequence index of each middle point. In some embodiments, the generating a topology tree from the tidal channel centerline and each of the tidal channel edge points comprises the steps of: Traversing all midpoints in the central line of the tidal channel, counting the number of tidal channel line segments connected with each midpoint, and taking the number of the tidal channel line segments as the degree of the points; Determining a root node, a bifurcation point, an end point and a common point according to the degree of the point; The method comprises the steps of starting from a root node, performing forward traversal by adopting a left priority order, firstly, completely traversing a branch to an end point, then returning to the nearest