Edge block precise cutting and attribution method based on block boundary extension line

Abstract

The edge block precise cutting and attribution method based on block boundary extension line belongs to the technical field of geographic spatial information processing, and particularly relates to a spatial geometric processing method for automatically dividing the abutting area by using the extension line based on the structural features of the adjacent polygon boundaries; solves the problems of low efficiency, poor precision and difficulty in adapting to the differences in shape, size and boundary direction among different blocks caused by the traditional manual drawing or rule-based division of the boundaries; and the method comprises the following steps: according to the spatial proximity relationship, attributing the divided edge block fragments to the corresponding original block map patches. The edge block precise cutting and attribution method based on block boundary extension line is suitable for application scenarios such as agricultural management, land right confirmation, remote sensing mapping and GIS spatial analysis.

Description

Technical Field

[0001] This invention relates to the field of geospatial information processing technology, and in particular to a spatial geometric processing method for automatically dividing border areas based on the structural features of adjacent polygon boundaries and using extended lines. Background Technology

[0002] In tasks such as agricultural land management, land rights confirmation and registration, and refined allocation of arable land resources, there are often multiple consecutive plots of land (such as vertical strip-shaped plots, referred to here as original plots) with a unified edge area (such as field edges, passageways, and farm roads, referred to here as edge plots) adjacent to one side. In order to achieve a reasonable division of this edge area and a one-to-one correspondence with the plots, it is necessary to accurately divide it according to the boundary relationship between the plots.

[0003] Traditional methods mostly rely on manual drawing or rule-based division, which is inefficient, inaccurate, and difficult to adapt to differences in shape, size, and boundary orientation among different land parcels. Especially in GIS spatial analysis or remote sensing-assisted land parcel management, the lack of an automatic segmentation mechanism based on the extended structure of land parcel boundaries limits the automation and standardization of land allocation. Summary of the Invention

[0004] This invention proposes a method for precise cutting and attribution of edge plots based on the extension line of the plot boundary, which solves the problems of low efficiency, poor accuracy and difficulty in adapting to the differences in shape, size and boundary direction between different plots that exist in traditional manual drawing or rule-based boundary division.

[0005] The method for precise cutting and attribution of edge plots based on the extension line of the plot boundary, as described in this invention, includes the following steps:

[0006] Step S1: Extract valid endpoints: Read the original parcel layer and the edge parcel layer, extract all boundary vertices of the outer boundary ring of the original parcel, and retain the boundary vertices that are in contact with the edge parcel as valid endpoints through spatial filtering;

[0007] Step S2: Construct candidate dividing lines: Based on spatial adjacency, filter the original land parcels that are in contact with the edge land parcels to obtain a subset of adjacent original land parcels; traverse each parcel in the subset of adjacent original land parcels and extract the two longest edges of each parcel; extend each longest edge along its direction by a preset length to generate an extension line, and trim and retain the line segments located inside the edge land parcels as candidate dividing lines;

[0008] Step S3: Generate segmentation surfaces: Merge the boundary lines of edge plots with candidate segmentation lines to form a closed mesh; use topological capture to close geometric gaps and perform line-to-surface conversion to generate closed polygons; filter invalid surfaces to obtain segmented edge plot fragments;

[0009] Step S4: Spatial Attribution and Merging: Based on spatial proximity, assign the segmented edge plots to the corresponding original plots.

[0010] Furthermore, in a preferred embodiment, step S1 includes:

[0011] Step S1.1: Read the original land parcel layer and the edge land parcel layer, and unify the coordinate reference system;

[0012] Step S1.2: Traverse each original land parcel in the original land parcel layer, extract all boundary vertices of the outer boundary ring of each original land parcel, and generate an initial boundary vertex set;

[0013] Step S1.3: Through spatial intersection analysis, filter the boundary vertices in the initial boundary vertex set that are in contact with the edge plots, and merge the overlapping points to obtain the effective endpoint set.

[0014] Furthermore, in a preferred embodiment, step S2 includes:

[0015] Step S2.1: Select the patches that are in contact with the geometric boundary of the edge patch from the original patch layer to obtain the adjacent original patch subset;

[0016] Step S2.2: Traverse each patch in the adjacent original plot subset, convert the continuous vertices of the outer boundary ring of the patch into line segments, calculate the length of each line segment, and select the two line segments with the longest length as the two longest edges;

[0017] Step S2.3: For each longest edge, calculate its direction vector and normalize it. Extend the length by a preset length from the start point and the end point along the direction vector to obtain the extension line;

[0018] Step S2.4: Trim the extended line using edge parcels, retaining the line segments located inside the edge parcels as candidate dividing lines.

