CN112233131B - Method, device and equipment for dividing land block and storage medium - Google Patents

Method, device and equipment for dividing land block and storage medium Download PDF

Info

Publication number
CN112233131B
CN112233131B CN202011140523.8A CN202011140523A CN112233131B CN 112233131 B CN112233131 B CN 112233131B CN 202011140523 A CN202011140523 A CN 202011140523A CN 112233131 B CN112233131 B CN 112233131B
Authority
CN
China
Prior art keywords
boundary point
boundary
point set
convex hull
key
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN202011140523.8A
Other languages
Chinese (zh)
Other versions
CN112233131A (en
Inventor
朱俊星
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Guangzhou Xaircraft Technology Co Ltd
Original Assignee
Guangzhou Xaircraft Technology Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Guangzhou Xaircraft Technology Co Ltd filed Critical Guangzhou Xaircraft Technology Co Ltd
Priority to CN202011140523.8A priority Critical patent/CN112233131B/en
Publication of CN112233131A publication Critical patent/CN112233131A/en
Application granted granted Critical
Publication of CN112233131B publication Critical patent/CN112233131B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T7/00—Image analysis
    • G06T7/10—Segmentation; Edge detection
    • G06T7/11—Region-based segmentation
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T7/00—Image analysis
    • G06T7/10—Segmentation; Edge detection
    • G06T7/12—Edge-based segmentation
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T2207/00—Indexing scheme for image analysis or image enhancement
    • G06T2207/20—Special algorithmic details
    • G06T2207/20021—Dividing image into blocks, subimages or windows
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T2207/00—Indexing scheme for image analysis or image enhancement
    • G06T2207/20—Special algorithmic details
    • G06T2207/20112—Image segmentation details
    • G06T2207/20164—Salient point detection; Corner detection

Abstract

The embodiment of the invention discloses a method, a device and equipment for dividing a block and a storage medium. Wherein, the method comprises the following steps: acquiring a boundary point set of a land parcel to be operated; determining a convex hull boundary point set corresponding to the boundary point set; determining a marked boundary point set corresponding to the boundary point set according to a preset boundary point marking rule; determining a key boundary point set corresponding to the boundary point set according to a preset key boundary point determination rule, the convex hull boundary point set and the marked boundary point set; and using a land parcel segmentation algorithm to segment the land parcel to be operated according to the key boundary point set to obtain each segmented sub-land parcel. According to the method and the device, the land parcel segmentation algorithm can be used for segmenting the land parcel to be operated according to the boundary points in the key boundary point set, and the number of the boundary points which need to be traversed by the land parcel segmentation algorithm is reduced, so that the calculation time of the land parcel segmentation algorithm is reduced, and the time cost of land parcel segmentation is reduced.

Description

Method, device and equipment for dividing land block and storage medium
Technical Field
The embodiment of the invention relates to an unmanned aerial vehicle technology, in particular to a method, a device, equipment and a storage medium for dividing a land parcel.
Background
In the unmanned aerial vehicle field, unmanned aerial vehicle is usually sprayed the operation by the demand under the landmass of different shapes to crops. Under the influence of factors such as the cruising ability of the unmanned aerial vehicle, the control range and the like, the area of a plot covered by one route of the unmanned aerial vehicle cannot be overlarge, and generally, if the plot has a large area, the plot needs to be divided into a plurality of sub-plots, and then route planning is carried out.
In the prior art, all boundary points of a land parcel are generally traversed and calculated through a land parcel segmentation algorithm, so that the best cutting mode is obtained. The calculation time of the land parcel segmentation algorithm is positively correlated with the number of boundary points of the land parcel. Therefore, when the number of the boundary points of the land parcel is very large, the calculation time is very long, and the time cost for dividing the land parcel is increased.
Disclosure of Invention
The embodiment of the invention provides a method, a device, equipment and a storage medium for land parcel segmentation, which are used for optimizing a land parcel segmentation scheme and reducing the time cost of land parcel segmentation.
In a first aspect, an embodiment of the present invention provides a method for dividing a block, including:
acquiring a boundary point set of a land parcel to be operated;
determining a convex hull boundary point set corresponding to the boundary point set;
determining a marked boundary point set corresponding to the boundary point set according to a preset boundary point marking rule;
determining a key boundary point set corresponding to the boundary point set according to a preset key boundary point determination rule, the convex hull boundary point set and the marked boundary point set;
and (4) dividing the land parcel to be operated according to the key boundary point set by using a land parcel division algorithm to obtain each divided sub-land parcel.
In a second aspect, an embodiment of the present invention further provides a block segmentation apparatus, including:
the system comprises a set acquisition module, a processing module and a display module, wherein the set acquisition module is used for acquiring a boundary point set of a land parcel to be operated;
the first set determining module is used for determining a convex hull boundary point set corresponding to the boundary point set;
the second set determining module is used for determining a marked boundary point set corresponding to the boundary point set according to a preset boundary point marking rule;
the third set determining module is used for determining a key boundary point set corresponding to the boundary point set according to a preset key boundary point determining rule, the convex hull boundary point set and the marked boundary point set;
and the land parcel segmentation module is used for segmenting the land parcel to be operated according to the key boundary point set by using a land parcel segmentation algorithm to obtain each segmented sub-land parcel.
In a third aspect, an embodiment of the present invention further provides a computer device, which includes a memory, a processor, and a computer program stored in the memory and executable on the processor, and when the processor executes the computer program, the method for dividing a land block according to an embodiment of the present invention is implemented.
In a fourth aspect, an embodiment of the present invention further provides a computer-readable storage medium, on which a computer program is stored, where the computer program, when executed by a processor, implements the method for dividing a parcel according to an embodiment of the present invention.
According to the technical scheme, the boundary point set of the land parcel to be operated is obtained, the convex hull boundary point set corresponding to the boundary point set is determined, the marked boundary point set corresponding to the boundary point set is determined according to the preset boundary point marking rule, the convex hull boundary point set and the marked boundary point set are determined according to the preset key boundary points, the key boundary point set corresponding to the boundary point set is determined, finally, a land parcel segmentation algorithm is used for segmenting the land parcel to be operated according to the key boundary point set to obtain each segmented sub land parcel, the key boundary point set corresponding to the boundary point set is determined according to the preset key boundary point determination rule, the convex hull boundary point set and the marked boundary point set, key divisible points in the boundary point set are identified, the land parcel segmentation algorithm can be used for segmenting the land parcel to be operated according to the boundary points in the key boundary point set, the number of the boundary points needing to be traversed by the land parcel segmentation algorithm is reduced, and the calculation time cost of the land parcel segmentation algorithm is reduced.
Drawings
Fig. 1a is a flowchart of a method for dividing a block according to an embodiment of the present invention.
Fig. 1b is a schematic view of a land to be worked according to an embodiment of the present invention.
Fig. 1c is a schematic diagram of a convex hull of a boundary point set of a land parcel to be worked according to an embodiment of the present invention.
Fig. 1d is a schematic diagram of a tangent line segment corresponding to a boundary point according to an embodiment of the present invention.
Fig. 1e is a schematic diagram of a marked boundary point set according to an embodiment of the present invention.
Fig. 1f is a schematic diagram of a two-dimensional coordinate system according to an embodiment of the present invention.
Fig. 1g is a schematic diagram of a boundary line segment according to an embodiment of the present invention.
Fig. 1h is a schematic diagram of a set of key boundary points according to an embodiment of the present invention.
Fig. 1i is a schematic diagram of a sub-plot according to a first embodiment of the present invention.
Fig. 2 is a flowchart of a method for dividing a block according to a second embodiment of the present invention.
Fig. 3 is a schematic structural diagram of a block segmentation apparatus according to a third embodiment of the present invention.
Fig. 4 is a schematic structural diagram of a computer device according to a fourth embodiment of the present invention.
Detailed Description
The present invention will be described in further detail with reference to the accompanying drawings and examples. It is to be understood that the specific embodiments described herein are merely illustrative of the invention and are not limiting of the invention.
It should be further noted that, for the convenience of description, only some but not all of the relevant aspects of the present invention are shown in the drawings. Before discussing exemplary embodiments in greater detail, it should be noted that some exemplary embodiments are described as processes or methods depicted as flowcharts. Although a flowchart may describe the operations (or steps) as a sequential process, many of the operations can be performed in parallel, concurrently or simultaneously. In addition, the order of the operations may be re-arranged. The process may be terminated when its operations are completed, but could have additional steps not included in the figure. The processes may correspond to methods, functions, procedures, subroutines, and the like.
Example one
Fig. 1a is a flowchart of a block segmentation method according to an embodiment of the present invention. The embodiment of the invention can be suitable for the condition of dividing the land parcel. The method can be executed by the land parcel segmentation apparatus provided by the embodiment of the invention, and the apparatus can be implemented by software and/or hardware, and can be generally integrated in computer equipment. As shown in fig. 1a, the method of the embodiment of the present invention specifically includes:
step 101, acquiring a boundary point set of a land parcel to be operated.
In this embodiment, the plot of waiting to operate is the plot that unmanned aerial vehicle needs the operation. The boundary point set of the land parcel to be worked comprises the boundary point coordinates of the land parcel to be worked. Optionally, the boundary point coordinates are longitude and latitude of the boundary point.
In an embodiment, fig. 1b is a schematic diagram of a land to be worked according to an embodiment of the present invention. The land parcel 11 to be operated is a land parcel which needs to be operated by the unmanned aerial vehicle.
And 102, determining a convex hull boundary point set corresponding to the boundary point set.
Optionally, determining the convex hull boundary point set corresponding to the boundary point set includes: and determining a convex hull boundary point set corresponding to the boundary point set by using a plane point set convex hull algorithm.
In a specific example, a boundary point set of the land parcel to be worked 11 shown in fig. 1b is obtained, and a convex hull boundary point set corresponding to the boundary point set of the land parcel to be worked 11 is determined by using a plane point set convex hull algorithm. As shown in fig. 1c, the polygon formed by the boundary point coordinates in the convex hull boundary point set corresponding to the boundary point set of the land parcel to be worked 11, i.e. the convex hull 12 which is the boundary point set of the land parcel to be worked 11, is the smallest convex polygon which encloses all the boundary points of the land parcel to be worked 11. The convex hull boundary point set corresponding to the boundary point set of the land parcel to be worked 11 includes: boundary point A 1 Boundary point coordinates of (1), boundary point A 2 Boundary point coordinates of (1), boundary point A 3 Boundary point coordinates of (1), boundary point A 4 Boundary point coordinates of (1), boundary point A 5 Boundary point coordinates of (1), boundary point A 6 Boundary point coordinates of (1), boundary point A 7 Boundary point coordinates of (1), boundary point A 8 Boundary point coordinates of (1), boundary point A 9 Boundary point coordinates of (1), boundary point A 10 Boundary point coordinates of (1), boundary point A 11 Boundary point coordinates and boundary point a 12 The boundary point coordinates of (2).
And 103, determining a marked boundary point set corresponding to the boundary point set according to a preset boundary point marking rule.
Optionally, determining a marked boundary point set corresponding to the boundary point set according to a preset boundary point marking rule, where the determining includes: for each boundary point in the set of boundary points, performing the following operations: making a tangent line of the boundary point to obtain a tangent line segment corresponding to the boundary point; judging whether the tangent line segment is positioned in the land to be operated; and if the tangent line segment is positioned in the land parcel to be operated, determining that the boundary point is a marked boundary point, and adding the boundary point into a marked boundary point set corresponding to the boundary point set.
Optionally, after determining whether the tangent line segment is located in the land parcel to be worked, the method further includes: and if the tangent line segment is not positioned in the land parcel to be operated, determining that the boundary point is not the marked boundary point.
In one embodiment, as shown in fig. 1d, a tangent line of the boundary point M is drawn for the boundary point M in the boundary point set of the land parcel to be worked 11, and a line segment M with the boundary point M as the center point and a set length is cut from the tangent line of the boundary point M 1 M 2 And is taken as a tangent line segment corresponding to the boundary point M. Tangent line segment M 1 M 2 And if the boundary point M is located in the land parcel to be worked 11, determining that the boundary point M is a marked boundary point, and adding the boundary point M into a marked boundary point set corresponding to the boundary point set. Drawing a tangent line of the boundary point N aiming at the boundary point N in the boundary point set of the land parcel 11 to be operated, and intercepting a line segment N with a set length and taking the boundary point N as a central point from the tangent line of the boundary point N 1 N 2 And is used as a tangent line segment corresponding to the boundary point N. Tangent line segment N 1 N 2 And if the tangent line segment is not positioned in the land parcel to be worked 11, determining that the boundary point N is not a marked boundary point.
In an embodiment, fig. 1e is a schematic diagram of a marked boundary point set according to an embodiment of the present invention. The marked boundary point set corresponding to the boundary point set of the land parcel to be worked 11 shown in fig. 1b, which is determined according to the preset boundary point marking rule, comprises: boundary point B 1 Boundary point coordinates of (1), boundary point B 2 Boundary point coordinates of (1), boundary point B 3 Boundary point coordinates of (1), boundary point B 4 Boundary point coordinates of (1), boundary point B 5 Boundary point coordinates of (1), boundary point B 6 Boundary point coordinates of (1), boundary point B 7 Boundary point coordinates of (2), boundary point B 8 Boundary point coordinates of (1), boundary point B 9 Boundary point coordinates of (2), boundary point B 10 Boundary point coordinates of (1), boundary point B 11 Boundary point coordinates of (1), boundary point B 12 Boundary point coordinates of (1), boundary point B 13 Boundary point coordinates ofAnd boundary point B 14 The boundary point coordinates of (2).
And 104, determining a key boundary point set corresponding to the boundary point set according to a preset key boundary point determination rule, the convex hull boundary point set and the marked boundary point set.
Optionally, determining a key boundary point set corresponding to the boundary point set according to a preset key boundary point determination rule, a convex hull boundary point set and a marked boundary point set, includes: sequentially acquiring two convex hull boundary points in a convex hull boundary point set as a first convex hull boundary point and a second convex hull boundary point; connecting the first convex hull boundary point and the second convex hull boundary point to obtain a convex hull line segment, and establishing a two-dimensional coordinate system by taking the convex hull line segment as a transverse axis; acquiring boundary points between the first convex hull boundary points and the second convex hull boundary points in the boundary point set as boundary points to be determined, and generating a boundary point set to be determined corresponding to the first convex hull boundary points and the second convex hull boundary points; determining rules and marking boundary point sets according to preset key boundary points, acquiring key boundary points in the boundary point sets to be determined, and adding the key boundary points to the key boundary point sets corresponding to the boundary point sets; and returning to execute the operation of sequentially acquiring two convex hull boundary points in the convex hull boundary point set as the first convex hull boundary point and the second convex hull boundary point until the processing of all convex hull boundary points in the convex hull boundary point set is completed.
In one embodiment, as shown in fig. 1c, the convex hull boundary point set corresponding to the boundary point set of the land parcel to be worked 11 includes: boundary point A 1 Boundary point coordinates of (1), boundary point A 2 Boundary point coordinates of (1), boundary point A 3 Boundary point coordinates of (1), boundary point A 4 Boundary point coordinates of (1), boundary point A 5 Boundary point coordinates of (1), boundary point A 6 Boundary point coordinates of (2), boundary point A 7 Boundary point coordinates of (2), boundary point A 8 Boundary point coordinates of (1), boundary point A 9 Boundary point coordinates of (2), boundary point A 10 Boundary point coordinates of (1), boundary point A 11 Boundary point coordinates and boundary point A 12 The boundary point coordinates of (2). First, boundary point A is obtained 1 And boundary pointsA 2 Processing as a first convex hull boundary point and a second convex hull boundary point, and then obtaining a boundary point A 2 And boundary point A 3 Processing as a first convex hull boundary point and a second convex hull boundary point, and then acquiring a boundary point A 3 And boundary point A 4 Processing as a first convex hull boundary point and a second convex hull boundary point until a boundary point A is obtained 12 And boundary point A 1 And after the boundary points are used as the first convex hull boundary points and the second convex hull boundary points for processing, finishing the processing of all convex hull boundary points in the convex hull boundary point set.
Optionally, obtaining a key boundary point in the boundary point set to be determined according to a preset key boundary point determination rule and a marked boundary point set, and adding the key boundary point to a key boundary point set corresponding to the boundary point set, includes: for each boundary point in the set of boundary points to be determined, performing the following operations: judging whether the boundary point belongs to a marked boundary point set or not; if the boundary point belongs to the marked boundary point set, determining the direction of a line segment between the boundary point and the last boundary point in the boundary point set to be determined in a two-dimensional coordinate system, and recording the direction as a first direction; in a two-dimensional coordinate system, determining the direction of a line segment between a boundary point and the next boundary point of the boundary point in the boundary point set to be determined, and marking the direction as a second direction; judging whether the first direction and the second direction are positive and negative; and if the first direction and the second direction are positive and negative, determining that the boundary point is a key boundary point, and adding the key boundary point to a key boundary point set corresponding to the boundary point set.
Optionally, the boundary points in the set of boundary points to be determined are sorted in advance, the boundary point adjacent to the first convex hull boundary point is taken as the first boundary point in the set of boundary points to be determined, and the boundary point adjacent to the second convex hull boundary point is taken as the last boundary point. The last boundary point of the first boundary point is the first convex hull boundary point. The next boundary point of the last boundary point is the second convex hull boundary point.
Optionally, it is determined whether the first direction and the second direction are positive or negative, that is, whether one of the first direction and the second direction is a positive value and the other is a negative value. If the first direction is positive and the second direction is negative, the first direction and the second direction are positive and negative. If the second direction is a positive value and the first direction is a negative value, the first direction and the second direction are mutually positive and negative. If the first direction and the second direction are both positive values, the first direction and the second direction are not positive or negative with respect to each other. If the first direction and the second direction are both negative values, the first direction and the second direction are not positive or negative with respect to each other.
Optionally, after determining whether the boundary point belongs to the marked boundary point set, the method further includes: if the boundary point does not belong to the set of labeled boundary points, then the boundary point is determined not to be a critical boundary point.
Optionally, after determining whether the first direction and the second direction are positive or negative, the method further includes: and if the first direction and the second direction are not positive and negative, determining that the boundary point is not a key boundary point.
In one embodiment, the boundary point A in the convex hull boundary point set corresponding to the boundary point set of the land parcel to be worked 11 as shown in FIG. 1c is obtained 5 And boundary point A 6 As first and second convex hull boundary points. Connecting boundary points A 5 And boundary point A 6 To obtain a convex hull line segment A 5 A 6 And a convex hull line segment A 5 A 6 For the horizontal axis, a two-dimensional coordinate system is established. As shown in fig. 1f, the two-dimensional coordinate system is represented by boundary point a 5 Using convex hull line segment A as origin 5 A 6 Is a horizontal axis (x axis) perpendicular to the convex hull line segment A 5 A 6 And crosses the boundary point A 5 Is the longitudinal axis (y-axis). In the two-dimensional coordinate system, if the start-stop quadrant of the straight line where the target line segment is located is the first quadrant and the third quadrant of the two-dimensional coordinate system, the direction of the line segment is a positive value; and if the start-stop quadrant of the straight line where the target line segment is located is the second quadrant and the fourth quadrant of the two-dimensional coordinate system, the direction of the line segment is a negative value. Line segment QA 5 Is a negative value, line segment A 5 The direction of E is positive. Acquiring the boundary point A in the boundary point set of the land parcel to be worked 11 shown in FIG. 1c 5 And boundary point A 6 The boundary point between them is used as the boundary point to be determined, andboundary point A 5 And boundary point A 6 And correspondingly, collecting the boundary points to be determined. As shown in FIG. 1g, the boundary point A is located in the boundary point set of the land 11 to be worked 5 And boundary point A 6 The boundary point between, on the boundary line segment 13 of the land mass 11 to be worked.
In a specific example, as shown in fig. 1h, according to a preset key boundary point determination rule, a convex hull boundary point set, and a marked boundary point set, determining a key boundary point set corresponding to the boundary point set of the to-be-worked parcel 11 as shown in fig. 1b includes: boundary point D 1 Boundary point coordinates of (1), boundary point D 2 Boundary point coordinates of (1), boundary point D 3 Boundary point coordinates of (1), boundary point D 4 Boundary point coordinates of (1), boundary point D 5 Boundary point coordinates of (1), boundary point D 6 Boundary point coordinates of (1), boundary point D 7 Boundary point coordinates and boundary point D 8 The boundary point coordinates of (2).
And 105, segmenting the land parcel to be operated according to the key boundary point set by using a land parcel segmentation algorithm to obtain each segmented sub land parcel.
Optionally, a land parcel segmentation algorithm is used to segment the land parcel to be operated according to the set of key boundary points, so as to obtain each segmented sub-land parcel, including: determining a minimum width circumscribed rectangle corresponding to the land parcel to be operated according to any one boundary point coordinate in the key boundary point set; determining the flight direction of the unmanned aerial vehicle based on the minimum width circumscribed rectangle; calculating a first turning frequency corresponding to a land to be operated according to the flight direction of the unmanned aerial vehicle and the pre-stored width of the unmanned aerial vehicle; determining a target partition line passing through the boundary point coordinates according to all boundary point coordinates, the flight direction of the unmanned aerial vehicle and the first turning times, and dividing the land to be operated into two sub-lands by using the target partition line, so that the sum of the turning times in the two sub-lands is less than the first turning times in the land to be operated when the unmanned aerial vehicle flies along the flight direction of the unmanned aerial vehicle; and sequentially utilizing each sub-plot to replace the plot to be operated and executing the step of acquiring the boundary information of the plot to be operated until the plot to be operated can not be divided, and obtaining each divided sub-plot.
In one embodiment, as shown in fig. 1i, a block division algorithm is used to divide the block 11 to be worked shown in fig. 1b according to the set of key boundary points, so as to obtain a first sub-block 14, a second sub-block 15 and a third sub-block 16.
The embodiment of the invention provides a land parcel segmentation method, which comprises the steps of obtaining a boundary point set of a land parcel to be operated, then determining a convex hull boundary point set corresponding to the boundary point set, determining a marked boundary point set corresponding to the boundary point set according to a preset boundary point marking rule, then determining a rule, a convex hull boundary point set and a marked boundary point set according to a preset key boundary point, determining a key boundary point set corresponding to the boundary point set, finally segmenting the land parcel to be operated according to the key boundary point set by using a land parcel segmentation algorithm to obtain each segmented sub-land parcel, determining a key boundary point set corresponding to the boundary point set according to the preset key boundary point, identifying key partible points in the boundary point set, operating the land parcel segmentation algorithm according to the boundary points in the key boundary point set, and reducing the number of boundary points required to be traversed by the land parcel segmentation algorithm, thereby reducing the calculation time of the land parcel segmentation algorithm and reducing the time cost of the land parcel segmentation algorithm.
Example two
Fig. 2 is a flowchart of a method for dividing a block according to a second embodiment of the present invention. In this embodiment of the present invention, determining a convex hull boundary point set corresponding to the boundary point set may include: and determining a convex hull boundary point set corresponding to the boundary point set by using a plane point set convex hull algorithm.
As shown in fig. 2, the method of the embodiment of the present invention specifically includes:
step 201, acquiring a boundary point set of a land parcel to be operated.
Step 202, determining a convex hull boundary point set corresponding to the boundary point set by using a convex hull algorithm of the plane point set.
In this embodiment, the convex hull algorithm of the plane point set is an algorithm for obtaining convex hull points in the plane point set. If the boundary point is a convex hull point, the boundary point coordinates of the boundary point belong to convex hull boundary point coordinates. If the boundary point is an interior point, the boundary point coordinates of the boundary point belong to non-convex hull boundary point coordinates.
The convex hull is defined as: let S be a set of points on the plane, enclosing the smallest convex polygon of all vertices in the set of points S, called the convex hull of the set of points S. For convex hull of the point set S, the points in the point set S are either convex hull points or interior points. And a polygon formed by convex hull points in the point set S is the convex hull of the point set S.
Optionally, a convex hull boundary point coordinate in the boundary point set is obtained by using a plane point set convex hull algorithm, and the convex hull boundary point coordinate is added to the convex hull boundary point set corresponding to the boundary point set.
Step 203, determining a marked boundary point set corresponding to the boundary point set according to a preset boundary point marking rule.
And 204, determining a key boundary point set corresponding to the boundary point set according to a preset key boundary point determination rule, the convex hull boundary point set and the marked boundary point set.
And step 205, dividing the to-be-operated land parcel according to the key boundary point set by using a land parcel division algorithm to obtain each divided sub-land parcel.
The embodiment of the invention provides a land parcel segmentation method, which determines a convex hull boundary point set corresponding to a boundary point set by using a plane point set convex hull algorithm and can process a land parcel to be operated into the shape of a convex hull by using the property of the convex hull.
EXAMPLE III
Fig. 3 is a schematic structural diagram of a block segmentation apparatus according to a third embodiment of the present invention. As shown in fig. 3, the apparatus includes: a set acquisition module 301, a first set determination module 302, a second set determination module 303, a third set determination module 304, and a parcel segmentation module 305.
The set acquisition module 301 is configured to acquire a boundary point set of a land parcel to be operated; a first set determining module 302, configured to determine a convex hull boundary point set corresponding to the boundary point set; a second set determining module 303, configured to determine, according to a preset boundary point marking rule, a marked boundary point set corresponding to the boundary point set; a third set determining module 304, configured to determine, according to a preset key boundary point determining rule, a convex hull boundary point set, and a marked boundary point set, a key boundary point set corresponding to the boundary point set; and a land parcel segmentation module 305, configured to segment the land parcel to be operated according to the set of key boundary points by using a land parcel segmentation algorithm, so as to obtain each segmented sub-land parcel.
The embodiment of the invention provides a block segmentation device, which is characterized in that a block to be operated is segmented according to preset key boundary point determination rules, convex hull boundary point sets and mark boundary point sets by acquiring boundary point sets of the block to be operated, determining the convex hull boundary point sets corresponding to the boundary point sets according to preset boundary point mark rules, determining the key boundary point sets corresponding to the boundary point sets according to the preset key boundary point determination rules, the convex hull boundary point sets and the mark boundary point sets, and finally, using a block segmentation algorithm to segment the block to be operated according to the key boundary point sets to obtain each segmented sub-block.
In an optional implementation manner of the embodiment of the present invention, optionally, the first set determining module 302 may include: and the convex hull point determining unit is used for determining a convex hull boundary point set corresponding to the boundary point set by using a plane point set convex hull algorithm.
In an optional implementation manner of the embodiment of the present invention, optionally, the second set determining module 303 is specifically configured to: for each boundary point in the set of boundary points, performing the following operations: making a tangent line of the boundary point to obtain a tangent line segment corresponding to the boundary point; judging whether the tangent line segment is positioned in the land parcel to be operated; and if the tangent line segment is positioned in the land parcel to be operated, determining that the boundary point is a marked boundary point, and adding the boundary point into a marked boundary point set corresponding to the boundary point set.
In an optional implementation manner of the embodiment of the present invention, optionally, the second set determining module 303 is further configured to: and if the tangent line segment is not positioned in the land parcel to be operated, determining that the boundary point is not the marked boundary point.
In an optional implementation manner of the embodiment of the present invention, optionally, the third set determining module 304 is specifically configured to: sequentially acquiring two convex hull boundary points in the convex hull boundary point set as a first convex hull boundary point and a second convex hull boundary point; connecting the first convex hull boundary point and the second convex hull boundary point to obtain a convex hull line segment, and establishing a two-dimensional coordinate system by taking the convex hull line segment as a transverse axis; acquiring boundary points between the first convex hull boundary points and the second convex hull boundary points in the boundary point set as boundary points to be determined, and generating a boundary point set to be determined corresponding to the first convex hull boundary points and the second convex hull boundary points; determining rules and marking boundary point sets according to preset key boundary points, acquiring key boundary points in the boundary point sets to be determined, and adding the key boundary points to the key boundary point sets corresponding to the boundary point sets; and returning to execute the operation of sequentially acquiring two convex hull boundary points in the convex hull boundary point set as the first convex hull boundary point and the second convex hull boundary point until the processing of all convex hull boundary points in the convex hull boundary point set is completed.
In an optional implementation manner of the embodiment of the present invention, optionally, the third set determining module 304 is specifically configured to: for each boundary point in the set of boundary points to be determined, performing the following operations: judging whether the boundary point belongs to the marked boundary point set or not; if the boundary point belongs to the marked boundary point set, determining the direction of a line segment between the boundary point and the last boundary point in the boundary point set to be determined in a two-dimensional coordinate system, and recording the direction as a first direction; in a two-dimensional coordinate system, determining the direction of a line segment between a boundary point and the next boundary point of the boundary point in the set of boundary points to be determined, and recording the direction as a second direction; judging whether the first direction and the second direction are positive or negative; and if the first direction and the second direction are positive and negative, determining that the boundary point is a key boundary point, and adding the key boundary point into a key boundary point set corresponding to the boundary point set.
In an optional implementation manner of the embodiment of the present invention, optionally, the third set determining module 304 is further configured to: if the boundary point does not belong to the marked boundary point set, determining that the boundary point is not a key boundary point; and if the first direction and the second direction are not positive and negative, determining that the boundary point is not a key boundary point.
The land parcel segmentation device can execute the land parcel segmentation method provided by any embodiment of the invention, and has corresponding functional modules and beneficial effects for executing the land parcel segmentation method.
Example four
Fig. 4 is a schematic structural diagram of a computer device according to a fourth embodiment of the present invention. FIG. 4 illustrates a block diagram of an exemplary computer device 12 suitable for use in implementing embodiments of the present invention.
The computer device 12 shown in FIG. 4 is only one example and should not bring any limitations to the functionality or scope of use of embodiments of the present invention.
As shown in FIG. 4, computer device 12 is in the form of a general purpose computer device. The components of computer device 12 may include, but are not limited to: one or more processors 16, a memory 28, and a bus 18 that couples various system components (including the memory 28 and the processors 16). The processor 16 includes, but is not limited to, an AI processor.
Bus 18 represents one or more of any of several types of bus structures, including a memory bus or memory controller, a peripheral bus, an accelerated graphics port, a processor, or a local bus using any of a variety of bus architectures. By way of example, such architectures include, but are not limited to, industry Standard Architecture (ISA) bus, micro-channel architecture (MAC) bus, enhanced ISA bus, video Electronics Standards Association (VESA) local bus, and Peripheral Component Interconnect (PCI) bus.
Computer device 12 typically includes a variety of computer system readable media. Such media may be any available media that is accessible by computer device 12 and includes both volatile and nonvolatile media, removable and non-removable media.
Memory 28 may include computer system readable media in the form of volatile memory, such as Random Access Memory (RAM) 30 and/or cache memory 32. The computer device 12 may further include other removable/non-removable, volatile/nonvolatile computer system storage media. By way of example only, storage system 34 may be used to read from and write to non-removable, nonvolatile magnetic media (not shown in FIG. 4, commonly referred to as a "hard drive"). Although not shown in FIG. 4, a magnetic disk drive for reading from and writing to a removable, nonvolatile magnetic disk (e.g., a "floppy disk") and an optical disk drive for reading from or writing to a removable, nonvolatile optical disk (e.g., a CD-ROM, DVD-ROM, or other optical media) may be provided. In these cases, each drive may be connected to bus 18 by one or more data media interfaces. Memory 28 may include at least one program product having a set (e.g., at least one) of program modules that are configured to carry out the functions of embodiments of the invention.
A program/utility 40 having a set (at least one) of program modules 42 may be stored, for example, in memory 28, such program modules 42 including, but not limited to, an operating system, one or more application programs, other program modules, and program data, each of which examples or some combination thereof may comprise an implementation of a network environment. Program modules 42 generally carry out the functions and/or methodologies of embodiments of the invention as described.
Computer device 12 may also communicate with one or more external devices 14 (e.g., keyboard, pointing device, display 24, etc.), with one or more devices that enable a user to interact with computer device 12, and/or with any devices (e.g., network card, modem, etc.) that enable computer device 12 to communicate with one or more other computing devices. Such communication may be through an input/output (I/O) interface 22. Also, computer device 12 may communicate with one or more networks (e.g., a Local Area Network (LAN), a Wide Area Network (WAN), and/or a public network such as the Internet) through network adapter 20. As shown, network adapter 20 communicates with the other modules of computer device 12 via bus 18. It should be appreciated that although not shown in FIG. 4, other hardware and/or software modules may be used in conjunction with computer device 12, including but not limited to: microcode, device drivers, redundant processing units, external disk drive arrays, RAID systems, tape drives, and data backup storage systems, to name a few.
The processor 16 of the computer device 12 executes various functional applications and data processing, such as implementing the method of land block segmentation provided by the embodiments of the present invention, by executing programs stored in the memory 28. The method specifically comprises the following steps: acquiring a boundary point set of a land parcel to be operated; determining a convex hull boundary point set corresponding to the boundary point set; determining a marked boundary point set corresponding to the boundary point set according to a preset boundary point marking rule; determining a key boundary point set corresponding to the boundary point set according to a preset key boundary point determination rule, the convex hull boundary point set and the marked boundary point set; and (4) dividing the land parcel to be operated according to the key boundary point set by using a land parcel division algorithm to obtain each divided sub-land parcel.
EXAMPLE five
Fifth embodiment of the present invention provides a computer-readable storage medium, on which a computer program is stored, where the computer program, when executed by a processor, implements the land parcel segmentation method provided in all embodiments of the present invention. The method specifically comprises the following steps: acquiring a boundary point set of a land parcel to be operated; determining a convex hull boundary point set corresponding to the boundary point set; determining a marked boundary point set corresponding to the boundary point set according to a preset boundary point marking rule; determining a key boundary point set corresponding to the boundary point set according to a preset key boundary point determination rule, the convex hull boundary point set and the marked boundary point set; and (4) dividing the land parcel to be operated according to the key boundary point set by using a land parcel division algorithm to obtain each divided sub-land parcel.
Any combination of one or more computer-readable media may be employed. The computer readable medium may be a computer readable signal medium or a computer readable storage medium. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples (a non-exhaustive list) of the computer readable storage medium would include the following: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the context of this document, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device.
A computer readable signal medium may include a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated data signal may take many forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer readable signal medium may be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device.
Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to wireless, wireline, optical fiber cable, RF, etc., or any suitable combination of the foregoing.
Computer program code for carrying out operations for aspects of the present invention may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, smalltalk, C + + or the like and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the latter scenario, the remote computer may be connected to the user's computer through any type of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet service provider).
It is to be noted that the foregoing is only illustrative of the preferred embodiments of the present invention and the technical principles employed. It will be understood by those skilled in the art that the present invention is not limited to the particular embodiments described herein, but is capable of various obvious changes, rearrangements and substitutions as will now become apparent to those skilled in the art without departing from the scope of the invention. Therefore, although the present invention has been described in greater detail by the above embodiments, the present invention is not limited to the above embodiments, and may include other equivalent embodiments without departing from the spirit of the present invention, and the scope of the present invention is determined by the scope of the appended claims.

Claims (8)

1. A method of block segmentation, comprising:
acquiring a boundary point set of a land parcel to be operated;
determining a convex hull boundary point set corresponding to the boundary point set;
determining a marked boundary point set corresponding to the boundary point set according to a preset boundary point marking rule;
determining a key boundary point set corresponding to the boundary point set according to a preset key boundary point determination rule, the convex hull boundary point set and the marked boundary point set;
dividing the land parcel to be operated according to the key boundary point set by using a land parcel division algorithm to obtain each divided sub-land parcel;
determining a key boundary point set corresponding to the boundary point set according to a preset key boundary point determination rule, the convex hull boundary point set and the marked boundary point set, including: sequentially acquiring two convex hull boundary points in the convex hull boundary point set as a first convex hull boundary point and a second convex hull boundary point; connecting the first convex hull boundary point and the second convex hull boundary point to obtain a convex hull line segment, and establishing a two-dimensional coordinate system by taking the convex hull line segment as a transverse axis; acquiring boundary points between the first convex hull boundary points and the second convex hull boundary points in the boundary point set as boundary points to be determined, and generating a boundary point set to be determined corresponding to the first convex hull boundary points and the second convex hull boundary points; acquiring key boundary points in the boundary point set to be determined according to a preset key boundary point determination rule and the marked boundary point set, and adding the key boundary points to a key boundary point set corresponding to the boundary point set; returning to execute the operation of sequentially acquiring two convex hull boundary points in the convex hull boundary point set as a first convex hull boundary point and a second convex hull boundary point until the processing of all convex hull boundary points in the convex hull boundary point set is completed;
the obtaining key boundary points in the boundary point set to be determined according to a preset key boundary point determination rule and the marked boundary point set, and adding the key boundary points to a key boundary point set corresponding to the boundary point set includes: for each boundary point in the set of boundary points to be determined, performing the following operations: judging whether the boundary point belongs to the marked boundary point set or not; if the boundary point belongs to the marked boundary point set, determining the direction of a line segment between the boundary point and the last boundary point of the boundary point in the boundary point set to be determined in the two-dimensional coordinate system, and recording the direction as a first direction; in the two-dimensional coordinate system, determining the direction of a line segment between the boundary point and the next boundary point of the boundary point in the set of boundary points to be determined, and recording the direction as a second direction; judging whether the first direction and the second direction are positive or negative; and if the first direction and the second direction are positive and negative, determining that the boundary point is a key boundary point, and adding the key boundary point to a key boundary point set corresponding to the boundary point set.
2. The method of claim 1, wherein determining the set of convex hull boundary points corresponding to the set of boundary points comprises:
and determining a convex hull boundary point set corresponding to the boundary point set by using a plane point set convex hull algorithm.
3. The method according to claim 1, wherein determining a marked boundary point set corresponding to the boundary point set according to a preset boundary point marking rule comprises:
for each boundary point in the set of boundary points, performing the following:
making a tangent line of the boundary point to obtain a tangent line segment corresponding to the boundary point;
judging whether the tangent line segment is positioned in the land parcel to be operated;
and if the tangent line segment is positioned in the land parcel to be operated, determining that the boundary point is a marked boundary point, and adding the boundary point into a marked boundary point set corresponding to the boundary point set.
4. The method as claimed in claim 3, further comprising, after determining whether the tangent line segment is located in the land parcel to be worked:
and if the tangent line segment is not positioned in the land parcel to be operated, determining that the boundary point is not a marked boundary point.
5. The method of claim 1, further comprising:
if the boundary point does not belong to the marked boundary point set, determining that the boundary point is not a key boundary point;
and if the first direction and the second direction are not positive and negative, determining that the boundary point is not a key boundary point.
6. A block segmentation apparatus, comprising:
the system comprises a set acquisition module, a processing module and a display module, wherein the set acquisition module is used for acquiring a boundary point set of a land parcel to be operated;
a first set determining module, configured to determine a convex hull boundary point set corresponding to the boundary point set;
the second set determining module is used for determining a marked boundary point set corresponding to the boundary point set according to a preset boundary point marking rule;
a third set determining module, configured to determine, according to a preset key boundary point determining rule, the convex hull boundary point set, and the marked boundary point set, a key boundary point set corresponding to the boundary point set;
the land parcel segmentation module is used for segmenting the land parcel to be operated according to the key boundary point set by using a land parcel segmentation algorithm to obtain each segmented sub-land parcel;
the third set determination module is specifically configured to: sequentially acquiring two convex hull boundary points in the convex hull boundary point set as a first convex hull boundary point and a second convex hull boundary point; connecting the first convex hull boundary point and the second convex hull boundary point to obtain a convex hull line segment, and establishing a two-dimensional coordinate system by taking the convex hull line segment as a transverse axis; acquiring boundary points between the first convex hull boundary points and the second convex hull boundary points in the boundary point set as boundary points to be determined, and generating a boundary point set to be determined corresponding to the first convex hull boundary points and the second convex hull boundary points; determining rules and marking boundary point sets according to preset key boundary points, acquiring key boundary points in the boundary point sets to be determined, and adding the key boundary points to the key boundary point sets corresponding to the boundary point sets; returning to execute the operation of sequentially acquiring two convex hull boundary points in the convex hull boundary point set as a first convex hull boundary point and a second convex hull boundary point until the processing of all convex hull boundary points in the convex hull boundary point set is completed;
the third set determining module is specifically configured to, when executing an operation of determining a rule and marking a set of boundary points according to preset key boundary points, acquiring key boundary points in the set of boundary points to be determined, and adding the key boundary points to a set of key boundary points corresponding to the set of boundary points: for each boundary point in the set of boundary points to be determined, performing the following operations: judging whether the boundary point belongs to the marked boundary point set or not; if the boundary point belongs to the marked boundary point set, determining the direction of a line segment between the boundary point and the last boundary point in the boundary point set to be determined in a two-dimensional coordinate system, and recording the direction as a first direction; in a two-dimensional coordinate system, determining the direction of a line segment between a boundary point and the next boundary point of the boundary point in the boundary point set to be determined, and marking the direction as a second direction; judging whether the first direction and the second direction are positive or negative; and if the first direction and the second direction are positive and negative, determining that the boundary point is a key boundary point, and adding the key boundary point to a key boundary point set corresponding to the boundary point set.
7. A computer arrangement comprising a memory, a processor and a computer program stored on the memory and executable on the processor, characterized in that the processor implements the method of segmentation of a parcel as claimed in any one of claims 1 to 5 when executing the computer program.
8. A computer-readable storage medium, on which a computer program is stored which, when being executed by a processor, carries out the method of segmentation of a parcel as claimed in any one of claims 1 to 5.
CN202011140523.8A 2020-10-22 2020-10-22 Method, device and equipment for dividing land block and storage medium Active CN112233131B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202011140523.8A CN112233131B (en) 2020-10-22 2020-10-22 Method, device and equipment for dividing land block and storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202011140523.8A CN112233131B (en) 2020-10-22 2020-10-22 Method, device and equipment for dividing land block and storage medium

Publications (2)

Publication Number Publication Date
CN112233131A CN112233131A (en) 2021-01-15
CN112233131B true CN112233131B (en) 2022-11-08

Family

ID=74110390

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202011140523.8A Active CN112233131B (en) 2020-10-22 2020-10-22 Method, device and equipment for dividing land block and storage medium

Country Status (1)

Country Link
CN (1) CN112233131B (en)

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103714563A (en) * 2014-01-03 2014-04-09 中南大学 Modeling method of boundary of curve type farmland operation area
CN109934384A (en) * 2019-01-28 2019-06-25 沈阳无距科技有限公司 A kind of polygon plot dividing method, device, storage medium and electronic equipment
WO2019232894A1 (en) * 2018-06-05 2019-12-12 中国石油大学(华东) Complex scene-based human body key point detection system and method
CN110675414A (en) * 2019-09-30 2020-01-10 广州极飞科技有限公司 Land parcel segmentation method and device, electronic equipment and storage medium
CN111750858A (en) * 2019-12-11 2020-10-09 广州极飞科技有限公司 Route generation method and device, electronic equipment and storage medium

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103310449B (en) * 2013-06-13 2016-03-02 沈阳航空航天大学 Based on the lung dividing method improving shape

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103714563A (en) * 2014-01-03 2014-04-09 中南大学 Modeling method of boundary of curve type farmland operation area
WO2019232894A1 (en) * 2018-06-05 2019-12-12 中国石油大学(华东) Complex scene-based human body key point detection system and method
CN109934384A (en) * 2019-01-28 2019-06-25 沈阳无距科技有限公司 A kind of polygon plot dividing method, device, storage medium and electronic equipment
CN110675414A (en) * 2019-09-30 2020-01-10 广州极飞科技有限公司 Land parcel segmentation method and device, electronic equipment and storage medium
CN111750858A (en) * 2019-12-11 2020-10-09 广州极飞科技有限公司 Route generation method and device, electronic equipment and storage medium

Also Published As

Publication number Publication date
CN112233131A (en) 2021-01-15

Similar Documents

Publication Publication Date Title
CN109974718B (en) Map matching method, apparatus, device and medium
US20190056502A1 (en) Method and apparatus for constructing reflectance map
CN110006439B (en) Map track data matching method, map track data matching device, server and storage medium
CN111695488A (en) Interest plane identification method, device, equipment and storage medium
US20210207963A1 (en) Determination of traffic checkpoint
CN112148033A (en) Method, device and equipment for determining unmanned aerial vehicle air route and storage medium
CN114003613A (en) High-precision map lane line updating method and device, electronic equipment and storage medium
CN113971723B (en) Method, device, equipment and storage medium for constructing three-dimensional map in high-precision map
CN113936232A (en) Screen fragmentation identification method, device, equipment and storage medium
CN112233131B (en) Method, device and equipment for dividing land block and storage medium
CN112379692B (en) Method, device and equipment for determining unmanned aerial vehicle air route and storage medium
CN115168527A (en) Real-time track data processing method, device and system and electronic equipment
CN113723405A (en) Method and device for determining area outline and electronic equipment
CN114494782A (en) Image processing method, model training method, related device and electronic equipment
CN114743178A (en) Road edge line generation method, device, equipment and storage medium
CN114610825A (en) Method and device for confirming associated grid set, electronic equipment and storage medium
CN114330807A (en) Route determination method and device and electronic equipment
CN110457705B (en) Method, device, equipment and storage medium for processing point of interest data
CN114111813A (en) High-precision map element updating method and device, electronic equipment and storage medium
CN113449687A (en) Identification method and device for point of interest entrance and exit and electronic equipment
CN114383600B (en) Processing method and device for map, electronic equipment and storage medium
CN113761990B (en) Road boundary detection method, device, unmanned vehicle and storage medium
CN115164914B (en) Navigation method, system, electronic equipment and medium for individual combat
CN113987098A (en) High-precision map road boundary updating method and device, electronic equipment and storage medium
CN113836358A (en) Data processing method and device, electronic equipment and storage medium

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
CB02 Change of applicant information

Address after: 510000 Block C, 115 Gaopu Road, Tianhe District, Guangzhou City, Guangdong Province

Applicant after: Guangzhou Jifei Technology Co.,Ltd.

Address before: 510000 Block C, 115 Gaopu Road, Tianhe District, Guangzhou City, Guangdong Province

Applicant before: Guangzhou Xaircraft Technology Co.,Ltd.

CB02 Change of applicant information
GR01 Patent grant
GR01 Patent grant