A natural resource registration unit pre-planning method

Abstract

A natural resource registration unit pre-delineation method, comprising the following steps: step S1, data preparation: collecting natural resource ownership information, vectorizing the ownership information to obtain natural resource ownership small patch data; step S2, setting the small patch search range and step length change value according to the spatial position and distribution of the ownership small patch; step S3, searching according to the set search range, and performing aggregation analysis on the aggregation conditions to form a concentrated and contiguous aggregation result; step S4, eliminating the holes in the aggregation result; step S5, cyclically executing steps S2 to S4 to obtain the registration unit pre-delineation result of different search ranges. The present application takes the ownership information as the basis, vectorizes it into ownership small patches, inputs the natural resource basic data, sets the search range and step length change value, and can realize the automatic pre-delineation of multiple natural resource registration units, and provides data auxiliary support decision and multi-unit comparison application analysis for the final delineation of natural resource registration units.

Description

Technical Field

[0001] This invention relates to geographic information data spatial processing and analysis technology, and in particular to a method for pre-delineating natural resource registration units. Background Technology

[0002] The unified registration of natural resource ownership will uniformly register the ownership of all natural ecological spaces, including watercourses, forests, mountains, grasslands, wastelands, tidal flats, and wetlands. This will clarify the ownership of various natural resources in the national territory, delineate the boundaries of resources held by different rights holders, and promote the establishment of a natural resource asset ownership system with clear ownership, well-defined rights and responsibilities, and effective supervision.

[0003] Regarding research on methods for pre-delineating natural resource registration units, in 2020, Du Na et al. proposed a classification system for natural resources and, based on practice, refined the methods for unit delineation. In the same year, Han Yaowen, based on the current land use status, referenced village boundaries determined by cadastral areas and sub-cadastral areas, as well as the boundary line of the Qilian Mountains Nature Reserve, and revised the initially delineated boundaries of natural resource registration units by combining the ownership and use rights boundaries of natural resources within the registration unit. In 2021, Wang Guohua et al. comprehensively delineated registration units based on the largest management or protection approval boundary line extracted from multiple nature reserves, resolving the problem of overlapping registration units in the Lushan area. Also in 2021, Xu Yunhe et al., based on the data from the Third National Land Survey, considered the order of natural resource registration unit delineation and combined original imagery and basic farmland data to delineate registration units. The above studies all focus on the principles of delineating registration units and drawing boundaries of registration units by combining various data. Although there are research methods for automatically delineating registration units, they do not consider the ownership of natural resources. Therefore, it is of great significance to conduct research on a method for pre-delineating natural resource registration units based on ownership. Summary of the Invention

[0004] The main objective of this invention is to propose a method for pre-delineating natural resource registration units, thereby enabling automatic pre-delineation of natural resource registration units and addressing the aforementioned technical problems.

[0005] To achieve the above objectives, this invention proposes a method for pre-delineating natural resource registration units, comprising the following steps:

[0006] Step S1, Data Preparation: Collect natural resource ownership data and vectorize the ownership data to obtain natural resource ownership small patch data;

[0007] Step S2: Based on the spatial location and distribution of the ownership spots, set the search range and step size variation value for the spots;

[0008] Step S3: Search according to the set search range, perform aggregation analysis on those that meet the aggregation conditions, and form a concentrated and contiguous aggregation result;

[0009] Step S4: Eliminate the pores inside the polymerization result;

[0010] Step S5: Repeat steps S2 to S4 to obtain the pre-delineation results of registration units with different search ranges.

[0011] Preferably, in step S3, during the aggregation analysis, parameters are set for the aggregation function, including:

[0012] Input data is used to input surface features for aggregation functions;

[0013] Output data, used to output the aggregated result feature layer;

[0014] Aggregate distance, used to set the maximum distance at which aggregate functions can be executed;

[0015] Minimum area is used to limit the area of ​​elements following aggregation to be greater than or equal to the set minimum area;

[0016] Minimum hole size, used to limit the area of ​​holes inside features after aggregation to be greater than or equal to the set value;

