CN102375917B - Self-adaption fine ore delineation method based on two-dimensional cross section - Google Patents

Self-adaption fine ore delineation method based on two-dimensional cross section Download PDF

Info

Publication number
CN102375917B
CN102375917B CN201010254694.3A CN201010254694A CN102375917B CN 102375917 B CN102375917 B CN 102375917B CN 201010254694 A CN201010254694 A CN 201010254694A CN 102375917 B CN102375917 B CN 102375917B
Authority
CN
China
Prior art keywords
ore body
pinching
polygon
ore
section
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
CN201010254694.3A
Other languages
Chinese (zh)
Other versions
CN102375917A (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.)
Individual
Original Assignee
Individual
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 Individual filed Critical Individual
Priority to CN201010254694.3A priority Critical patent/CN102375917B/en
Publication of CN102375917A publication Critical patent/CN102375917A/en
Application granted granted Critical
Publication of CN102375917B publication Critical patent/CN102375917B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Landscapes

  • Toys (AREA)
  • Processing Or Creating Images (AREA)

Abstract

The invention discloses a self-adaption fine ore delineation method based on a two-dimensional cross section. The method is implemented under the conditions of the two-dimensional cross section of a three-dimensional ore body and the total attitude direction vector of a two-dimensional ore body Kij and an ore body, and the two-dimensional cross section can be a polygon with holes. The method comprises the following steps of: 1, according to the attitude direction vector of the three-dimensional ore body, generating an ore body connection relationship to acquire a connection relationship and a wedge-out relationship of n sub-ore bodies and acquire a connection relationship and a wedge-out relationship of the holes simultaneously; 2, performing monomer three-dimensional modeling on the ore body and the holes; 3, performing three-dimensional modeling on the ore body through Boolean operation to acquire a final ore body; and 4, calculating the volume, the average grade and the ore amount of the ore body. The ore delineation method can be suitable for delineating the ore body which are provided with a complicated two-dimensional cross section and has an irregular shape, and can self-adaptively delineate a two-dimensional cross section-based fine ore body without manual interference.

Description