[0019] Furthermore, in a preferred embodiment, in step S2.3, the extended preset length is: extended to the other outer boundary of the edge plot.

[0020] Furthermore, in a preferred embodiment, step S3 includes:

[0021] Step S3.1: Extract the boundary lines of the edge plots and merge them with the candidate segmentation lines to form a closed grid;

[0022] Step S3.2: Perform topology capture within the preset tolerance range to close the geometric gaps in the wireframe;

[0023] Step S3.3: Convert the closed mesh into surface features to generate candidate segmentation surfaces;

[0024] Step S3.4: Filter out candidate segmentation surfaces with an area less than or equal to zero or with illegal geometry to obtain segmented edge plot fragments.

[0025] Furthermore, in a preferred embodiment, step S4 includes:

[0026] Calculate the boundary distance between each edge parcel fragment and each patch in the adjacent original parcel subset, and assign the edge parcel fragment to the nearest original parcel patch.

[0027] This invention also proposes a device for precise cutting and allocation of edge plots based on the extension line of the plot boundary, the device comprising the following modules:

[0028] Module S1: Extract valid endpoints: Read the original land parcel layer and the edge land parcel layer, extract all boundary vertices of the outer boundary ring of the original land parcel, and retain the boundary vertices that are in contact with the edge land parcel as valid endpoints through spatial filtering;

[0029] Module S2: Constructing candidate dividing lines: Based on spatial adjacency, filter the original land parcels that are in contact with the edge land parcels to obtain a subset of adjacent original land parcels; traverse each parcel in the subset of adjacent original land parcels and extract the two longest edges of each parcel; extend each longest edge along its direction by a preset length to generate an extension line, and trim and retain the line segments located inside the edge land parcels as candidate dividing lines;

[0030] Module S3: Generate Segmentation Surfaces: Merge the boundary lines of edge parcels with candidate segmentation lines to form a closed mesh; use topological capture to close geometric gaps and perform line-to-surface conversion to generate closed polygons; filter invalid surfaces to obtain segmented edge parcel fragments;

[0031] Module S4: Spatial Attribution and Merging: Based on spatial proximity, the segmented edge plots are assigned to the corresponding original plots.

[0032] The present invention also proposes a computer device comprising: a processor and a memory, the memory being used to store executable instructions of the processor, the processor being configured to execute the method for precise cutting and attribution of edge plots based on the extension line of the plot boundary as described above by executing the executable instructions.

[0033] The present invention also proposes a computer storage medium storing a computer program, wherein when the computer program is executed, it performs the method for precise cutting and attribution of edge plots based on the extension line of the plot boundary as described above.

[0034] The present invention also proposes a computer program product, including a computer program / instruction, which, when executed by a processor, implements the steps of the method for precise cutting and attribution of edge plots based on the extension line of the plot boundary as described above.

[0035] The present invention has the following beneficial effects:

[0036] 1. The method for precise cutting and attribution of edge plots based on the extension line of the plot boundary described in this invention can automatically identify the spatial structural relationship between the main plot and the edge plot, and construct a dividing line (segmentation line) based on the direction of the main boundary, thereby achieving efficient and precise cutting of the edge area, and has the following advantages:

[0037] (1) It has a high degree of automation and is suitable for large-scale batch data processing;

[0038] (2) The segmentation logic is reasonable, ensuring that the edge segments correspond one-to-one with the main plots;

[0039] (3) The spatial structure is clear, which facilitates subsequent statistics, modeling and map representation.

[0040] This method has strong practicality and scalability in scenarios such as agricultural remote sensing, land title confirmation, and map making.

[0041] 2. The method for precise cutting and attribution of edge plots based on the extension line of the plot boundary described in this invention accurately locates the cutting starting point by extracting effective endpoints, thus avoiding segmentation deviations caused by arbitrarily selecting cutting points.

[0042] 3. The method for accurate cutting and attribution of edge plots based on the extension line of the plot boundary described in this invention solves the problem of inaccurate manually drawn cutting lines by extending and trimming the longest side and extending the cutting line along the natural boundary.

[0043] 4. The method for precise cutting and attribution of edge plots based on the extension line of the plot boundary described in this invention automatically repairs minute gaps through topology capture, preventing the appearance of "cracks" or "voids".

[0044] 5. The method for precise cutting and attribution of edge plots based on the extension line of the plot boundary described in this invention automatically generates closed areas to replace manual outlining through line-to-surface operation, and then intelligently allocates subordinate areas through spatial attribution to resolve the dispute over "who owns this plot of land".