[0017] Obstacle elements are used to restrict whether input surface elements can cross obstacles; they can be line elements or surface elements.

[0018] Preferably, when the distance between the boundaries of polygon features in the input layer is less than the aggregation distance, the boundary features of the aggregated features will be preserved. Where the distance between the boundaries is less than the aggregation distance, a connecting line will be generated to aggregate the polygon features. If two polygon features are collinear, they will be merged into a single outermost contour polygon feature.

[0019] Preferably, in step S3, the aggregation execution process during aggregation analysis includes the following:

[0020] The polygon features are rotated according to their inflection points, and the distance between the polygon feature outlines is calculated. By traversing the outline points between polygon features, the distance between all polygon feature outline points is calculated. If the polygon feature outline distance is less than the aggregation distance, the polygon features are aggregated first, and then the aggregated polygon features are judged to have an area greater than or equal to the minimum area. At the same time, the area of ​​the holes formed by the aggregated features is calculated and judged to have an area greater than or equal to the minimum hole size. When no obstacle features are set, and the area of ​​the aggregated polygon features is greater than or equal to the minimum area and the area of ​​the aggregated polygon features is greater than or equal to the minimum hole size, the aggregation function is executed to aggregate the polygon features.

[0021] Preferably, the distance between the contours of surface features is calculated using the following point distance formula:

[0022]

[0023] In the formula: x1 and y1 are the coordinates of point A1 of surface feature A, x2 and y2 are the coordinates of point B1 of surface feature B, and d is the distance between surface feature contours.

[0024] Preferably, when calculating the area of ​​aggregated surface features, the surface features are represented by polygonal features formed by their contour points, and the trapezoidal method after discrete point projection is used for calculation.

[0025] Preferably, when the aggregate surface element contains holes, the outer ring area and the inner ring area are calculated separately when calculating the area, wherein the inner ring area is the area of ​​the holes, and the aggregate surface element area is the outer ring area minus the inner ring area.

[0026] Preferably, if obstacle features are set, when calculating the aggregation distance, if the aggregation conditions are met, points A(x1, y1) and B(x2, y2) between the surface feature outlines are connected into a line. The spatial position relationship is used to determine whether the outline of the aggregation feature overlaps with the obstacle feature. If there is an overlap, the aggregation operation is not performed; otherwise, the aggregation is performed.

[0027] Preferably, the process for determining whether an aggregated feature crosses an obstacle feature is as follows: Statistical analysis is used to obtain the minimum area of ​​the obstacle surface feature or the minimum distance between discrete points of the obstacle line feature. Combined with the length of the line segment connecting the contour points A(x1, y1) and B(x2, y2) of the input data surface feature, the rasterization size is set, and the obstacle feature and connecting line are converted into raster data. The raster value of the obstacle feature is set to 1, the raster value of the connecting line is set to 2, and no data value is set to 0. Arithmetic operations are performed. If there is a raster value of 3, it means that the connecting line intersects with the obstacle feature, and the aggregation function is not executed; otherwise, the aggregation function is executed.

[0028] Due to the adoption of the above technical solution, the beneficial effects of the present invention are as follows:

[0029] (1) This invention uses ownership data as a basis, vectorizing it into ownership patches. Based on their geographical location and spatial distribution, a search range and step size are set as parameters for the aggregation function. During aggregation, the search range can be restricted. For example, if a region cannot cross administrative boundaries or management areas, its boundary line can be used as a parameter for the aggregation function. Aggregation analysis is performed according to the pre-set search radius to obtain the aggregation analysis results. At this point, some gaps are found in the aggregation results. To fill these gaps, a gap elimination analysis is performed to obtain the pre-delineation results of the registration units. By iterating through the above search range and step size, multiple pre-delineated registration units can be obtained. Using the natural resource registration unit pre-delineation method provided by this invention, as long as natural resource ownership data is input, the search range and step size are set, and the process data and final output location are determined, the pre-delineation of natural resource registration units can be automatically completed. This provides various data support and auxiliary decision analysis for registration unit delineation, effectively improving the efficiency of unified natural resource ownership registration and promoting the management of natural resource ownership registration data and related application analysis.