The meticulous circle of self-adaptation ore deposit method based on two-dimensional cross-section
Technical field
The present invention relates to a kind of mineral resources be drawn a circle to approve and Reserves Evaluation method, particularly relate to the meticulous circle of a kind of self-adaptation based on two-dimensional cross-section ore deposit method.
Background technology
In mineral resources delineations and Reserves Evaluation field, conventional method comprises that the interactive approach that artificial stage body volumescope algorithm and the computer software of take provide is basic at present, calculates after adding artificially boost line and control line.
Wherein, artificial stage body volumescope algorithm adopts formula
Figure BSA00000231026700011
or formula
Figure BSA00000231026700012
calculate, be only applicable to connect subparallel section and the more regular ore body of shape, for ore body in irregular shape, be not only difficult to select computing formula, and, can not provide correct annexation, be difficult to iris out ore body.
The interactive approach that the computer software of take provides is basis, add artificially the method calculated after boost line and control line when the ore body such as complex-shaped, two sections differ greatly and multiple-limb, multi-stylus go out is drawn a circle to approve automatically, because different operating personnel are to adding the assurance disunity of boost line and control line, go out easily different conclusions.
Therefore, need a kind of delineation that can adapt to the out-of-shape ore body with complicated two-dimensional section, can in the situation that there is no manual intervention, iris out uniquely the method for ore body more accurately again.
Summary of the invention
In order to address the above problem, the present invention aims to provide a kind of delineation that can adapt to the out-of-shape ore body with complicated two-dimensional section, can in the situation that there is no manual intervention, iris out uniquely again the meticulous circle of the self-adaptation based on the two-dimensional cross-section ore deposit method of ore body.
The technical scheme of the meticulous circle of self-adaptation ore deposit method that the present invention is based on two-dimensional cross-section is as follows:
The meticulous circle of the self-adaptation ore deposit method that the present invention is based on two-dimensional cross-section is at known ore body V 1, V 2..., the two-dimensional cross-section Si (i=1 of Vn, 2 ..., two-dimentional ore body Kij (j=1 m) and in Si, 2 ..., ni) with the overall occurrence direction vector of ore body Kd (dx, dy, dz) condition under implement, wherein, Kij is with empty polygon, and the direction vector of described empty occurrence is Jd (dx, dy, dz), comprise the following steps:
S1: according to the direction vector Kd (dx, dy, dz) of occurrence, generate ore body annexation, the annexation and the pinching relation that obtain n sub-ore body are as follows:
Lj＝{Kij，Klk}，
Wherein:
L 1, L 2..., Ln is corresponding ore body V respectively 1, V 2..., Vn;
Kij, Klk belongs to respectively two ore bodies in adjacent section;
Wherein " { " representative " < " or " (" or " [", " } " representative " > " or ") " or "] ", angle brackets represent pinching rear enclosed end, and parenthesis represent not blind end of not pinching, and square bracket represent direct blind end;
Direction vector Jd (dx, dy, dz) according to empty occurrence, generates empty annexation, and the annexation and the pinching relation that obtain p son cavity are as follows:
Dj＝{Jij，Jlk}，
Wherein:
D 1, D 2dp is corresponding ore body T respectively 1, T 2..., Tp;
Jij, Jlk belongs to respectively two cavities in adjacent section, but the Dj connecting must be contained in certain ore body, connects in Vk;
Wherein " { " representative " < " or " (" or " [", " } " representative " > " or ") " or "] ", angle brackets represent pinching rear enclosed end, and parenthesis represent not blind end of not pinching, and square bracket represent direct blind end;
Figure BSA00000231026700021
S2: carry out ore body L 1, L 2ln and empty D 1, D 2..., the monomer three-dimensional modeling of Dp, obtain three-dimensional ore body Vj (j=1,2 ..n) and three-dimensional empty Tj (j=1,2 ..., p);
S3: utilize Boolean calculation to carry out three-dimensional modeling to ore body, obtain final ore body V.
S4: calculate ore body V volume, average grade and ore deposit amount.
Further, described circle ore deposit method is further comprising the steps of:
S5: ore body V is subdivided into piece section, then, inserts out the grade of each piece section, according to economic grade, ore body V is managed.
Further, in described S2, carry out L 1, L 2..., Ln and D 1, D 2..., the concrete grammar of the monomer three-dimensional modeling of Dp comprises the following steps:
S2-11: to ore body Lj={Kij, the end points polygon Kij of Klk} according to becoming ore deposit constraint to determine gradual manner, carries out polygon gradual change computing to Klk, obtains serial polygon Kij, Kij1, Kij2 ..., Kijs, Klk, utilize two-dimensional cross-section to Kij1, to arrive Kij2 to the synchronous tracing delineation Kij of three-dimensional reconstruction ..., Kijs is to the boundary surface of Klk;
S2-12: according to the two ends of pinching feature sealing Kij and Klk, concrete grammar is as follows:
If direct blind end carries out triangle division by termination polygon and can obtain end face or bottom surface;
If pinching rear enclosed end obtains the polygonal axis Z in termination and be pinching axle, with termination polygon and pinching axle, retrain triangle and be connected and can obtain end face or bottom surface; If pinching distance is longer, available peeling thinning algorithm, obtains serial refinement polygon Z1, Z2 ..., Zk, wherein last polygon Zk is pinching axle, the pinching axle of take carries out triangle division as constraint and can obtain end face or bottom surface.
S2-21: to empty Dj={Jij, the end points polygon Jij of Jlk} according to becoming ore deposit constraint to determine gradual manner, carries out polygon gradual change computing to Jlk, obtains serial polygon Jij, Jij1, Jij2 ..., Jijs, Jlk, utilize two-dimentional empty section to Jij1, to arrive Jij2 to the synchronous tracing delineation Jij of three-dimensional reconstruction ..., Jijs is to the boundary surface of Jlk;
S2-22: according to the two ends of pinching feature sealing Jij and Jlk, concrete grammar is as follows:
If direct blind end carries out triangle division by termination polygon and can obtain end face or bottom surface;
If pinching rear enclosed end obtains the polygonal axis Z in termination and be pinching axle, with termination polygon and pinching axle, retrain triangle and be connected and can obtain end face or bottom surface; If pinching distance is longer, available peeling thinning algorithm, obtains serial refinement polygon Z1, Z2 ..., Zk, wherein last polygon Zk is pinching axle, the pinching axle of take carries out triangle division as constraint and can obtain end face or bottom surface.
Further, in described S3, the concrete grammar that utilizes Boolean calculation to carry out three-dimensional modeling to ore body comprises the following steps:
S3-1: to ore body L 1, L 2..., Ln carries out union, obtains ore body L 0;
S3-2: with L 0for basis successively deducts D 1, D 2..., Dp just obtains final ore body V.
The beneficial effect that the present invention is based on the meticulous circle of the self-adaptation ore deposit method of two-dimensional cross-section is:
The optimal algorithm, two-dimensional cross-section that full ore deposit, described ground method has proposed Optimum Matching algorithm, reference mark and control line between two-dimentional ore body retrains the axis pinching of gradual changed method and end ore body and the sane boolean operation method of refinement pinching method and complicated geological progressively to two-dimensional cross-section ore body.
Final effect is to realize that reserves calculate and science and the standardization of Reserves Evaluation, finally realizes both gained of finding, guarantees the crash consistency of visualization result and numerical evaluation, for the rational exploitation in mineral deposit provides decision support.
Embodiment
In order to further illustrate technical scheme of the present invention, to the present invention is based on the meticulous circle of the self-adaptation ore deposit method of two-dimensional cross-section, describe in conjunction with the embodiments.
The meticulous circle of the self-adaptation ore deposit method that the present invention is based on two-dimensional cross-section is at known ore body V 1, V 2..., the two-dimensional cross-section Si (i=1 of Vn, 2 ..., two-dimentional ore body Kij (j=1 m) and in Si, 2 ..., ni) with the overall occurrence direction vector of ore body Kd (dx, dy, dz) condition under implement, wherein, Kij is with empty polygon, and the direction vector of described empty occurrence is Jd (dx, dy, dz), comprise the following steps:
S1: according to the direction vector Kd (dx, dy, dz) of occurrence, generate ore body annexation, the annexation and the pinching relation that obtain n sub-ore body are as follows:
Lj＝{Kij，Klk}，
Wherein:
L 1, L 2..., Ln is corresponding ore body V respectively 1, V 2..., Vn;
Kij, Klk belongs to respectively two ore bodies in adjacent section;
Wherein " { " representative " < " or " (" or " [", " } " representative " > " or ") " or "] ", angle brackets represent pinching rear enclosed end, and parenthesis represent not blind end of not pinching, and square bracket represent direct blind end;
Direction vector Jd (dx, dy, dz) according to empty occurrence, generates empty annexation, and the annexation and the pinching relation that obtain p son cavity are as follows:
Dj＝{Jij，Jlk}，
Wherein:
D 1, D 2dp is corresponding ore body T respectively 1, T 2..., Tp;
Jij, Jlk belongs to respectively two cavities in adjacent section, but the Dj connecting must be contained in certain ore body, connects in Vk;
Wherein " { " representative " < " or " (" or " [", " } " representative " > " or ") " or "] ", angle brackets represent pinching rear enclosed end, and parenthesis represent not blind end of not pinching, and square bracket represent direct blind end;
Figure BSA00000231026700041
S2: carry out L 1, L 2ln and D 1, D 2..., the monomer three-dimensional modeling of Dp, obtain three-dimensional ore body Vj (j=1,2 ..n) and three-dimensional empty Tj (j=1,2 ..., p); Carry out L 1, L 2..., Ln and D 1, D 2..., the concrete grammar of the monomer three-dimensional modeling of Dp comprises the following steps:
S2-11: to ore body Lj={Kij, the end points polygon Kij of Klk} according to becoming ore deposit constraint to determine gradual manner, carries out polygon gradual change computing to Klk, obtains serial polygon Kij, Kij1, Kij2 ..., Kijs, Klk, utilize two-dimensional cross-section to Kij1, to arrive Kij2 to the synchronous tracing delineation Kij of three-dimensional reconstruction ..., Kijs is to the boundary surface of Klk;
S2-12: according to the two ends of pinching feature sealing Kij and Klk, concrete grammar is as follows:
If direct blind end carries out triangle division by termination polygon and can obtain end face or bottom surface;
If pinching rear enclosed end obtains the polygonal axis Z in termination and be pinching axle, with termination polygon and pinching axle, retrain triangle and be connected and can obtain end face or bottom surface; If pinching distance is longer, available peeling thinning algorithm, obtains serial refinement polygon Z1, Z2 ..., Zk, wherein last polygon Zk is pinching axle, the pinching axle of take carries out triangle division as constraint and can obtain end face or bottom surface.
S2-21: to empty Dj={Jij, the end points polygon Jij of Jlk} according to becoming ore deposit constraint to determine gradual manner, carries out polygon gradual change computing to Jlk, obtains serial polygon Jij, Jij1, Jij2 ..., Jijs, Jlk, utilize two-dimentional empty section to Jij1, to arrive Jij2 to the synchronous tracing delineation Jij of three-dimensional reconstruction ..., Jijs is to the boundary surface of Jlk;
S2-22: according to the two ends of pinching feature sealing Jij and Jlk, concrete grammar is as follows:
If direct blind end carries out triangle division by termination polygon and can obtain end face or bottom surface;
If pinching rear enclosed end obtains the polygonal axis Z in termination and be pinching axle, with termination polygon and pinching axle, retrain triangle and be connected and can obtain end face or bottom surface; If pinching distance is longer, available peeling thinning algorithm, obtains serial refinement polygon Z1, Z2 ..., Zk, wherein last polygon Zk is pinching axle, the pinching axle of take carries out triangle division as constraint and can obtain end face or bottom surface.
S3: utilize Boolean calculation to carry out three-dimensional modeling to ore body, concrete grammar comprises the following steps:
S3-1: to ore body L 1, L 2..., Ln carries out union, obtains ore body L 0;
S3-2: with L 0for basis successively deducts D 1, D 2..., Dp just obtains final ore body V.
Obtain final ore body V.
S4: calculate ore body V volume, average grade and ore deposit amount.
S5: ore body V is subdivided into piece section, then, inserts out the grade of each piece section, according to economic grade, ore body V is managed.