[0045] The method for precise cutting and attribution of edge plots based on the extension line of the plot boundary described in this invention is a spatial geometric processing method that automatically divides the border area based on the structural features of adjacent polygon boundaries and the extension line. It is applicable to application scenarios such as agricultural management, land registration, remote sensing mapping and GIS spatial analysis. Attached Figure Description

[0046] To more clearly illustrate the technical solutions in the embodiments of the present invention, the drawings used in the embodiments 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 from these drawings without creative effort.

[0047] Figure 1 This is a flowchart illustrating a method for accurately cutting and assigning edge plots based on the extension line of the plot boundary, as described in one embodiment of the present invention. Detailed Implementation

[0048] To make the technical solutions and advantages of the present invention clearer, the specific embodiments of the present invention will be described in further detail and completely below with reference to the accompanying drawings. The various embodiments described below are only some preferred embodiments of the present invention, and not all of them; the various embodiments described below are intended to explain the present invention and should not be construed as limiting the present invention; reasonable combinations of the technical features defined in the various embodiments of the present invention, as well as all other embodiments obtained by those skilled in the art based on the embodiments of the present invention without creative effort, are all within the scope of protection of the present invention.

[0049] Implementation Method 1: A method for precise cutting and allocation of edge plots based on the extension line of the plot boundary, the method comprising the following steps:

[0050] Step S1: Extract valid endpoints: Read the original parcel layer and the edge parcel layer, extract all boundary vertices of the outer boundary ring of the original parcel, and retain the boundary vertices that are in contact with the edge parcel as valid endpoints through spatial filtering;

[0051] Step S2: Construct candidate dividing lines: Based on spatial adjacency, filter the original land parcels that are in contact with the edge land parcels to obtain a subset of adjacent original land parcels; traverse each parcel in the subset of adjacent original land parcels and extract the two longest edges of each parcel; extend each longest edge along its direction by a preset length to generate an extension line, and trim and retain the line segments located inside the edge land parcels as candidate dividing lines;

[0052] Step S3: Generate segmentation surfaces: Merge the boundary lines of edge plots with candidate segmentation lines to form a closed mesh; use topological capture to close geometric gaps and perform line-to-surface conversion to generate closed polygons; filter invalid surfaces to obtain segmented edge plot fragments;

[0053] Step S4: Spatial Attribution and Merging: Based on spatial proximity, assign the segmented edge plots to the corresponding original plots.

[0054] In this embodiment, the original land parcel layer is a vector dataset containing multiple independent land parcel units. Each unit, called a parcel (i.e., the original land parcel), represents a geographic entity with clearly defined boundaries (such as farmland parcels), stored in polygonal geometry, and accompanied by attribute information (such as parcel number and area). It's like an electronic map with multiple farmlands drawn on it (each farmland being a "parcel").

[0055] In this embodiment, edge plots are geographic elements corresponding to the continuous areas to be divided that are adjacent to the original plots. Their geometric shape is a single polygon, representing common areas such as field edges and farm roads, and they share some boundaries with the original plots.

[0056] In this embodiment, boundary vertices are key coordinate points that constitute the polygonal outline of the land parcel. These points are connected in a specific order to form a closed boundary line, and each vertex contains planar coordinate values ​​(X, Y), determining the geometric features of the land parcel shape. Examples include the corner points of farmland boundaries (similar to the coordinate points of each corner of a polygon).

[0057] In this embodiment, the outer boundary ring is a closed path describing the outer contour of the main body of the plot. It consists of an ordered sequence of boundary vertices, forming the outermost closed geometry of the plot, and does not contain any internal openings. For example, the outermost boundary line of farmland (imagine a path used to define the shape of farmland with a rope).

[0058] In this implementation, valid endpoints are specific vertices within the original outer boundary ring that directly contact the edge plot. These points are located at the boundary between two plots and serve as reference positions for subsequent segmentation operations. For example, corner points on farmland boundaries that are adjacent to common areas.

[0059] In this embodiment, spatial adjacency refers to the state where two land parcels are directly connected in geometric space. This is manifested as sharing a portion of the boundary line or vertices, but without area overlap, conforming to the "contact" relationship in geospatial topology rules.

[0060] In this embodiment, candidate dividing lines are straight line segments extended from the original plot boundaries. An initial cutting path is formed by extending the longest side of the plot, and after spatial trimming, the remaining line segments within the edge plots are used to delineate common areas. For example, a "cutting line" extending from the farmland boundary is used to divide common areas.

[0061] In this embodiment, a closed network is a closed network structure composed of multiple interconnected line segments. All line segments are precisely connected at their endpoints to form several closed loop paths, without any breaks or isolated line segments.

[0062] In this embodiment, the line-to-surface operation is a spatial calculation process that transforms a closed linear network into polygonal surfaces. By identifying the geometric structure of closed loops, it automatically generates surface geographic features with area attributes. This process converts closed lines into solid surfaces (similar to filling a wireframe with color).

[0063] In this embodiment, topology snapping is a spatial processing technique that automatically aligns adjacent geometric elements within a preset distance tolerance. When the distance between the endpoints of a line segment is less than a set threshold (e.g., 0.1 meters), they are merged into the same node, eliminating minor geometric gaps.

[0064] In this embodiment, the segmented edge plot fragments are collections of sub-regions formed after the edge plot patches are cut. Each fragment is an independent polygonal feature, establishing a spatial correspondence with the original plots, and representing the divided common area unit (small areas formed after the common area is cut).

[0065] Implementation Method 2: Step S1 includes:

[0066] Step S1.1: Read the original land parcel layer and the edge land parcel layer, and unify the coordinate reference system;

[0067] Step S1.2: Traverse each original land parcel in the original land parcel layer, extract all boundary vertices of the outer boundary ring of each original land parcel, and generate an initial boundary vertex set;

[0068] Step S1.3: Through spatial intersection analysis, filter the boundary vertices in the initial boundary vertex set that are in contact with the edge plots, and merge the overlapping points to obtain the effective endpoint set.

[0069] In this embodiment, a simplified explanation of the actual operation of step S1 (extracting valid endpoints) is as follows:

[0070] (1) Open the farmland map (original plot layer) and the public area map (edge ​​plot layer);

[0071] (2) Find the corner points (boundary vertices) of all farmland boundaries;

[0072] (3) Only retain the corner points (valid endpoints) that are adjacent to the public area;

[0073] (4) Merge points with overlapping positions (i.e. merge coincident points, for example, points with an error of less than 1 cm are considered as the same point).

[0074] In this embodiment, a more detailed explanation of step S1 (extracting valid endpoints) is as follows:

[0075] This step extracts key boundary points (effective endpoints) that contact the edge plots from the original plots. The specific implementation is as follows:

[0076] (1) Data preparation

[0077] Read the original plot layer files (such as farmland plot vector data) and edge plot files (such as field headland vector data);

[0078] Create an empty collection container of storage points, inheriting the coordinate system (unified coordinate reference system) of the original plot.

[0079] (2) Boundary vertex acquisition

[0080] For each original land parcel:

[0081] Extract its outermost boundary contour line;

[0082] Obtain the coordinates of all turning points sequentially along the contour line;

[0083] Store each turning point in a point set.

[0084] Example: Collect 4 vertices for a rectangular plot, and collect 6 vertices for an L-shaped plot.

[0085] (3) Valid endpoint filtering

[0086] Spatial Relationship Filtering:

[0087] Compare the location of the point set with the edge plots;

[0088] Only retain points that are located exactly on the boundary line of the edge plot (neither inside nor outside);

[0089] (4) Handling of overlapping points:

[0090] Points with a spacing of less than 1 cm are considered to be coincident points;

[0091] Merge and retain a single representative point;

[0092] Output the final set of valid endpoints.

[0093] Implementation method 3: Step S2 includes:

[0094] Step S2.1: Select the patches that are in contact with the geometric boundary of the edge patch from the original patch layer to obtain the adjacent original patch subset;

[0095] Step S2.2: Traverse each patch in the adjacent original plot subset, convert the continuous vertices of the outer boundary ring of the patch into line segments, calculate the length of each line segment, and select the two line segments with the longest length as the two longest edges;

[0096] Step S2.3: For each longest edge, calculate its direction vector and normalize it. Extend the length by a preset length from the start point and the end point along the direction vector to obtain the extension line;

[0097] Step S2.4: Trim the extended line using edge parcels, retaining the line segments located inside the edge parcels as candidate dividing lines.

[0098] In this embodiment, the direction vector is determined using the following method:

[0099] Based on the valid endpoints obtained in step S1, select the longest side that has a geometric contact relationship with the valid endpoint, take the valid endpoint as the end point of the extension line, and take the other endpoint of the longest side opposite to the valid endpoint as the starting point, and construct a vector from the starting point to the ending point.

[0100] In this embodiment, a simplified explanation of the actual operation of step S2 (constructing candidate dividing lines) is as follows:

[0101] (1) Identify farmland adjacent to the public area (the subset of adjacent original plots);

[0102] (2) For each such plot of farmland:

[0103] Measure the length of all boundary edges;

[0104] Select the two longest edges;

[0105] The extension ends at the other outer boundary of the edge plot.

[0106] Only the portion extending into the public area will be retained.

[0107] In this embodiment, a more detailed explanation of step S2 (constructing candidate dividing lines) is as follows:

[0108] This step generates key line segments (candidate dividing lines) for cutting edge plots based on spatial topological relationships. The specific implementation is as follows:

[0109] (1) Screening adjacent original plots

[0110] Input the original land parcel layer and the edge land parcel layer;

[0111] Unify the coordinate system to the coordinate reference of the edge plots (if inconsistent, conversion is required);

[0112] Spatial adjacency filtering:

[0113] Only retain the original land parcels that are in direct contact with the boundary of the edge parcels (such as parcels A and B); exclude non-contact parcels (such as parcel C).

[0114] (2) Extract the longest side of the plot

[0115] For each adjacent original land parcel:

[0116] Extract its outer boundary contour line;

[0117] Break down the outline into independent line segments (e.g., break down a rectangle into 4 sides).

[0118] Measure the length of each line segment and select the two longest sides;

[0119] Example: For trapezoidal plots, select the two sloping sides; for rectangular plots, select the two long sides.

[0120] (3) Generate candidate dividing lines

[0121] For each selected long side:

[0122] Extension operation: Extend to the other outer boundary of the edge plot;

[0123] Spatial clipping: Cut the extension line with edge plots, retaining only the internal sections;

[0124] Verify the spatial correlation between the starting / ending point of the extension line and the valid endpoint of S1 (e.g., error ≤ 0.1 meters).

[0125] Merge all valid line segments to form a candidate segmentation line set.

[0126] Implementation method 4: In step S2.3, the extension of the preset length is: extended to the other outer boundary of the edge plot.

[0127] In this embodiment, for each longest edge, an extension line is generated by extending it along its direction to the other outer boundary of the edge plot. The line segments located inside the edge plot are then trimmed and retained as candidate dividing lines.

[0128] Implementation method 5: Step S3 includes:

[0129] Step S3.1: Extract the boundary lines of the edge plots and merge them with the candidate segmentation lines to form a closed grid;

[0130] Step S3.2: Perform topology capture within the preset tolerance range to close the geometric gaps in the wireframe;

[0131] Step S3.3: Convert the closed mesh into surface features to generate candidate segmentation surfaces;

[0132] Step S3.4: Filter out candidate segmentation surfaces with an area less than or equal to zero or with illegal geometry to obtain segmented edge plot fragments.

[0133] In this embodiment, a simplified explanation of the actual operation of step S3 (generating the segmentation surface) is as follows:

[0134] (1) Merge the boundary line of the public area with the cutting line from step 2;

[0135] (2) Automatically connect wire ends with a spacing of less than 10 cm (topology capture);

[0136] (3) Convert the closed wireframe into a solid area (line to surface);

[0137] (4) Remove invalid areas that are too small (<0.01㎡) or have irregular shapes.

[0138] In this embodiment, a more detailed explanation of step S3 (generating the segmentation surface) is as follows:

[0139] This step merges the dividing line with the boundary of the edge plot to create a closed dividing area, as detailed below:

[0140] (1) Constructing a closed-loop network

[0141] Extract the complete boundary lines of edge plots (e.g., extract 4 sides of a rectangular plot).

[0142] Merge the boundary lines with the candidate segmentation lines generated by S2 into a unified line set;

[0143] Key operations:

[0144] Coordinate system consistency check (consistent with edge plots);

[0145] Precise alignment of line segment endpoints (automatic connection with an error ≤ 0.1 meters).

[0146] (2) Topology closure processing

[0147] Geometric gap closure:

[0148] Use the topology "snap" operation to automatically connect breakpoints with a spacing within a specified tolerance range (such as less than 10 cm) to eliminate tiny cracks;

[0149] Ring structure generation:

[0150] The connected wire network is broken down into several closed loops.

[0151] (3) Region generation and filtering

[0152] Line to surface conversion:

[0153] Transform each closed loop into an independent polygonal region;

[0154] Validity filtering:

[0155] Remove fragments with an area of ​​less than 1 square meter;

[0156] Exclude illegal geometric shapes such as self-intersections and holes;

[0157] Output the final set of split faces.

[0158] Implementation method 6: Step S4 includes:

[0159] Calculate the boundary distance between each edge parcel fragment and each patch in the adjacent original parcel subset, and assign the edge parcel fragment to the nearest original parcel patch.

[0160] In this embodiment, a simplified explanation of the actual operation of step S4 (spatial affiliation merging) is as follows:

[0161] (1) Calculate the distance from each subdivided area to each farmland;

[0162] (2) Allocate the small area to the nearest farmland to form a "farmland-affiliated area" correspondence table.

[0163] In this embodiment, a more detailed explanation of step S4 (spatial affiliation merging) is as follows:

[0164] This step precisely links the segmented edge plots to their corresponding original plots, establishing a "main plot - subordinate plot" property rights mapping relationship. The specific implementation is as follows:

[0165] (1) Scope of Attribution

[0166] The attribution operation is performed only on the subset of adjacent original plots filtered by S2.1 (not all plots).

[0167] Example: Only process plots A / B that are in direct contact with edge plots, excluding plot C.

[0168] (2) Spatial proximity calculation

[0169] For each edge parcel segment:

[0170] Calculate the shortest distance between its boundary line and the boundary lines of each adjacent original plot.

[0171] (Non-centroid distance, prioritizing boundary alignment)

[0172] (3) Rules for determining ownership

[0173] Shortest distance matching:

[0174] Assign the fragment to the nearest original plot;

[0175] Isometric Conflict Handling:

[0176] If the distances to multiple plots are equal (as shown in the figure), they are allocated according to the proportion of the shared boundary length.

[0177] (4) Output of property rights relationship: Generate a plot-fragment association table.

[0178] In this embodiment, the method achieves precise cutting and ownership of edge plots (land boundaries) through a series of spatial geometric processing steps.

[0179] First, by "extracting all boundary vertices of the outer boundary ring of each original land parcel" and "extracting the boundary lines of edge land parcels", the original land parcels and the land head areas are converted from polygon layers to line layers respectively, making their boundary structures explicit. This eliminates the need for a complete polygon-to-line conversion operation, reduces redundant calculations, and facilitates subsequent spatial analysis.

[0180] Secondly, by "filtering boundary vertices through spatial intersection analysis", the two line layers are broken to ensure that clear nodes are formed at the boundary intersection, so as to support high-precision intersection point extraction.

[0181] Secondly, by merging overlapping points, after the initial intersection point is extracted, the effective cutting points that actually fall in the field area are further screened out, and redundant interference points are eliminated.

[0182] Next, using these valid intersections as a reference, dividing lines are constructed along the common edge of the plots, and cutting paths are formed by geometric extension.

[0183] Finally, the dividing line and the original land boundary line are combined to construct a closed polygon, achieving complete division of the land. The divided segments are then assigned to corresponding plots based on spatial proximity, thus achieving the goal of matching land with plots one by one.

[0184] Implementation Method 7: A device for precise cutting and assigning of edge plots based on the extension line of the plot boundary, the device comprising the following modules:

[0185] Module S1: Extract valid endpoints: Read the original land parcel layer and the edge land parcel layer, extract all boundary vertices of the outer boundary ring of the original land parcel, and retain the boundary vertices that are in contact with the edge land parcel as valid endpoints through spatial filtering;

[0186] Module S2: Constructing candidate dividing lines: Based on spatial adjacency, filter the original land parcels that are in contact with the edge land parcels to obtain a subset of adjacent original land parcels; traverse each parcel in the subset of adjacent original land parcels and extract the two longest edges of each parcel; extend each longest edge along its direction by a preset length to generate an extension line, and trim and retain the line segments located inside the edge land parcels as candidate dividing lines;

[0187] Module S3: Generate Segmentation Surfaces: Merge the boundary lines of edge parcels with candidate segmentation lines to form a closed mesh; use topological capture to close geometric gaps and perform line-to-surface conversion to generate closed polygons; filter invalid surfaces to obtain segmented edge parcel fragments;

[0188] Module S4: Spatial Attribution and Merging: Based on spatial proximity, the segmented edge plots are assigned to the corresponding original plots.

[0189] Implementation Method 8: A computer device, comprising: a processor and a memory, the memory for storing executable instructions of the processor, the processor being configured to execute the method for precise cutting and attribution of edge plots based on the extension line of the plot boundary as described above by executing the executable instructions.

[0190] Implementation Method 9: A computer storage medium storing a computer program, wherein when the computer program is executed, it performs the method for precise cutting and attribution of edge plots based on the extension line of the plot boundary as described in any one of the above embodiments.

[0191] Implementation Method 10: A computer program product, comprising a computer program / instruction, which, when executed by a processor, implements the steps of the method for precise cutting and attribution of edge plots based on the extension line of the plot boundary as described in any one of the above embodiments.

[0192] This embodiment provides a computer device or system. The hardware device in this part is a general model and is not shown in the figure. The system includes a processor and a memory, wherein the processor and the memory can be connected by a bus or other means. The memory, as a non-transitory computer-readable storage medium, can be used to store non-transitory software programs, non-transitory computer-executable programs and modules, as well as corresponding program instructions / modules. The processor executes various functional applications and data processing by running the non-transitory software programs, instructions and modules stored in the memory, so as to realize the data quality enhancement method for data space entity parsing in the above method embodiment.

[0193] The memory may include a program storage area and a data storage area, wherein the program storage area may store the operating system and applications required for at least one function; the data storage area may store data created by the processor, etc. Furthermore, the memory may include high-speed random access memory and may also include non-transitory memory, such as at least one disk storage device, flash memory device, or other non-transitory solid-state storage device. In some embodiments, the memory may optionally include memory remotely located relative to the processor, which can be connected to the processor via a network. Examples of such networks include, but are not limited to, the Internet, corporate intranets, mobile communication networks, and combinations thereof.

[0194] One or more modules are stored in the memory. When the processor executes, it performs the method steps in the embodiments. In this way, the invention objective can be achieved through the method, apparatus and process of the present invention. The specific details of the computer device described above can be understood by referring to the relevant descriptions and effects in the embodiments, and will not be repeated here.

[0195] Those skilled in the art will understand that implementing all or part of the processes in the above embodiments can be accomplished by a computer program instructing related hardware. The program can be stored in a computer-readable storage medium, and when executed, it can include the processes of the embodiments of the above methods. The storage medium can be a magnetic disk, optical disk, read-only memory (ROM), random access memory (RAM), flash memory, hard disk drive (HDD), or solid-state drive (SSD), etc.; the storage medium can also include combinations of the above types of memory.

[0196] The above description of several specific embodiments further details the technical solution provided by the present invention in order to highlight the advantages and benefits of the technical solution provided by the present invention. However, the above-described specific embodiments are not intended to limit the present invention. Any reasonable modifications and improvements to the present invention, reasonable combinations of embodiments, and equivalent substitutions based on the spirit and principles of the present invention should be included within the protection scope of the present invention.

Claims

1. A method for precise cutting and attribution of edge plots based on the extension line of plot boundaries, characterized in that, The method includes the following steps: Step S1: Extract valid endpoints: Read the original parcel layer and the edge parcel layer, extract all boundary vertices of the outer boundary ring of the original parcel, and retain the boundary vertices that are in contact with the edge parcel as valid endpoints through spatial filtering; Step S2: Construct candidate dividing lines: Based on spatial adjacency, filter the original land parcels that are in contact with the edge land parcels to obtain a subset of adjacent original land parcels; traverse each parcel in the subset of adjacent original land parcels and extract the two longest edges of each parcel; for each longest edge, extend it by a preset length along its direction with the effective endpoint as the reference to generate an extension line, and trim and retain the line segments located inside the edge land parcels as candidate dividing lines; Step S3: Generate segmentation surfaces: Merge the boundary lines of edge plots with candidate segmentation lines to form a closed mesh; use topological capture to close geometric gaps and perform line-to-surface conversion to generate closed polygons; filter invalid surfaces to obtain segmented edge plot fragments; Step S4: Spatial Attribution and Merging: Based on spatial proximity, the segmented edge plots are assigned to their corresponding original plot patches; Step S1 includes: Step S1.1: Read the original land parcel layer and the edge land parcel layer, and unify the coordinate reference system; Step S1.2: Traverse each original land parcel in the original land parcel layer, extract all boundary vertices of the outer boundary ring of each original land parcel, and generate an initial boundary vertex set; Step S1.3: Through spatial intersection analysis, filter the boundary vertices in the initial boundary vertex set that are in contact with the edge plots, and merge the overlapping points to obtain the effective endpoint set; Step S2 includes: Step S2.1: Select the patches that are in contact with the geometric boundary of the edge patch from the original patch layer to obtain the adjacent original patch subset; Step S2.2: Traverse each patch in the adjacent original plot subset, convert the continuous vertices of the outer boundary ring of the patch into line segments, calculate the length of each line segment, and select the two line segments with the longest length as the two longest edges; Step S2.3: For each longest edge, calculate its direction vector and normalize it. Extend the length by a preset length from the start point and the end point along the direction vector to obtain the extension line; Step S2.4: Trim the extended line using edge parcels, retaining the line segments located inside the edge parcels as candidate dividing lines; In step S2.3, the direction vector is determined using the following method: Based on the valid endpoints obtained in step S1, select the longest side that has a geometric contact relationship with the valid endpoint, take the valid endpoint as the end point of the extension line, and take the other endpoint of the longest side opposite to the valid endpoint as the starting point, and construct a vector from the starting point to the ending point.

2. The method for precise cutting and attribution of edge plots based on the extension line of the plot boundary as described in claim 1, characterized in that, In step S2.3, the extended preset length is: extended to the other outer boundary of the edge plot.

3. The method for precise cutting and attribution of edge plots based on the extension line of the plot boundary as described in claim 2, characterized in that, Step S3 includes: Step S3.1: Extract the boundary lines of the edge plots and merge them with the candidate segmentation lines to form a closed grid; Step S3.2: Perform topology capture within the preset tolerance range to close the geometric gaps in the wireframe; Step S3.3: Convert the closed mesh into surface features to generate candidate segmentation surfaces; Step S3.4: Filter out candidate segmentation surfaces with an area less than or equal to zero or with illegal geometry to obtain segmented edge plot fragments.

4. The method for precise cutting and attribution of edge plots based on the extension line of the plot boundary as described in claim 3, characterized in that, Step S4 includes: Calculate the boundary distance between each edge parcel fragment and each patch in the adjacent original parcel subset, and assign the edge parcel fragment to the nearest original parcel patch.

5. A device for precise cutting and assigning ownership of edge plots based on the extension line of the plot boundary, characterized in that, The device includes the following modules: Module S1: Extract valid endpoints: Read the original land parcel layer and the edge land parcel layer, extract all boundary vertices of the outer boundary ring of the original land parcel, and retain the boundary vertices that are in contact with the edge land parcel as valid endpoints through spatial filtering; Module S2: Constructing candidate dividing lines: Based on spatial adjacency, filter the original land parcels that are in contact with the edge land parcels to obtain a subset of adjacent original land parcels; traverse each parcel in the subset of adjacent original land parcels and extract the two longest edges of each parcel; for each longest edge, extend it by a preset length along its direction with the effective endpoint as the reference to generate an extension line, and trim and retain the line segments located inside the edge land parcels as candidate dividing lines; Module S3: Generate Segmentation Surface: Merge the boundary lines of edge plots with candidate segmentation lines to form a closed mesh; By capturing closed geometric gaps through topology, a line-to-surface operation is performed to generate closed polygons; invalid faces are filtered out to obtain segmented edge plots. Module S4: Spatial Attribution and Merging: Based on spatial proximity, the segmented edge plots are assigned to their corresponding original plot patches; The module S1 is used to perform the following steps: Step S1.1: Read the original land parcel layer and the edge land parcel layer, and unify the coordinate reference system; Step S1.2: Traverse each original land parcel in the original land parcel layer, extract all boundary vertices of the outer boundary ring of each original land parcel, and generate an initial boundary vertex set; Step S1.3: Through spatial intersection analysis, filter the boundary vertices in the initial boundary vertex set that are in contact with the edge plots, and merge the overlapping points to obtain the effective endpoint set; The module S2 is used to perform the following steps: Step S2.1: Select the patches that are in contact with the geometric boundary of the edge patch from the original patch layer to obtain the adjacent original patch subset; Step S2.2: Traverse each patch in the adjacent original plot subset, convert the continuous vertices of the outer boundary ring of the patch into line segments, calculate the length of each line segment, and select the two line segments with the longest length as the two longest edges; Step S2.3: For each longest edge, calculate its direction vector and normalize it. Extend the length by a preset length from the start point and the end point along the direction vector to obtain the extension line; Step S2.4: Trim the extended line using edge parcels, retaining the line segments located inside the edge parcels as candidate dividing lines; In step S2.3, the direction vector is determined using the following method: Based on the valid endpoints obtained from module S1, select the longest side that has a geometric contact relationship with the valid endpoint, take the valid endpoint as the end point of the extension line, and take the other endpoint of the longest side opposite to the valid endpoint as the starting point to construct a vector pointing from the starting point to the ending point.

6. A computer device, comprising: A processor and a memory, characterized in that the memory is used to store executable instructions of the processor, the processor being configured to execute the method for precise cutting and attribution of edge plots based on the extension line of the plot boundary as described in any one of claims 1-4 by executing the executable instructions.

7. A computer storage medium, characterized in that, The storage medium stores a computer program, which, when executed, performs the method for precise cutting and attribution of edge plots based on the extension line of the plot boundary as described in any one of claims 1-4.

8. A computer program product comprising a computer program / instructions, characterized in that, When the computer program / instruction is executed by the processor, it implements the steps of the method for precise cutting and attribution of edge plots based on the extension line of the plot boundary as described in any one of claims 1-4.

Images