[0030] (2) This invention, adhering to the principle of contiguous and integrated management while maintaining the integrity of ecological functions, has developed a method for pre-delineating natural resource registration units. Users only need to input basic natural resource data, set the search range and step size, process data, and the final output location of the pre-delineated units to achieve automatic pre-delineation of natural resource registration units, thus lowering the barrier to entry for users. Furthermore, if it is necessary to consider discrete resource data and implement centralized and integrated management, this invention can quickly achieve automatic pre-delineation of management units and related application analysis. Attached Figure Description

[0031] To more clearly illustrate the technical solutions in the embodiments of the present invention or the prior art, the drawings used in the description of the embodiments or the prior art will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present invention. For those skilled in the art, other drawings can be obtained based on the structures shown in these drawings without creative effort.

[0032] Figure 1 A flowchart of the method for pre-delineating natural resource registration units provided by the present invention;

[0033] Figure 2 Example data prepared for the data in the embodiments of the present invention;

[0034] Figure 3 This is example data aggregation in an embodiment of the present invention;

[0035] Figure 4 This is an example polygon of a surface feature used in the calculation of the area of ​​aggregated surface features in this embodiment of the invention;

[0036] Figure 5 This is an example of grid operation in the embodiment of the present invention for determining whether an aggregated element crosses an obstacle element;

[0037] Figure 6 This is example data for eliminating internal holes in surface features in an embodiment of the present invention;

[0038] Figure 7 This is example data showing the results of pre-defined registration units with a search range of 100m obtained in the embodiment;

[0039] Figure 8 This is example data showing the results of pre-defined registration units with a search range of 200m obtained in the embodiment;

[0040] Figure 9 This is example data showing the results of pre-defined registration units with a search range of 300m obtained in the embodiment;

[0041] Figure 10 This is a schematic diagram of the operation interface in an embodiment of the present invention. Detailed Implementation

[0042] 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 a part of the embodiments of the present invention, and not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those of ordinary skill in the art without creative effort are within the scope of protection of the present invention.

[0043] Combination Figure 1 As shown, the method for pre-delineating natural resource registration units provided by the present invention includes the following steps:

[0044] Step S1, Data Preparation: Collect natural resource ownership data and vectorize the ownership data to obtain natural resource ownership small patch data;

[0045] Step S2: Based on the spatial location and distribution of the ownership spots, set the search range and step size variation value for the spots;

[0046] Step S3: Search according to the set search range, perform aggregation analysis on those that meet the aggregation conditions, and form a concentrated and contiguous aggregation result;

[0047] Step S4: Eliminate the pores inside the polymerization result;

[0048] Step S5: Repeat steps S2 to S4 to obtain the pre-delineation results of registration units with different search ranges.

[0049] Specifically, taking a small area of ​​vectorized ownership of a forest farm as an example, the method for pre-delineating natural resource registration units provided by this invention is described in detail, and the main steps are as follows:

[0050] Step S1: Data preparation. In conjunction with the natural resource ownership certificate, collect natural resource ownership data, vectorize the ownership data to obtain natural resource ownership small patch data, and use it as the basic input data for the pre-delineation of natural resource registration units, as shown in Figure 2.

[0051] Step S2, Parameter Settings: Based on the spatial location and distribution of small patches, adhering to the principle of concentrated contiguous areas and maintaining ecological integrity, set the search range and step size for small patches. This will be used to determine the spatial range for the next aggregation analysis of small patch data within the search range. Parameter settings are as follows: Figure 10 As shown.

[0052] Step S3, Aggregation Analysis: By setting parameters and inputting data, a search is performed according to the set search range. Data that meets the aggregation conditions are aggregated to form concentrated and contiguous aggregation results. Example results are shown in Figure 3 when the search range is set to 50m.

[0053] The aggregate function parameters are set as follows:

[0054] Input data: Used to input polygon features for aggregation functions, typically .shp polygon feature vector data.

[0055] Output data: Used to output the aggregated result feature layer, which is generally .shp polygon feature vector data.