Claims (3)

1. the meticulous circle of the self-adaptation based on two-dimensional cross-section ore deposit method, is characterized in that: described method is at known ore body V 1, V 2..., V ntwo-dimensional cross-section S i(i=1,2 ..., m) and S iin two-dimentional ore body K ij(j=1,2 ..., ni) with the overall occurrence direction vector of ore body K dunder the condition of (dx, dy, dz), implement, wherein, K ijbe with empty polygon, the direction vector of described empty occurrence is J d(dx, dy, dz), wherein n, m, ni are more than or equal to 0 integer, comprise the following steps:
S1: according to the direction vector K of occurrence d(dx, dy, dz), generates ore body annexation, and the annexation and the pinching relation that obtain n sub-ore body are as follows:
L j＝{K ij，K lk}，
Wherein:
L 1, L 2..., L nthe corresponding ore body V of difference 1, V 2..., V n;
K ii, K lkbelong to respectively two ore bodies in adjacent section;
Wherein " { " representative " < " or " (" or " [", " } " representative " > " or ") " or "] ", angle brackets represent pinching rear enclosed end, and parenthesis represent not blind end of not pinching, and square bracket represent direct blind end;
According to the direction vector J of empty occurrence d(dx, dy, dz), generates empty annexation, and the annexation and the pinching relation that obtain p son cavity are as follows:
D j＝{J ij，J lk}，
Wherein:
D 1, D 2d pthe corresponding ore body T of difference 1, T 2..., T p;
J ij, J lkbelong to respectively two cavities in adjacent section, but the D connecting jmust be contained in certain ore body and connect V kin;
Wherein " { " representative " < " or " (" or " [", " } " representative " > " or ") " or "] ", angle brackets represent pinching rear enclosed end, and parenthesis represent not blind end of not pinching, and square bracket represent direct blind end;
Set { T 1, T 2..., T n}
Figure FSB0000118217440000011
set { V 1, V 2..., V n, wherein n is not more than p;
S2: carry out ore body L 1, L 2l nwith empty D 1, D 2..., D pmonomer three-dimensional modeling, obtain three-dimensional ore body V j(j=1,2 ..n) with three-dimensional empty T j(j=1,2 ..., p);
S3: utilize Boolean calculation to carry out three-dimensional modeling to ore body, obtain final ore body V;
S4: calculate ore body V volume, average grade and ore deposit amount;
In described S2, carry out L 1, L 2..., L nand D 1, D 2..., D pthe concrete grammar of monomer three-dimensional modeling comprise the following steps:
S2-11: to ore body L j={ K ij, K lkend points polygon Kij to Klk according to becoming ore deposit constraint to determine gradual manner, carry out polygon gradual change computing, obtain serial polygon K ij, K ij1, K ij2..., K ijs, K lk, utilize two-dimensional cross-section to the synchronous tracing delineation K of three-dimensional reconstruction ijto K ij1to K ij2..., K ijsto K lkboundary surface;
S2-12: according to pinching feature sealing K ijand K lktwo ends, concrete grammar is as follows:
If direct blind end carries out triangle division by termination polygon and can obtain end face or bottom surface;
If pinching rear enclosed end obtains the polygonal axis Z in termination and be pinching axle, with termination polygon and pinching axle, retrain triangle and be connected and can obtain end face or bottom surface; If pinching distance is longer, available peeling thinning algorithm, obtains serial refinement polygon Z 1, Z 2..., Z k, last polygon Z wherein kfor pinching axle, the pinching axle of take carries out triangle division as constraint and can obtain end face or bottom surface;
S2-21: to empty D j={ J ij, J lkend points polygon Jij to J lkaccording to becoming ore deposit constraint to determine gradual manner, carry out polygon gradual change computing, obtain serial polygon J ij, J ij1, J ij2..., J ijs, J lk, utilize two-dimentional empty section to the synchronous tracing delineation J of three-dimensional reconstruction ijto J ij1to J ij2..., J ijsto J lkboundary surface;
S2-22: according to pinching feature sealing J ijand J lktwo ends, concrete grammar is as follows:
If direct blind end carries out triangle division by termination polygon and can obtain end face or bottom surface;
If pinching rear enclosed end obtains the polygonal axis Z in termination and be pinching axle, with termination polygon and pinching axle, retrain triangle and be connected and can obtain end face or bottom surface; If pinching distance is longer, available peeling thinning algorithm, obtains serial refinement polygon Z 1, Z 2..., Z k, last polygon Z wherein kfor pinching axle, the pinching axle of take carries out triangle division as constraint and can obtain end face or bottom surface.
2. the meticulous circle of the self-adaptation based on two-dimensional cross-section according to claim 1 ore deposit method, is characterized in that: described circle ore deposit method is further comprising the steps of:
S5: ore body V is subdivided into piece section, then, inserts out the grade of each piece section, according to economic grade, ore body V is managed.
3. the meticulous circle of the self-adaptation based on two-dimensional cross-section according to claim 1 ore deposit method, is characterized in that: in described S3, the concrete grammar that utilizes Boolean calculation to carry out three-dimensional modeling to ore body comprises the following steps:
S3-1: to ore body L 1, L 2..., L ncarry out union, obtain ore body L 0;
S3-2: with L 0for basis successively deducts D 1, D 2..., D pjust obtain final ore body V.
CN201010254694.3A 2010-08-17 2010-08-17 Self-adaption fine ore delineation method based on two-dimensional cross section Active CN102375917B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201010254694.3A CN102375917B (en) 2010-08-17 2010-08-17 Self-adaption fine ore delineation method based on two-dimensional cross section

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201010254694.3A CN102375917B (en) 2010-08-17 2010-08-17 Self-adaption fine ore delineation method based on two-dimensional cross section

Publications (2)

Publication Number Publication Date
CN102375917A CN102375917A (en) 2012-03-14
CN102375917B true CN102375917B (en) 2014-04-23

Family

ID=45794520

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201010254694.3A Active CN102375917B (en) 2010-08-17 2010-08-17 Self-adaption fine ore delineation method based on two-dimensional cross section

Country Status (1)

Country Link
CN (1) CN102375917B (en)

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1776361A (en) * 2005-11-18 2006-05-24 宝钢集团上海梅山有限公司 Method for estimating volume of irregular-shaped massive ore rock
CN101038680A (en) * 2007-04-29 2007-09-19 中国地质大学（北京） Method for finding mine with cubic forecast model based on three-dimensional modeling
CN101114276A (en) * 2007-08-28 2008-01-30 中国地质大学（武汉） Solid body mineral deposit three-dimensional visual reserves calculation system and computation method
CN101359047A (en) * 2008-09-23 2009-02-04 西部矿业股份有限公司 Downhole wireless positioning method based on understanding

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
AU2003247523A1 (en) * 2002-06-14 2003-12-31 Schlumberger Holdings Limited Method and program storage device for generating grids representing the architecture of fluvial reservoirs

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1776361A (en) * 2005-11-18 2006-05-24 宝钢集团上海梅山有限公司 Method for estimating volume of irregular-shaped massive ore rock
CN101038680A (en) * 2007-04-29 2007-09-19 中国地质大学（北京） Method for finding mine with cubic forecast model based on three-dimensional modeling
CN101114276A (en) * 2007-08-28 2008-01-30 中国地质大学（武汉） Solid body mineral deposit three-dimensional visual reserves calculation system and computation method
CN101359047A (en) * 2008-09-23 2009-02-04 西部矿业股份有限公司 Downhole wireless positioning method based on understanding

Also Published As

Publication number Publication date
CN102375917A (en) 2012-03-14

Similar Documents

Publication Publication Date Title
CN106326556B (en) A kind of structure reinforcing bars calculate and three-dimensional modeling method
Garimella et al. Boundary layer mesh generation for viscous flow simulations
CN102708591B (en) Hole repairing method for digital tooth grid model
CN103020368B (en) Row head optimized design method
CN111243090B (en) Earthwork volume calculating method and system
CN108470365A (en) A kind of arch wire method for drafting based on upper lower tooth jaw
CN106446394B (en) The method for extracting basin Free water reservoir capacity spatial distribution by topographic index
CN104504663B (en) A kind of iteration method for repairing and mending of artificial tooth triangle grid model hole
CN110765695B (en) Simulation calculation method for obtaining crack propagation path of concrete gravity dam based on high-order finite element method
CN104881540A (en) Accurate wall thickness control modeling method for inside profile of blade body of turbine air cooling blade
CN112102494B (en) Skeleton line guided tree-shaped point cloud surface reconstruction method and device
CN112487521B (en) Tunnel reconstruction engineering BIM modeling method and system based on point cloud
CN105389444B (en) A kind of gum edge curve design method of personalization tooth-implanting
CN109102570A (en) A kind of modeling method of three-dimensional finite element model
CN104750972A (en) Complex water network area wedge-shaped water volume computing method
CN101276484A (en) Method for generating gridding based on harmonic map
CN111125901A (en) Three-dimensional blasting visual design method based on laser scanning
CN102375917B (en) Self-adaption fine ore delineation method based on two-dimensional cross section
CN117034434A (en) Road model rapid generation method based on safety evaluation
CN113051641A (en) Three-dimensional parametric modeling method applied to arch dam slope excavation
CN104463973A (en) Cavity filling method based on surface data
CN110990923A (en) Rapid engineering calculation method, system and medium for hyperbolic arch dam of water conservancy and hydropower engineering
CN109635317A (en) A kind of high altitude localities CFD artificially generated terrain topological method
CN112100942A (en) Method for constructing nonlinear turbulence model for capturing vortex system of passenger car
CN110990951A (en) Helicopter appearance design method

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant