Automatic layout method for global land comprehensive improvement strip fields and ditches based on engineering layout

Abstract

The invention discloses an engineering layout-based global land comprehensive improvement strip field and ditch automatic layout method, which comprises the following steps of: carrying out geometric correction on polygons in an original land parcel, establishing a strip field layout optimization model based on the polygons of the original land parcel after geometric correction, obtaining strip field layout parameters, and establishing a strip field layout optimization model based on the strip field layout parameters. Calculating and generating a channel center line by using the offset of the boundary topological line; embedding the ditch network and the cultivated land boundary by using a half-width cutting algorithm to generate a ditch polygon; performing spatial difference set operation on the ditch polygon and the original plot polygon after geometric correction, processing by adopting a multi-component decomposition and topology self-correction technology to obtain strip field units, and obtaining a strip field and ditch vector element set; and constructing an automatic attribute assignment model, injecting attribute information for the strip field and ditch vector element set, and generating a standardized result data set. According to the method, the land planning and design efficiency is greatly improved, and the method has a technical support effect on promoting high-standard farmland construction, land leveling and the like.

Description

Technical Field

[0001] This invention relates to the fields of land spatial planning and geographic information technology, specifically to an automated layout method for strip fields and ditches in comprehensive land consolidation based on engineering layout. Background Technology

[0002] The current engineering layout of strip fields and ditches in comprehensive land consolidation projects generally faces the dual dilemmas of engineering adaptability and spatial accuracy. At the planning, design, and implementation level, traditional technical methods rely heavily on manual experience to delineate the boundaries of strip fields and the direction of ditches. This results in the width dispersion of strip fields exceeding the allowable deviation range of the "General Rules for the Construction of High-Standard Farmland" by more than 35%. The mechanical arrangement of fragmented strip fields leads to a 12%-18% decrease in the effective utilization rate of arable land. This experience-driven model not only makes it difficult to ensure compliance with engineering specifications but also causes spatial misalignment between the ditch network and the boundaries of arable land, leading to increased irrigation leakage rates and hindering mechanical operations—inherent engineering flaws.

[0003] A deeper technological constraint lies in the systematic fragmentation of the layout process. Existing technologies separate strip field division from ditch design into independent modules: strip field division relies on static meshing tools, which cannot adapt to the geometric variations of irregular plots, resulting in strip fields crossing land use boundaries accounting for more than 15%; ditch generation uses simple buffer analysis, lacking spatial topological linkage with strip fields, leading to ditch encroachment on arable land reaching 8.3%. This fragmented approach causes cascading errors in the transmission of design parameters, particularly manifested in the inability to dynamically adjust the ditch network after strip field widths exceed limits, and the propagation of topological errors caused by concave polygonal gaps. Summary of the Invention

[0004] The technical problem to be solved by this invention is to address the issues of excessive strip width, misaligned ditch topology, and poor adaptability to complex plots in land leveling. This invention provides an automated layout method for strip fields and ditches in comprehensive land consolidation based on engineering layout. By deeply coupling intelligent strip field segmentation algorithm and boundary adaptive ditch generation technology, it can simultaneously achieve dynamic constraints on strip field width and millimeter-level precise adaptation of the ditch network.

[0005] To solve the above technical problems, the present invention adopts the following technical solution:

[0006] An automated layout method for strip fields and ditches in comprehensive land consolidation based on engineering layout includes the following steps:

[0007] S1. Construct a multi-scale linear unit dynamic conversion engine to unify the set strip width and ditch parameters into the metric system; use convex hull extraction and boundary point redundancy filtering methods to perform geometric correction on the polygons in the original plots, eliminate geometric anomalies and topological errors, form a high-precision and standardized spatial computing basis, and obtain the geometrically corrected original plot polygons.

[0008] S2. Based on the geometrically corrected original plot polygons, establish a strip field layout optimization model. Through a three-level fault tolerance mechanism, the number and width of the strip fields are adapted to obtain the strip field layout parameters.

[0009] S3. Based on the strip field layout parameters, the center line of the ditch is generated along the gap between the strip fields using the boundary topology line offset calculation method; the half-width clipping algorithm is used to perform millimeter-level embedding of the ditch network and the farmland boundary, accurately generating ditch polygons embedded between the strip fields, supporting two engineering layout modes: adjacent irrigation and drainage and alternating irrigation and drainage.

[0010] S4. Spatial difference operation is performed between the ditch polygon and the geometrically corrected original plot polygon to obtain preliminary strip field units. Multi-component decomposition and topology self-correction technology are used to eliminate the geometric degradation and area anomalies of the preliminary strip field units, ensuring seamless connection between cultivated land and ditches, and obtaining strip field units, thus obtaining a complete and topologically correct vector element set of strip fields and ditches.

[0011] S5. Construct an automatic attribute assignment model to inject attribute information into the vector element set of strip fields and ditches. This attribute information includes land category name and original OID attribute. The entire process strictly inherits the spatial reference system set for strip field width and ditch parameters, generates a standardized result dataset containing geometric features and attribute information that conforms to the "National Spatial Planning Mapping Specification", and completes the automated layout of strip fields and ditches.

[0012] Furthermore, in step S1, the set strip width and ditch parameters are input into the multi-scale linear unit dynamic conversion engine. After processing by the parser, the numbers and unit strings are separated. Based on the created database, all known conversion factors between units and meters are stored. The separated numbers and unit strings are multiplied by the corresponding conversion factors to obtain the metric strip width and ditch parameters. The specific formula is as follows:

[0013] L m =V*F(U std )

[0014] Among them, L m The input parameter represents the metric system, V represents the dimensionless value derived from the decomposition, and U... std This represents the standardized unit string, and F() represents the unit conversion factor mapping function.

[0015] The domain of the unit conversion factor mapping function includes both internationally accepted length units and traditional Chinese length units.

[0016] The fault tolerance rule of the unit conversion factor mapping function is as follows: if the input parameter does not contain a unit string, the unit of the input parameter is assumed to be meters; if the split unit string is not within the domain of the unit conversion factor mapping function, a warning message is issued and the unit of the input parameter is assumed to be meters.

[0017] The composite polygon features in the original plot are decomposed into independent single-component features. The degenerate polygons in the independent single-component features are reconstructed by convex hull reconstruction. The concave polygon crack region is reshaped by extracting the minimum convex hull boundary, and the concave polygon crack region with complete geometric contour is obtained.

[0018] The process involves sequentially traversing all vertices that form the boundary of the concave polygonal fissure region. The X and Y coordinates of the new vertex to be processed are compared with those of the last vertex already stored in the new point set. If the absolute values ​​of the coordinate differences between the new vertex and the last vertex in both the X and Y directions are less than the tolerance threshold, the new vertex is determined to be a redundant vertex. Redundant vertices are then filtered out, and an optimized geometric boundary composed of non-repeating feature vertices is generated, resulting in the geometrically corrected original plot polygon.

[0019] Furthermore, the geometry of a degenerate polygon includes the presence of sharp concave corners or gaps, self-intersecting boundary lines, and vertices with a spacing less than a set spacing threshold.

[0020] Furthermore, in step S2, the strip field layout optimization model includes an input layer, a core optimization layer, a three-level decision logic layer, and an output layer.

[0021] The geometrically corrected original plot polygons are input into the strip field layout optimization model. The input layer extracts the corresponding input parameters, including the measured total width, the set minimum strip field width, the set maximum strip field width, and the set ditch width. These input parameters are then dynamically iteratively calculated by the core optimization layer to obtain all possible strip field quantity schemes. The theoretical strip field width and space wastage value under each scheme are calculated using the following formulas:

[0022] bw=(width-ditch_width*(N-1)) / N

[0023] waste=abs(width-(N*bw+ditch_width*(N-1)))

[0024] Where bw represents the theoretical width of the strip field, width represents the measured total width, ditch_width represents the set width of the ditch, N represents the number of strip fields, and waste represents the space wastage value.

[0025] The system utilizes a three-tiered decision logic layer to evaluate, filter, and decide on all possible schemes for the number of strip fields. First, it selects schemes where the theoretical width of the strip fields falls entirely within the set minimum and maximum strip field width range. Then, it selects the scheme with the lowest space wastage value from this range as the optimal scheme. If no scheme exists where the theoretical width falls entirely within the set minimum and maximum strip field width range, it first selects schemes where the theoretical width of the strip fields does not exceed the set maximum strip field width. Then, it selects the scheme with the lowest space wastage value from this range as the optimal scheme, triggering a system warning and prompting the user to review the parameters. If the theoretical width of the strip fields in all schemes exceeds the set maximum strip field width, it defaults to using a single strip field, with the width taken as the smaller of the measured total width and the set maximum strip field width, as the optimal scheme. The output layer then outputs the strip field layout parameters, which include the number and width of the strip fields in the optimal scheme.

[0026] Furthermore, in step S3, the resulting ditch polygon includes the following:

[0027] Extract the upper and lower boundary lines of the original plot polygon after geometric correction, and calculate the offset using the following formula:

[0028] offset=bw*i+ditch_width*(i-0.5)

[0029] Where offset represents the offset, and i represents the i-th ditch currently being generated.

[0030] The offset is compared with the total length of the upper boundary L_top and the total length of the lower boundary L_bottom of the original geometrically corrected plot polygon to obtain the proportional positions Ratio_top and Ratio_bottom corresponding to the offset at the upper and lower boundaries, respectively. The specific formula is as follows:

[0031] Ratio_top = offset / L_top;

[0032] Ratio_bottom=offset / L_bottom.