[0056] Aggregation Distance: Sets the maximum distance at which aggregation functions can be executed. The unit is typically meters (m). When the distance between the boundaries of polygon features in the input layer is less than the aggregation distance, the boundary features of the aggregated features will be preserved. Where the distance between boundaries is less than the aggregation distance, a connecting line will be generated to aggregate the polygon features. If two polygon features are collinear, they will be merged into a single outermost contour polygon feature. The distance setting must be greater than 0. For example... Figure 10 As shown, the aggregation distance is achieved by setting start and end values ​​and step change values, and executing the aggregation function in a loop to aggregate multiple selectable results.

[0057] Minimum Area: This setting limits the area of ​​features after aggregation to a minimum that must be greater than or equal to the set minimum area. The default value is 0; if the default value is used, all polygon features will be preserved.

[0058] Minimum hole size: This setting limits the area of ​​holes inside features after aggregation to be greater than or equal to the specified value. The default value is 0; if set to the default value, all holes will be preserved.

[0059] Obstacle features: These are used to restrict whether input polygon features can cross obstacles. They are typically line or polygon features. If obstacle features are input, the input features cannot cross the obstacles when aggregate functions are executed.

[0060] The aggregation execution process is as follows:

[0061] 1) Calculate the distance between the contours of surface features.

[0062] First, rotate the polygon features according to their inflection points, and then calculate the distance between the polygon feature outlines using the following point distance formula:

[0063]

[0064] In the formula: x1 and y1 are the coordinates of point A1 of surface feature A, x2 and y2 are the coordinates of point B1 of surface feature B, and d is the distance between surface feature contours.

[0065] By traversing the contour points between polygon features, the distance between all polygon feature contour points is calculated. If the polygon feature contour distance is less than the aggregation distance, polygon feature aggregation is performed first, followed by a judgment process to form aggregated polygon features. The area of ​​the aggregated features is then determined to be greater than or equal to the minimum area. Simultaneously, holes formed by the aggregated features are calculated, and their areas are determined to be greater than or equal to the minimum hole size. When no obstacle features are set, the aggregation function is executed to aggregate polygon features if the above conditions are met.

[0066] 2) The formula for calculating the area of ​​the aggregation surface element is as follows:

[0067] A polygonal feature is represented by its contour points, combined with... Figure 4 As shown, the polygon's extent is defined by vertices a, b, c, e, d. This discrete point sequence recording of surface features can be calculated using the trapezoidal method after discrete point projection, specifically in conjunction with... Figure 4 As shown:

[0068] A polygon is given by n vertices, and the coordinates of each vertex are (x, y, y). i ,y i If the polygon's area is 0, then the method for calculating the area of ​​the polygon is as follows:

[0069] A. Project each vertex of the polygon onto the x-axis to obtain projection points a', b', c', d', e', f', forming several trapezoids: abb'a', bcc'b', ..., eff'e', faa'f';

[0070] B. Calculate the area of ​​each trapezoid. The area of ​​each trapezoid can be expressed as:

[0071] (x2-x1)*(y2+y1) / 2;

[0072] For example, the formula for calculating the area of ​​trapezoid abb'a' is:

[0073] (x b -x a )*(y b +y a ) / 2;

[0074] For the trapezoid eff'e', its area is calculated as follows:

[0075] (x f -x e )*(y f +y e ) / 2;

[0076] Because x f <x e Therefore, its calculated area is negative.

[0077] The area of ​​a trapezoid with legs ab, bc, cd, and de is positive, while the area with legs ef and fa is negative.

[0078] C. Add the areas of all the trapezoids together to get the area of ​​the polygon. The formula for summation is as follows:

[0079]

[0080] The simplified formula is

[0081]

[0082] In summary, the calculation result is negative when the polygon vertices are in counter-clockwise order and positive when the polygon vertices are in clockwise order.

[0083] 3) The formula for calculating the area of ​​the voids in the aggregate surface element is as follows:

[0084] When the aggregate surface feature contains holes, the area can be calculated by separately calculating the outer ring area and the inner ring area. The inner ring area is the area of ​​the hole. The area of ​​the aggregate surface feature can be obtained by subtracting the inner ring area from the outer ring area.

[0085] 4) Determining whether aggregated elements cross obstacle elements:

[0086] When calculating the aggregation distance, if the aggregation conditions are met, connect points A(x1, y1) and B(x2, y2) between the surface feature outlines to form a line. Determine whether the aggregated feature outline overlaps with obstacle features (line and surface features) based on spatial positional relationships. If there is overlap, do not perform the aggregation operation; otherwise, perform the aggregation.

[0087] Combination Figure 5 As shown, the processing procedure is as follows:

[0088] Statistical analysis is used to obtain the minimum area of ​​obstacle surface features or the minimum distance between discrete points of obstacle line features. Combined with the length of the line segment connecting the contour points A(x1, y1) and B(x2, y2) of the input data surface features, the rasterization size is set, and the obstacle features and connecting lines are converted into raster data. The raster value of the obstacle features is set to 1, the raster value of the connecting lines is set to 2, and no data value is set to 0. Arithmetic operations are performed. If there is a raster value of 3, it means that the connecting line intersects with the obstacle feature, and the aggregation function is not executed; otherwise, the aggregation function is executed.

[0089] Step S4: Eliminate the pores inside the polymerization result.

[0090] Because the forest farm ownership area identified in the previous step has many holes, it cannot be isolated. To facilitate management, these holes are treated, and the result after treatment is as follows. Figure 6 As shown.

[0091] This result is the result of the pre-defined registration unit within a 50m search range.

[0092] The parameters for the hole elimination function are set as follows:

[0093] Input requirements: Aggregate surface features contain hole data, typically in .shp format.

[0094] Output elements: The output results after the elimination conditions are met, usually in .shp format.

[0095] Set elimination criteria: You can set the criteria for executing the hole elimination function based on the area, area percentage, or a combination of both.

[0096] Eliminate minimum area: When the elimination condition is set to area, set the minimum area to eliminate.

[0097] Minimum area percentage to eliminate: When the elimination condition is set to area percentage, set the minimum percentage value of the area of ​​holes to be eliminated relative to the feature area.

[0098] Eliminate Feature Selection: You can choose to eliminate only the holes inside the face features or eliminate all holes.

[0099] The area of ​​the aggregated surface feature is calculated, the elimination condition is set to area, the minimum elimination area is 0, only internal holes are eliminated, and the hole elimination function is executed.

[0100] The principle of hole elimination is as follows: When obtaining the set of discrete points of aggregated elements, the coordinates of the inner ring discrete points are traversed, the surface elements are regenerated, and then the aggregated surface elements are merged to eliminate the holes in the aggregated elements.

[0101] Step S5: Repeat steps S2 to S4 to obtain the pre-delineation results of registration units within different search ranges. For example... Figure 7 The image shows example data of the results for obtaining a pre-defined registration unit with a search range of 100m. Figure 8 To obtain example data of pre-defined registration unit results within a 200m search range; Figure 9 Example data for pre-defined registration unit results within a 300m search range.

[0102] The natural resource registration unit pre-delineation method provided by this invention lowers the entry barrier for users. Users do not need to understand the internal data processing process of the method, nor do they need to have relevant professional knowledge background in spatial data processing and analysis. They only need to select the input of basic natural resource data, set the search range and step size, process data and final output location, and the pre-delineation of natural resource registration units can be completed automatically. It provides a variety of data support and auxiliary decision analysis for registration unit delineation, effectively improves the efficiency of unified natural resource ownership registration, and promotes the management of natural resource ownership registration data and related application analysis.

[0103] The above description is merely a preferred embodiment of the present invention and does not limit the patent scope of the present invention. Any equivalent structural transformations made using the contents of the present invention's specification and drawings under the inventive concept of the present invention, or direct / indirect applications in other related technical fields, are included within the patent protection scope of the present invention.

Claims

1. A method for pre-delineating natural resource registration units, characterized in that, Includes the following steps: Step S1: Collect natural resource ownership data and vectorize the ownership data to obtain natural resource ownership small patch data; Step S2: Based on the spatial location and distribution of the ownership spots, set the search range and step size variation value for the spots; Step S3: Search according to the set search range, perform aggregation analysis on those that meet the aggregation conditions, and form a concentrated and contiguous aggregation result; Step S4: Eliminate the pores inside the polymerization result; Step S5: Repeat steps S2 to S4 to obtain the pre-delineation results of registration units with different search ranges; In step S3, during the aggregation analysis, the parameters of the aggregation function are set, including: Input data is used to input surface features for aggregation functions; Output data, used to output the aggregated result feature layer; Aggregate distance, used to set the maximum distance at which aggregate functions can be executed; Minimum area is used to limit the area of ​​elements following aggregation to be greater than or equal to the set minimum area; Minimum hole size, used to limit the area of ​​holes inside features after aggregation to be greater than or equal to the set value; Obstacle elements are used to restrict whether input polygon elements can cross obstacles; they can be line elements or polygon elements. When the distance between the boundaries of polygon features in the input layer is less than the aggregation distance, the boundary features of the aggregation features will be preserved. Where the distance between the boundaries is less than the aggregation distance, a connecting line will be generated to aggregate the polygon features. If two polygon features are collinear, they will be merged into a single outermost contour polygon feature. In step S3, during the aggregation analysis, the aggregation execution process includes the following: The polygon features are rotated according to their inflection points, and the distance between the polygon feature outlines is calculated. By traversing the outline points between polygon features, the distance between all polygon feature outline points is calculated. If the polygon feature outline distance is less than the aggregation distance, the polygon features are aggregated first, and then the aggregated polygon features are judged to have an area greater than or equal to the minimum area. At the same time, the area of ​​the holes formed by the aggregated features is calculated and judged to have an area greater than or equal to the minimum hole size. When no obstacle features are set, and the area of ​​the aggregated polygon features is greater than or equal to the minimum area, and the area of ​​the holes is greater than or equal to the minimum hole size, the aggregation function is executed to aggregate the polygon features. If obstacle features are set, when calculating the aggregation distance, if the aggregation conditions are met, points A between the surface feature profiles will be included. and point B Connect the elements into lines and determine whether the outline of the aggregated element overlaps with the obstacle element based on the spatial relationship. If there is an overlap, do not perform the aggregation operation; otherwise, perform the aggregation.

2. The method for pre-delineating natural resource registration units as described in claim 1, characterized in that, The distance between surface feature contours is calculated using the following point distance formula: In the formula: , Let A1 be the coordinates of the contour point of surface feature A. , Let B1 be the coordinates of the contour point B1 of surface feature B. The distance between the contours of surface elements.

3. The method for pre-delineating natural resource registration units as described in claim 1, characterized in that, When calculating the area of ​​aggregated surface features, the surface features are represented by polygonal features formed by their contour points, and the trapezoidal method after discrete point projection is used for calculation.

4. The method for pre-delineating natural resource registration units as described in claim 1, characterized in that, When the aggregate surface element contains holes, the area of ​​the outer ring and the area of ​​the inner ring are calculated separately. The area of ​​the inner ring is the area of ​​the hole, and the area of ​​the aggregate surface element is the area of ​​the outer ring minus the area of ​​the inner ring.

5. The method for pre-delineating natural resource registration units as described in claim 1, characterized in that, The process for determining whether an aggregated feature crosses a barrier feature is as follows: Statistical analysis yields the minimum area of ​​obstacle surface features or the minimum distance between discrete points of obstacle line features, combined with the input data surface feature contour points A. and point B Set the length of the line segments connecting the lines, set the rasterization size, convert the obstacle features and connecting lines into raster data, set the raster value of the obstacle features to 1, the raster value of the connecting lines to 2, and set the value of no data to 0, perform arithmetic operations, if there is a raster value of 3, it means that the connecting line intersects with the obstacle feature, and the aggregation function is not executed, otherwise the aggregation function is executed.

Images