[0033] On the upper boundary line, starting from the starting point, measure along the curve to Ratio_top*L_top to locate the first boundary point P_top; on the lower boundary line, starting from the starting point, measure along the curve to Ratio_bottom*L_bottom to locate the second boundary point P_bottom; connect the first boundary point P_top and the second boundary point P_bottom to obtain the line segment that is the centerline of the current ditch.

[0034] Subtracting half the set ditch width from the offset yields the left-hand point of the upper boundary and the left-hand point of the lower boundary of the original plot polygon after geometric correction; adding half the set ditch width to the offset yields the right-hand point of the upper boundary and the right-hand point of the lower boundary of the polygon; using the four side points as vertices and the set ditch width (ditch_width) as the width, the ditch polygon is obtained.

[0035] Further, in step S4, spatial difference operation is used to geometrically cut the ditch polygon and the geometrically corrected original plot polygon, removing the part that overlaps with the ditch polygon from the original plot polygon to obtain preliminary strip field units. Multi-part decomposition and topology self-correction techniques are used to process the preliminary strip field units. If the area of ​​the preliminary strip field unit is less than 0.1, convex hull reconstruction is performed on the preliminary strip field unit, and the reconstructed convex hull is reassigned to the preliminary strip field unit. When the distance between the current vertex and the previous vertex of the preliminary strip field unit is less than 0.001, the current vertex is removed. The absolute value of the difference between the actual width of the preliminary strip field unit and the theoretical width of the strip field is divided by the theoretical width of the strip field. If the result is greater than 0.05, it indicates that the strip field width is abnormal and is adjusted. Finally, the strip field unit is obtained.

[0036] Furthermore, the present invention also proposes an electronic device, including a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor executes the computer program to implement the steps of the automated layout method for strip fields and ditches in the comprehensive land consolidation based on engineering layout.

[0037] Furthermore, the present invention also proposes a computer-readable storage medium storing a computer program, which, when executed by a processor, performs the described automated layout method for strip fields and ditches in comprehensive land consolidation based on engineering layout.

[0038] Compared with the prior art, the present invention, employing the above technical solution, has the following technical effects:

[0039] 1. This invention utilizes the deep coupling of intelligent strip field segmentation algorithm and boundary adaptive ditch generation technology to simultaneously achieve dynamic constraints on strip field width and millimeter-level precise adaptation of ditch network, increasing the strip field width compliance rate from 82% in traditional methods to 99.6%, significantly improving the standard compliance of land leveling projects; at the same time, the multi-level fault tolerance mechanism can overcome the processing difficulties of complex plots in hilly areas, improving the processing efficiency of irregular plots in hilly areas by 40% and successfully eliminating 15% of the complex plot decomposition error rate.

[0040] 2. This invention is conducive to building an engineering technology system that seamlessly integrates design and construction, and significantly improves the first-pass rate of land consolidation projects. At the same time, it also provides standardized and digital core tools to support comprehensive land consolidation across the entire region, which is conducive to promoting the high-quality transformation of territorial spatial planning from two-dimensional drawings to three-dimensional real-world scenarios. Attached Figure Description

[0041] Figure 1 This is a flowchart illustrating the overall implementation of the present invention.

[0042] Figure 2 This is a schematic diagram of the original plot polygon obtained by the present invention after geometric correction.

[0043] Figure 3 This is a schematic diagram illustrating the striped field layout parameters obtained by the present invention.

[0044] Figure 4 This is a schematic diagram of the polygon generated by the present invention for the ditch. Detailed Implementation

[0045] The present invention will be further described below with reference to the accompanying drawings. The following embodiments are only used to more clearly illustrate the technical solution of the present invention, and should not be used to limit the scope of protection of the present invention.

[0046] To achieve the above objectives, this invention proposes an automated layout method for strip fields and ditches in comprehensive land consolidation based on engineering layout, such as... Figure 1 As shown, the specific steps are as follows:

[0047] S1. Construct a multi-scale linear unit dynamic conversion engine to unify the set strip width and ditch parameters to the metric system; use convex hull extraction and boundary point redundancy filtering methods to geometrically correct the polygons in the original plots, eliminating geometric anomalies and topological errors, and obtaining the geometrically corrected original plot polygons. Specifically:

[0048] Define input rules for the multi-scale linear unit dynamic conversion engine, specifically including: defining all recognizable scales, i.e., units, such as meters, centimeters, millimeters, kilometers, acres, feet, inches, and rulers. Especially for agricultural scenarios such as strip fields and ditches, it is important to support area units such as acres and hectares, and handle the conversion from area to length (such as field width) properly (for example, knowing the common conversion relationship between the width of one acre and meters).

[0049] The set strip width and ditch parameters are input into the multi-scale linear unit dynamic conversion engine. After processing by the parser, the data is split into numbers and unit strings; for example, when the text "50 mu" is input, it can automatically split into the number 50 and the unit string "mu". This process is dynamic because it needs to process any input that conforms to the rules in real time.

[0050] Based on the created database, store the conversion factors between all known units and meters, such as: 1km = 1000m, 1ft = 0.3048m, 1 mu = 666.67 square meters (but note that area to length conversion usually requires additional logic, such as assuming the shape of the plot); multiply the split numbers and unit strings with the corresponding conversion factors to obtain the metric strip width and ditch parameters; the specific formula is:

[0051] L m =V*F(U std )

[0052] Among them, L m The input parameter represents the metric system, V represents the dimensionless value derived from the decomposition, and U... std This represents a unit string after standardization (such as lowercase conversion and space replacement), and F() represents the unit conversion factor mapping function.

[0053] The domain of the unit conversion factor mapping function includes both internationally accepted length units and traditional Chinese length units.

[0054] The fault tolerance rule of the unit conversion factor mapping function is as follows: if the input parameter does not contain a unit string, the unit of the input parameter is assumed to be meters; if the split unit string is not within the domain of the unit conversion factor mapping function, a warning message is issued and the unit of the input parameter is assumed to be meters.

[0055] The original land parcel refers to one or more areas to be redeveloped. The process involves breaking down complex polygonal features within the original land parcel into independent single-component features, thus completely eliminating the risk of topological error propagation caused by multi-component structures. The specific code is as follows:

[0056]

[0057] The degenerate polygons in independent single-component features are reconstructed using convex hull reconstruction. By extracting the minimum convex hull boundary, the concave polygon crack region is reshaped to obtain a concave polygon crack region with a complete geometric contour, effectively solving the problem of cross-plot strip fields caused by traditional mesh segmentation; the specific code is as follows:

[0058] convex_hull=polygon.convexHull()

[0059] hull_points=list(convex_hull.getPart(0))

[0060] #Uniformly select feature points

[0061] The algorithm sequentially traverses all vertices constituting the boundary of the concave polygonal fracture region. It compares the X and Y coordinates of the new vertex to be processed with those of the last vertex already stored in the new point set. If the absolute value of the coordinate difference between the new vertex and the last vertex in both the X and Y directions is less than 1 mm, the new vertex is considered redundant and is filtered out. This process reduces data redundancy by up to 62% while ensuring geometric accuracy, generating an optimized geometric boundary composed of non-repeating feature vertices, thus obtaining the geometrically corrected original plot polygon. The specific code is as follows:

[0062]

[0063] Among them, the geometry of degenerate polygons includes sharp concave corners or cracks, self-intersecting boundary lines, and a large number of redundant, closely spaced vertices.

[0064] Step S1 is logically simple and efficient with low computational complexity. It effectively eliminates repetitions or overly close vertices caused by errors in digital acquisition, data conversion, or human operation, significantly reducing data redundancy and establishing a high-precision spatial basis for subsequent calculation of strip widths and accurate positioning of ditches. Furthermore, it improves the geometric adaptation efficiency of complex plots in hilly areas by 40%, successfully overcoming the 15% failure rate in handling irregular plots found in traditional tools.

[0065] S2. Based on the geometrically corrected original plot polygons, an optimization model for the strip field layout is established. A three-level fault-tolerant mechanism is used to adapt the number and width of the strip fields for engineering purposes, resulting in the strip field layout parameters. Specifically:

[0066] The strip field layout optimization model includes an input layer, a core optimization layer, a three-level decision logic layer, and an output layer.

[0067] The geometrically corrected original plot polygons are input into the strip field layout optimization model. The input layer extracts the corresponding input parameters, including the measured total width, the set minimum strip field width (derived from engineering specifications, such as 200 meters in plains areas), the set maximum strip field width (derived from engineering specifications, such as 400 meters in plains areas), and the set ditch width. The input parameters are then dynamically iteratively calculated by the core optimization layer to obtain all possible strip field quantity schemes, and the theoretical strip field width and space wastage value under each scheme are calculated. The specific formula is as follows:

[0068] bw=(width-ditch_width*(N-1)) / N

[0069] waste=abs(width-(N*bw+ditch_width*(N-1)))

[0070] Where bw represents the theoretical width of the strip field, width represents the measured total width, ditch_width represents the set width of the ditch, N represents the number of strip fields, and waste represents the space wastage value.

[0071] The system utilizes a three-tiered decision logic layer to evaluate, filter, and decide on all possible strip field quantity schemes. First, it selects schemes where the theoretical width of the strip fields falls entirely within the set minimum and maximum strip field width range. Then, it selects the scheme with the lowest space waste value from this range as the optimal scheme. If no scheme exists where the theoretical width falls entirely within the set minimum and maximum strip field width range, it first selects schemes where the theoretical width does not exceed the set maximum strip field width. Then, it selects the scheme with the lowest space waste value from this range as the optimal scheme, triggering a system warning and prompting the user to review the parameters, forming a closed-loop guarantee system covering all land consolidation conditions across the entire area. If the theoretical width of the strip fields in all schemes exceeds the set maximum strip field width, it defaults to using a single strip field. The width of this strip field is taken as the smaller value between the measured total width and the set maximum strip field width, as the optimal scheme. This means that not only is the width safe, but its layout is also determined to treat the entire plot as a single strip field. The output layer outputs the strip field layout parameters, which include the number and width of the strip fields in the optimal scheme.

[0072] In plains areas, the width of strip fields ranges from 200 to 400 meters. When the width is less than 200 meters, the number of times machinery turns around increases by 47%. When the width is greater than 400 meters, the irrigation uniformity decreases by 23%. In hilly areas, the width of strip fields ranges from 100 to 150 meters. In mountain terraces, the full width of the plot is used, such as 85 meters. In valleys, the width should not exceed 150 meters. Ensure that the basic design meets national engineering standards.

[0073] The specific code for the strip field layout optimization model is as follows:

[0074]

[0075]

[0076] S3. Based on the strip field layout parameters, the center lines of ditches are generated along the gaps between strip fields using the boundary topology line offset calculation method. A half-width clipping algorithm is used to precisely embed the ditch network and farmland boundaries at the millimeter level, accurately generating ditch polygons embedded between strip fields, supporting two engineering layout modes: adjacent irrigation and drainage, and alternating irrigation and drainage. Specifically:

[0077] Extract the upper and lower boundary lines of the original plot polygon after geometric correction, and calculate the offset using the following formula:

[0078] offset=bw*i+ditch_width*(i-0.5)

[0079] Where offset represents the offset, and i represents the i-th ditch currently being generated.

[0080] The offset is compared with the total length of the upper boundary L_top and the total length of the lower boundary L_bottom of the original geometrically corrected plot polygon to obtain the proportional positions Ratio_top and Ratio_bottom corresponding to the offset at the upper and lower boundaries, respectively. The specific formula is as follows:

[0081] Ratio_top = offset / L_top;

[0082] Ratio_bottom=offset / L_bottom.

[0083] On the upper boundary line, starting from the starting point, measure along the curve to Ratio_top*L_top to locate the first boundary point P_top; on the lower boundary line, starting from the starting point, measure along the curve to Ratio_bottom*L_bottom to locate the second boundary point P_bottom; connect the first boundary point P_top and the second boundary point P_bottom to obtain the line segment that is the centerline of the current ditch.

[0084] Subtracting half the set ditch width from the offset yields the left-hand point of the upper boundary and the left-hand point of the lower boundary of the original plot polygon after geometric correction; adding half the set ditch width to the offset yields the right-hand point of the upper boundary and the right-hand point of the lower boundary of the polygon; using the four side points as vertices and the set ditch width (ditch_width) as the width, the ditch polygon is obtained.

[0085] S4. Spatial difference operations are performed between the ditch polygons and the geometrically corrected original plot polygons to obtain preliminary strip field units. Multi-component decomposition and topological self-correction techniques are then used to eliminate geometric degradation and area anomalies in the preliminary strip field units, ensuring seamless connection between farmland and ditches, thus obtaining strip field units and a complete, topologically correct vector element set of strip fields and ditches. Specifically:

[0086] Using spatial difference operations, geometric shearing is performed on the ditch polygon and the geometrically corrected original plot polygon to remove the part that overlaps with the ditch polygon from the original plot polygon, resulting in preliminary strip field units. Multi-component decomposition and topology self-correction techniques are then used to process these preliminary strip field units. If the area of ​​the preliminary strip field unit is less than 0.1, convex hull reconstruction is performed on the preliminary strip field unit, and the reconstructed convex hull is reassigned to the preliminary strip field unit. When the distance between the current vertex and the previous vertex of the preliminary strip field unit is less than 0.001, the current vertex is removed. The absolute value of the difference between the actual width of the preliminary strip field unit and the theoretical width of the strip field is divided by the theoretical width of the strip field. If the result is greater than 0.05, it indicates an abnormal strip field width, and adjustments are made. Finally, the strip field units are obtained.

[0087] In step S4, the code for geometric degradation repair is as follows:

[0088] if polygon.area < 0.1: polygon = polygon.convexHull() # Reconstruct the micro-fragmented patch

[0089] The code for point set redundancy filtering is as follows:

[0090] for iin range(points.count-1,-1,-1):

[0091] if points[i].distanceTo(points[i-1])<0.001:

[0092] `points.remove(i)` # Removes redundant points within 1mm.

[0093] The code for area anomaly monitoring is:

[0094] deviation=abs(actual_width-design_width) / design_width

[0095] if deviation > 0.05:

[0096] arcpy.AddMessage("Field width error:ID"+oid)# Project re-inspection flag

[0097] S5. Construct an automatic attribute assignment model to inject attribute information into the vector feature sets of striped fields and ditches. This attribute information includes the land use name and the original OID attribute. The specific code is as follows:

[0098] ins_cursor.insertRow([part,"cultivated land",oid]) # Strip field element

[0099] ins_cursor.insertRow([ditch,"ditch",oid]) # Ditch element

[0100] The entire process strictly inherits the spatial reference system of the set strip width and ditch parameters, generates a standardized dataset containing geometric features and attribute information that conforms to the "National Spatial Planning Mapping Specification", and completes the automated layout of strip fields and ditches.

[0101] Example:

[0102] Taking a comprehensive land consolidation project covering seven administrative villages in a district of Nanjing as an example, the method proposed in this invention was implemented using ArcGIS Pro 3.4.0. Data was obtained from the 2023 National Land Change Survey Database, which contains 12,570 cultivated land plots.

[0103] Input the land leveling area parameters, and set the total measured width of the strip fields to 200 meters, the maximum strip field width to 80 meters, the minimum strip field width to 60 meters, and the ditch width to 5 meters. The parameters will be automatically converted to metric units.

[0104] Iterate through all cultivated units, taking plot OID=1024 (measured width 385 meters) as an example to perform iterative optimization:

[0105] Calculate the optimal solution: When the number of fields N = 2, the width bw = (385-5) / 2 = 190 meters (lower than the minimum value of 200 meters);

[0106] Trigger suboptimal degradation: Select the single field scheme with N=1 (bw=385 meters);

[0107] Output warning: "Use suboptimal solution: 1 field, 385.00 meters wide";

[0108] By employing a three-tiered fault-tolerance mechanism to ensure the feasibility of the plan, the pass rate for strip field width in a certain district of Nanjing reached 99.7%.

[0109] Taking plot OID=2048 (4-field layout) as an example:

[0110] Boundary topology construction: Extract the upper and lower boundary lines (length 412.3m / 408.7m);

[0111] Offset calculation: Locate the center lines of the three ditches;

[0112] Half-width cutting: Locate the four corner points of the ditch 2.5 meters to both sides of the center line;

[0113] Spatial clipping: Intersect the ditch polygons with the original plots to generate the final ditch network.

[0114] Merge plot OID=3072:

[0115] Spatial difference operation: original plot (18.6 hectares) minus 7 ditches (0.93 hectares);

[0116] Multi-component decomposition: generates 8 stripe fields;

[0117] Topology correction: Repaired 0.08 hectares of slightly fragmented plots, removed 23 redundant vertices, and marked F07 field width deviation of 6.2%;

[0118] The output of cultivated land units and ditch elements both carry the land type name and the original OID attribute.

[0119] Inheriting the CGCS2000 coordinate system from the input data, the output results are produced according to the "Specifications for Territorial Spatial Planning Mapping".

[0120] Farmland elements: filled in light green, with strip field numbers marked;

[0121] Ditch elements: filled in blue, width expressed according to actual dimensions;

[0122] Synchronously generate project logs to record processing time.

[0123] Figure 2 This is a schematic diagram of the original plot polygon after geometric correction obtained by this invention. From Figure 2 The image shows a complex original plot containing concave areas and redundant vertices. After multi-part decomposition, convex hull reconstruction and vertex filtering, it is transformed into a standardized plot with smooth boundaries and regular geometry.

[0124] Figure 3 This is a schematic diagram illustrating the striped field layout parameters obtained by the present invention. From Figure 3 As can be seen, the strip layout optimization model calculates different numbers of strips (N=1,2,3...) sequentially on the plot width axis. This shows that through dynamic iteration and three-level decision logic, it can intelligently adapt to plots of different sizes, ensuring that the output of strip width is always within the engineering feasible range. This solves the industry problem that traditional static methods cannot take into account both compliance with regulations and flexibility of the scheme.

[0125] Figure 4 This is a schematic diagram illustrating the generation of ditch polygons according to the present invention. From... Figure 4 The image shows the precise location of the ditch centerline on the upper and lower boundaries of the original plot based on the strip field layout parameters, as well as the rectangular ditch polygon generated by half-width clipping that perfectly fits the plot boundary and has a precise width. This demonstrates that the boundary topology offset and half-width clipping algorithm achieve millimeter-level seamless integration between the ditch and the farmland boundary, with an accuracy far exceeding that of traditional buffer methods, effectively preventing the ditch from encroaching on farmland or causing spatial disconnection.

[0126] This invention improves the pass rate of strip field width, enhances the positioning accuracy of ditches, successfully repairs 1283 degraded plots through geometric correction, and increases the processing efficiency of complex plots by 40%.

[0127] The strip farmland units generated by this invention have an average width of 286 meters (plain area) and 118 meters (hilly area), which fully meet the requirements of the "General Rules for the Construction of High-Standard Farmland"; the ditch network density is 4.3 meters / mu, and the irrigation uniformity is improved by 23%; the effective utilization rate of cultivated land reaches 95.2%, which is 7.5% higher than before the improvement.

[0128] This invention automates the process in just 68 seconds per 100 hectares, which is 40 times more efficient than manual design; it eliminates the problem of ditches encroaching on farmland, saving 0.93 hectares per thousand acres of farmland; and its standardized output reduces the cost of detailed construction drawings by 57%.

[0129] This invention provides a dynamic optimization model for strip field layout to solve the industry problem of exceeding width limits, an embedded ditch generation technology to achieve millimeter-level fitting accuracy, and a geometric correction-topology fusion dual-loop system to overcome the bottleneck of complex plot processing.

[0130] This invention also proposes an electronic device, including a memory, a processor, and a computer program stored in the memory and executable on the processor. It should be noted that when the processor executes the computer program, it corresponds to the specific steps of the method provided in this invention, possessing the corresponding functional modules and beneficial effects for executing the method. Technical details not described in detail in this embodiment can be found in the method provided in this invention.

[0131] This invention also proposes a computer-readable storage medium storing a computer program. It should be noted that when the computer program is executed by a processor, it corresponds to the specific steps of the method provided in this invention, possessing the corresponding functional modules and beneficial effects for executing the method. Technical details not described in detail in this embodiment can be found in the method provided in this invention.

[0132] 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. An automated layout method for strip fields and ditches in comprehensive land consolidation based on engineering layout, characterized in that, include: S1. Construct a multi-scale linear unit dynamic conversion engine to unify the set strip width and ditch parameters into the metric system; The polygons in the original land parcel are geometrically corrected by using convex hull extraction and boundary point redundancy filtering methods to obtain the geometrically corrected original land parcel polygons. S2. Based on the geometrically corrected original plot polygons, a strip field layout optimization model is established. The number and width of strip fields are adapted to the engineering through a three-level fault tolerance mechanism to obtain the strip field layout parameters. S3. Based on the strip field layout parameters, the center line of the ditch is generated along the gap between the strip fields using the boundary topology line offset calculation method; the half-width clipping algorithm is used to embed the ditch network with the farmland boundary to generate ditch polygons embedded between the strip fields. S4. Spatial difference operation is performed between the ditch polygon and the geometrically corrected original plot polygon to obtain preliminary strip field units; multi-component decomposition and topology self-correction technology are used to process the preliminary strip field units to obtain strip field units and obtain the vector element set of strip fields and ditches; S5. Construct an automatic attribute assignment model to inject attribute information into the vector element set of strip fields and ditches. This attribute information includes land category name and original OID attribute, generates a standardized result dataset, and completes the automated layout of strip fields and ditches.

2. The automated layout method for strip fields and ditches in comprehensive land consolidation based on engineering layout as described in claim 1, characterized in that, In step S1, the set strip width and ditch parameters are input into the multi-scale linear unit dynamic conversion engine, and after processing by the parser, the numbers and unit strings are separated. Based on the created database, all known conversion factors between units and meters are stored; the split numbers and unit strings are multiplied by the corresponding conversion factors to obtain the metric field width and ditch parameters; the specific formula is: L m =V*F(U std ) Among them, L m The input parameter represents the metric system, V represents the dimensionless value derived from the decomposition, and U... std This represents the standardized unit string, and F() represents the unit conversion factor mapping function. The domain of the unit conversion factor mapping function includes both internationally accepted units of length and traditional Chinese units of length. The fault tolerance rule of the unit conversion factor mapping function is as follows: if the input parameter does not contain a unit string, the unit of the input parameter is assumed to be meters; if the split unit string is not within the domain of the unit conversion factor mapping function, a warning message is issued and the unit of the input parameter is assumed to be meters. The composite polygon features in the original plot are decomposed into independent single-component features. The degenerate polygons in the independent single-component features are reconstructed by convex hull. The concave polygon crack region is reshaped by extracting the minimum convex hull boundary, and the concave polygon crack region with complete geometric contour is obtained. The process involves sequentially traversing all vertices that form the boundary of the concave polygonal fissure region. The X and Y coordinates of the new vertex to be processed are compared with those of the last vertex already stored in the new point set. If the absolute values ​​of the coordinate differences between the new vertex and the last vertex in both the X and Y directions are less than the tolerance threshold, the new vertex is determined to be a redundant vertex. Redundant vertices are then filtered out, and a geometric boundary is generated to obtain the geometrically corrected original plot polygon.

3. The automated layout method for strip fields and ditches in comprehensive land consolidation based on engineering layout as described in claim 2, characterized in that, The geometry of a degenerate polygon includes the presence of concave corners or gaps, self-intersecting boundary lines, and vertices with a spacing less than a set spacing threshold.

4. The automated layout method for strip fields and ditches in comprehensive land consolidation based on engineering layout as described in claim 1, characterized in that, In step S2, the strip field layout optimization model includes an input layer, a core optimization layer, a three-level decision logic layer, and an output layer; The geometrically corrected original plot polygons are input into the strip field layout optimization model. The input layer extracts the corresponding input parameters, including the measured total width, the set minimum strip field width, the set maximum strip field width, and the set ditch width. These input parameters are then dynamically iteratively calculated by the core optimization layer to obtain all possible strip field quantity schemes, and the theoretical strip field width and space wastage value are calculated for each scheme. The specific formula is as follows: bw=(width-ditch_width*(N-1)) / N waste=abs(width-(N*bw+ditch_width*(N-1))) Where bw represents the theoretical width of the strip field, width represents the measured total width, ditch_width represents the set width of the ditch, N represents the number of strip fields, and waste represents the space wastage value; A three-level decision logic layer is used to evaluate, screen, and decide on all strip field quantity schemes. First, the scheme in which the theoretical width of the strip field falls completely within the set minimum and maximum strip field width range is selected. Then, the scheme with the smallest space waste value is selected from this scheme as the optimal scheme. If no scheme in which the theoretical width of the strip field falls completely within the set minimum and maximum strip field width range is found, the scheme in which the theoretical width of the strip field does not exceed the set maximum strip field width is selected. Then, the scheme in which the smallest space waste value is selected from this scheme as the optimal scheme, and a system warning is triggered. If the theoretical width of the strip field in all schemes exceeds the set maximum strip field width, a single strip field is used by default. The width of this strip field is taken as the smaller value between the measured total width and the set maximum strip field width, and this is selected as the optimal scheme. The output layer outputs the strip layout parameters, which include the number and width of the strips in the optimal solution.

5. The automated layout method for strip fields and ditches in comprehensive land consolidation based on engineering layout as described in claim 4, characterized in that, In step S3, the resulting ditch polygon includes the following: Extract the upper and lower boundary lines of the original plot polygon after geometric correction, and calculate the offset using the following formula: offset=bw*i+ditch_width*(i-0.5) Where offset represents the offset, and i represents the i-th ditch currently generated; The offset is compared with the total length of the upper boundary L_top and the total length of the lower boundary L_bottom of the original geometrically corrected plot polygon to obtain the proportional positions Ratio_top and Ratio_bottom corresponding to the offset at the upper and lower boundaries, respectively. The specific formula is as follows: Ratio_top = offset / L_top; Ratio_bottom=offset / L_bottom; On the upper boundary line, starting from the starting point, measure along the curve to Ratio_top*L_top to locate the first boundary point P_top; on the lower boundary line, starting from the starting point, measure along the curve to Ratio_bottom*L_bottom to locate the second boundary point P_bottom; connect the first boundary point P_top and the second boundary point P_bottom, and the resulting line segment is the centerline of the current ditch. Subtracting half the set ditch width from the offset yields the left-hand point of the upper boundary and the left-hand point of the lower boundary of the original plot polygon after geometric correction; adding half the set ditch width to the offset yields the right-hand point of the upper boundary and the right-hand point of the lower boundary of the polygon; using the four side points as vertices and the set ditch width (ditch_width) as the width, the ditch polygon is obtained.

6. The automated layout method for strip fields and ditches in comprehensive land consolidation based on engineering layout as described in claim 4, characterized in that, In step S4, spatial difference operation is used to geometrically cut the ditch polygon and the geometrically corrected original plot polygon, removing the part that overlaps with the ditch polygon from the original plot polygon to obtain preliminary strip field units. Multi-part decomposition and topology self-correction techniques are used to process the preliminary strip field units. If the area of ​​the preliminary strip field unit is less than 0.1, convex hull reconstruction is performed on the preliminary strip field unit, and the reconstructed convex hull is reassigned to the preliminary strip field unit. When the distance between the current vertex and the previous vertex of the preliminary strip field unit is less than 0.001, the current vertex is removed. The absolute value of the difference between the actual width of the preliminary strip field unit and the theoretical width of the strip field is divided by the theoretical width of the strip field. If the result is greater than 0.05, it indicates that the strip field width is abnormal, and adjustments are made to finally obtain the strip field unit.

7. An electronic device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that, When the processor executes the computer program, it implements the steps of the automated layout method for strip fields and ditches in the comprehensive land consolidation based on engineering layout as described in any one of claims 1 to 6.

8. A computer-readable storage medium storing a computer program, characterized in that, The computer program, when executed by the processor, performs the automated layout method for strip fields and ditches in the comprehensive land consolidation based on engineering layout, as described in any one of claims 1 to 6.

Images