CN107977426A - A kind of open-pit mine stope step automatic update method - Google Patents

A kind of open-pit mine stope step automatic update method Download PDF

Info

Publication number
CN107977426A
CN107977426A CN201711213921.6A CN201711213921A CN107977426A CN 107977426 A CN107977426 A CN 107977426A CN 201711213921 A CN201711213921 A CN 201711213921A CN 107977426 A CN107977426 A CN 107977426A
Authority
CN
China
Prior art keywords
open
point
minimum
former
pit mine
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.)
Pending
Application number
CN201711213921.6A
Other languages
Chinese (zh)
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.)
Liaoning Technical University
Original Assignee
Liaoning Technical University
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 Liaoning Technical University filed Critical Liaoning Technical University
Priority to CN201711213921.6A priority Critical patent/CN107977426A/en
Publication of CN107977426A publication Critical patent/CN107977426A/en
Pending legal-status Critical Current

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/23—Updating
    • G06F16/2358—Change logging, detection, and notification
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/22—Indexing; Data structures therefor; Storage structures
    • G06F16/2228—Indexing structures
    • G06F16/2237—Vectors, bitmaps or matrices
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/23—Updating
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/23—Updating
    • G06F16/2365—Ensuring data consistency and integrity
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/28—Databases characterised by their database models, e.g. relational or object models
    • G06F16/284—Relational databases
    • G06F16/285—Clustering or classification

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Databases & Information Systems (AREA)
  • Data Mining & Analysis (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Software Systems (AREA)
  • Computer Security & Cryptography (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

The present invention provides a kind of open-pit mine stope step automatic update method, is related to mine graphics plotting field.This method has this property of space clustering first with open pit bench measurement data points, and identification belongs to the point on same step, and realizes that stepped line connects automatically according to position relationship；Then the minimum stepped line of elevation is found out from new stepped line, and then finds the minimum step in former step；The more neofield of former step is finally established, the deletion to former step is realized and open-pit mine stope step is automatically updated.Open-pit mine stope step automatic update method provided by the invention, realizes the automatic connection to the automatic identification of former step and deletion and New step in interior industry, substantially increase interior industry into figure speed；Meanwhile and alleviate the field process amount of opencast survey, the labor intensity of field surveys personnel is alleviated, a kind of effective solution is provided for the Automatic survey of open-pit mine stope.

Description

A kind of open-pit mine stope step automatic update method
Technical field
The present invention relates to mine graphics plotting field, more particularly to a kind of open-pit mine stope step side of automatically updating Method.
Background technology
As GPS-RTK (Realtime Kinematic), total powerstation etc. are efficient, the mining survey equipment of automation is big Use in most open pit mine field measurements, generates substantial amounts of open-pit mine stope measurement data, considerably increases Plot Work Amount.With the extensive use of efficient, automatic, digitized mining survey technology, China's digitlization and the quickening of IT application process, Substantial amounts of open-pit mine stope measurement data is generated, mainly the measurement data of generation is handled using two methods at present, A kind of method is that all kinds of codings are set in field operation data acquisition, and this method can realize interior industry automation to greatest extent, but greatly Big adds the workload of field operation, while reduces the efficiency of field data collection；Another method is that simplified field data is adopted Data are carried out editing and processing, this needs the professional very familiar to measure field by encoding setting during collection in interior industry Classified to data and handled, greatly add the difficulty and workload of data processing.So this used at present Two kinds of main methods respectively have advantage and disadvantage.How efficient, the automatic survey in mine is realized using the characteristics of substantial amounts of mine data itself Amount becomes a great problem.
The content of the invention
The defects of for the prior art, the present invention provide a kind of open-pit mine stope step automatic update method, realize to dew Its ore mining field step automatically updates.
A kind of open-pit mine stope step automatic update method, comprises the following steps：
Step 1：Using spatial clustering method, the step data point that open-pit mine stope is newly measured carries out stepped line connection, And the minimum stepped line of elevation is therefrom found out, specific method is：
Step 1.1：Measurement data points on the same square position of open-pit mine stope are clustered；
The elevation of standard step as known to open-pit mine stope establishes cluster centre collection C={ C1、C2、…、Cj、…、Cm, Wherein, CjFor the elevation of j-th of standard step, j=1 ..., m, m be standard step sum known to open-pit mine stope；To all Cluster condition of the step data point newly measured according to equation below carries out step cluster, and is made by affiliated cluster centre For the classification number of New step；
|zi-Cj|≤λ
Wherein, λ is the cluster scope that determines of height by step, ziFor the elevation of i-th of step data point newly measured, I=1,2 ..., n, n be the sum of step data point that open-pit mine stope newly measures；
Step 1.2：The stepped line of open-pit mine stope is connected automatically, specific method is：
In the measurement data point set of same square position classification, the characteristics of propulsion according to open pit bench, maximum from elevation The stepped line of step or elevation minimum starts, and step connection is carried out according to the size order of step elevation；Each stepped line root It is attached according to the position relationship between the measurement point of same step, is finally completed all stepped lines and connects automatically；From these Obtained in rank line with ClFor minimum step height measurement data point in the New step line of cluster centre and new minimum step height measurement data The chained list pNl that point is formed, it is as follows：
PNl=pNl1(x1,y1,z1)→pNl2(x2,y2,z2)→…→pNll(xl,yl,zl)
Wherein, pNlj′(xj′,yj′,zj′) it is jth ' a measurement data points in new minimum step, j '=1,2 ... l, l are new Minimum step in measurement data points total number, xj′、yj′And zj′It is the locus coordinate of jth ' a measurement data points；
Step 2：The minimum step point that relevant position is passed is found out from former step point, specific method is：
Each measurement data points on new minimum step can find that an elevation is similar, and distance is most in former step Near data point, if this minimum distance is LiminIfIt is averaged for the minimum distance of all the points on new minimum step Value, takesFor locality condition value；
Judge whether any point in former step is point in former step on minimum step, first determines whether the point is full Sufficient cluster centre is ClCluster condition, next is obtained its minimum distance with new minimum step point, then uses equation below Shown locality condition determining type judges whether it meets locality condition；
Wherein, pOi′For any one data point in former step,For error range；
Data point all on former step is carried out to the judgement of cluster condition and locality condition, obtains in former step minimum The chained list pOl of rank point, it is as follows：
POl=pOl1(x1,y1,z1)→pOl2(x2,y2,z2)→…→pOlk(xk,yk,zk)
Wherein, pOli″(xi″,yi″,zi″) being i-th in former step, " a minimum step point, i "=1,2 ... k, k are in former step The sum of minimum step point, xi″、yi″And zi″" the locus coordinate of a minimum step point that is i-th in former step；
Step 3：The more neofield of former step data point is established, specific method is：
The minimum step height measurement data point being passed in measurement data points in New step and former step is carried out three together Angle subdivision, forms the triangle domain scope of the former step data point of renewal, and is established according to triangle domain scope as follows Subdivision triangle chained list pTr：
PTr={ pTr0(p00,p01,p02)→pTr1(p10,p11,p12)→…→pTrn(pn0,pn1,pn2)}
Wherein, pTrt(pt0,pt1,pt2) be t-th of subdivision triangle, t=0,1 ..., the subdivision triangle that n, n+1 are structure The total number of shape, pt0、pt1、pt2Three vertex of respectively t-th subdivision triangle；
Step 4：Data point on former step in the subdivision triangle that step 3 obtains or in triangle edges is removed, And add the data point newly measured in the existing stope data link table of open-pit mine stope, realize to open-pit mine stope data-link The renewal of table.
As shown from the above technical solution, the beneficial effects of the present invention are：A kind of open-pit mine stope platform provided by the invention Rank automatic update method, realizes and the automatic identification of former step and deletion and the automatic of New step is connected in interior industry, significantly Improve interior industry into figure speed, provide an effective solution for the stope survey automation of opencut.Meanwhile should Method had not only mitigated the field process amount of opencast survey, but also alleviated the labor intensity of field surveys personnel, greatly improved measurement Efficiency.
Brief description of the drawings
Fig. 1 is a kind of flow chart of open-pit mine stope step automatic update method provided in an embodiment of the present invention；
Fig. 2 is the distribution schematic diagram of the step data point of new measurement provided in an embodiment of the present invention；
Fig. 3 is the schematic diagram provided in an embodiment of the present invention that the step data point newly measured is connected into step；
Fig. 4 is the distribution schematic diagram of former step data point provided in an embodiment of the present invention；
Fig. 5 is the schematic diagram of more neofield triangle scope provided in an embodiment of the present invention；
Fig. 6 is the schematic diagram of the former step in removal more neofield triangle scope provided in an embodiment of the present invention.
Embodiment
With reference to the accompanying drawings and examples, the embodiment of the present invention is described in further detail.Implement below Example is used to illustrate the present invention, but is not limited to the scope of the present invention.
The present embodiment is by taking certain open-pit mine stope as an example, using the open-pit mine stope step automatic update method of the present invention to this The step of open-pit mine stope is updated.
A kind of open-pit mine stope step automatic update method, as shown in Figure 1, comprising the following steps：
Step 1：Using spatial clustering method, the step data point that open-pit mine stope is newly measured carries out stepped line connection, And the minimum stepped line of elevation is therefrom found out, specific method is：
Step 1.1：Measurement data points on the same square position of open-pit mine stope are clustered；
The elevation of standard step as known to open-pit mine stope establishes cluster centre collection C={ C1、C2、…、Cj、…、Cm, Wherein, CjFor the elevation of j-th of standard step, j=1 ..., m, m be standard step sum known to open-pit mine stope；To all Cluster condition of the step data point newly measured according to equation below carries out step cluster, and is made by affiliated cluster centre For the classification number of New step；
|zi-Cj|≤λ
Wherein, λ is the cluster scope that determines of height by step, ziFor the elevation of i-th of step data point newly measured, I=1,2 ..., n, n be the sum of step data point that open-pit mine stope newly measures；
In the present embodiment, which shares 119 New step measurement data points, as shown in Fig. 2, the cross in figure Plan-position where symbolic indication measurement data points, the above and below numeral of cross symbol represent the height of measurement data points Journey (unit：m).The height H of stepstepAbout 12m, the cluster range lambda=3m determined by the height of step, in the cluster scope Interior, cluster centre integrates as C={ 815,803,791,779 }.New measurement data points are clustered, and by affiliated cluster centre As the classification number of New step, the part cluster result of New step measurement data points is as shown in table 1.
The partial data cluster result table of 1 new measurement data of table
Sequence number X Y Z Classification number
1 557.70 198.13 803.73 803
2 531.61 197.62 801.86 803
3 489.64 199.93 802.76 803
… … … … …
119 553.20 58.59 789.86 791
Step 1.2：The stepped line of open-pit mine stope is connected automatically, specific method is：
In the measurement data point set of same square position classification, the characteristics of propulsion according to open pit bench, maximum from elevation The stepped line of step or elevation minimum starts, and step connection is carried out according to the size order of step elevation；Each stepped line root It is attached according to the position relationship between the measurement point of same step, is finally completed all stepped lines and connects automatically；From these Obtained in rank line with ClFor minimum step height measurement data point in the New step line of cluster centre and new minimum step height measurement data The chained list pNl that point is formed, it is as follows：
PNl=pNl1(x1,y1,z1)→pNl2(x2,y2,z2)→…→pNll(xl,yl,zl)
Wherein, pNlj′(xj′,yj′,zj′) it is jth ' a measurement data points in new minimum step, j '=1,2 ... l, l are new Minimum step in measurement data points total number, xj′、yj′And zj′It is the locus coordinate of jth ' a measurement data points；
In this implementation, stepped line connection is proceeded by from from the step that classification number is 815, it is right from big to small according to classification number All stepped lines are attached, and complete to connect the step of new measurement point automatically.The connection step that is finally completed as shown in figure 3, The data point of wherein minimum step is 24, the cluster centre C of minimum stepl=779.
Step 2：The minimum step point that relevant position is passed is found out from former step point, specific method is：
Each measurement data points on new minimum step can find that an elevation is similar, and distance is most in former step Near data point, if this minimum distance is LiminIfIt is averaged for the minimum distance of all the points on new minimum step Value, takesFor locality condition value；
Judge whether any point in former step is point in former step on minimum step, first determines whether the point is full Sufficient cluster centre is ClCluster condition, next is obtained its minimum distance with new minimum step point, then uses equation below Shown locality condition determining type judges whether it meets locality condition；
Wherein, pOi′For any one data point in former step,For error range；
Data point all on former step is carried out to the judgement of cluster condition and locality condition, obtains in former step minimum The chained list pOl of rank point, it is as follows：
POl=pOl1(x1,y1,z1)→pOl2(x2,y2,z2)→…→pOlk(xk,yk,zk)
Wherein, pOli″(xi″,yi″,zi″) being i-th in former step, " a minimum step point, i "=1,2 ... k, k are in former step The sum of minimum step point, xi″、yi″And zi″" the locus coordinate of a minimum step point that is i-th in former step；
The present embodiment shares 107 former step height measurement data points, as shown in figure 4, the cross symbol in figure represents measurement point Place plan-position, the elevation (unit of the above and below digital representation measurement point of cross symbol：M), former measurement point has connected Into stepped line.
In this 107 former measurement step points, with the cluster centre C of new minimum stepl=779 are clustered, and are obtained 17 former step cluster points, cluster result are as shown in table 2.
The partial data cluster result table of the original minimum step of table 2
24 new minimum step data points are calculated to the minimum range at this 17 former step minimum strong points, are obtained recently Distance is Limin=33.34,33.53 ..., 35.22 } andThe error range is taken to beThis is calculated 17 former step minimum points are the minimum step points being passed, and the data point chained list for obtaining the minimum step of former step is：
POl=pOl1(24.39,6.27,779.99)→pOl2(36.01,7.33,778.77)→…→pOl17 (550.35,17.10,779.91)
Step 3：The more neofield of former step data point is established, specific method is：
The minimum step height measurement data point being passed in measurement data points in New step and former step is carried out three together Angle subdivision, forms the triangle domain scope of the former step data point of renewal, and is established according to triangle domain scope as follows Subdivision triangle chained list pTr：
PTr={ pTr0(p00,p01,p02)→pTr1(p10,p11,p12)→…→pTrn(pn0,pn1,pn2)}
Wherein, pTrt(pt0,pt1,pt2) it is t-th of subdivision triangle, t=0,1 ..., n, n+1 is the subdivision triangle of structure The total number of shape, pt0、pt1、pt2Three vertex of respectively t-th subdivision triangle；
In the present embodiment, 119 New step measurement points and 17 former steps are passed minimum step point and carry out three together Angle subdivision, forms more neofield triangle scope as shown in Figure 5.
Step 4：Data point on former step in the subdivision triangle that step 3 obtains or in triangle edges is removed, And add the data point newly measured in the existing stope data link table of open-pit mine stope, realize to open-pit mine stope data-link The renewal of table.
In this implementation, as shown in fig. 6, using dotted line enclose come three at original step data point in more neofield triangle scope It is interior, these former step data points and stepped line are removed, then new measurement data points and stepped line are added to open-pit mine stope In data link table, automatically updating for open-pit mine stope step is achieved that.
Finally it should be noted that：The above embodiments are merely illustrative of the technical solutions of the present invention, rather than its limitations；Although The present invention is described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that：It still may be used To modify to the technical solution described in previous embodiment, either which part or all technical characteristic are equal Replace；And these modifications or replacement, the essence of appropriate technical solution is departed from the model that the claims in the present invention are limited Enclose.

Claims (5)

  1. A kind of 1. open-pit mine stope step automatic update method, it is characterised in that：Comprise the following steps：
    Step 1：Using spatial clustering method, the step data point progress stepped line connection that open-pit mine stope is newly measured, and from In find out the minimum stepped line of elevation, specific method is：
    Step 1.1：Measurement data points on the same square position of open-pit mine stope are clustered；
    Step 1.2：The stepped line of open-pit mine stope is connected automatically；
    Step 2：The minimum step point that relevant position is passed is found out from former step point；
    Step 3：The more neofield of former step data point is established, forms the triangle domain scope of the former step data point of renewal, and root Subdivision triangle chained list is established according to triangle domain scope；
    Step 4：Data point on former step in the subdivision triangle that step 3 obtains or in triangle edges is removed, and will The data point newly measured is added in the existing stope data link table of open-pit mine stope, is realized to open-pit mine stope data link table Renewal.
  2. A kind of 2. open-pit mine stope step automatic update method according to claim 1, it is characterised in that：The step 1.1 specific method is：
    The elevation of standard step as known to open-pit mine stope establishes cluster centre collection C={ C1、C2、…、Cj、…、Cm, wherein, CjFor the elevation of j-th of standard step, j=1 ..., m, m be standard step sum known to open-pit mine stope；To all new surveys Cluster condition of the step data point of amount according to equation below carries out step cluster, and by affiliated cluster centre as new The classification number of step；
    |zi-Cj|≤λ
    Wherein, λ is the cluster scope that determines of height by step, ziFor the elevation of i-th of step data point newly measured, i=1, 2nd ..., n, n are the sum for the step data point that open-pit mine stope newly measures.
  3. A kind of 3. open-pit mine stope step automatic update method according to claim 2, it is characterised in that：The step 1.2 specific method is：
    In the measurement data point set of same square position classification, the characteristics of propulsion according to open pit bench, from the step of elevation maximum Or the stepped line of elevation minimum starts, step connection is carried out according to the size order of step elevation；Each stepped line is according to same Position relationship between the measurement point of one step is attached, and is finally completed all stepped lines and is connected automatically；From these stepped lines In obtain with ClFor minimum step height measurement data point in the New step line of cluster centre and new minimum step height measurement data point structure Into chained list pNl, it is as follows：
    PNl=pNl1(x1,y1,z1)→pNl2(x2,y2,z2)→…→pNll(xl,yl,zl)
    Wherein, pNlj′(xj′,yj′,zj′) for jth ' a measurement data points in new minimum step, j '=1,2 ... l, l for it is new most Measurement data points total number, x in low stepj′、yj′And zj′It is the locus coordinate of jth ' a measurement data points.
  4. A kind of 4. open-pit mine stope step automatic update method according to claim 3, it is characterised in that：The step 2 Specific method be：
    It is similar that each measurement data points on new minimum step can find an elevation in former step, closest Data point, if this minimum distance is LiminIfFor the average value of the minimum distance of all the points on new minimum step, takeFor locality condition value；
    Judge whether any point in former step is point in former step on minimum step, first determines whether the point meets to gather Class center is ClCluster condition, next obtains its minimum distance with new minimum step point, then shown in equation below Locality condition determining type judge whether it meets locality condition；
    <mrow> <mo>|</mo> <mi>min</mi> <mo>{</mo> <mo>|</mo> <msub> <mi>pO</mi> <mrow> <mi>i</mi> <mo>&amp;prime;</mo> </mrow> </msub> <mo>,</mo> <msub> <mi>pNl</mi> <mrow> <mi>j</mi> <mo>&amp;prime;</mo> </mrow> </msub> <mo>|</mo> <mo>}</mo> <mo>-</mo> <mover> <msub> <mi>L</mi> <mi>min</mi> </msub> <mo>&amp;OverBar;</mo> </mover> <mo>|</mo> <mo>&amp;le;</mo> <mo>&amp;dtri;</mo> </mrow>
    Wherein, pOi′For any one data point in former step,For error range；
    Data point all on former step is carried out to the judgement of cluster condition and locality condition, obtains minimum step point in former step Chained list pOl, it is as follows：
    POl=pOl1(x1,y1,z1)→pOl2(x2,y2,z2)→…→pOlk(xk,yk,zk)
    Wherein, pOli″(xi″,yi″,zi″) being i-th in former step, " a minimum step point, i "=1,2 ... k, k are minimum in former step The sum of step point, xi″、yi″And zi″" the locus coordinate of a minimum step point that is i-th in former step.
  5. A kind of 5. open-pit mine stope step automatic update method according to claim 4, it is characterised in that：The step 3 Specific method be：
    The minimum step height measurement data point being passed in measurement data points in New step and former step is carried out triangle together to cut open Point, the triangle domain scope of the former step data point of renewal is formed, and subdivision as follows is established according to triangle domain scope Triangle chained list pTr：
    PTr={ pTr0(p00,p01,p02)→pTr1(p10,p11,p12)→…→pTrn(pn0,pn1,pn2)}
    Wherein, pTrt(pt0,pt1,pt2) it is t-th of subdivision triangle, t=0,1 ..., n, n+1 is the total of the subdivision triangle of structure Number, pt0、pt1、pt2Three vertex of respectively t-th subdivision triangle.
CN201711213921.6A 2017-11-28 2017-11-28 A kind of open-pit mine stope step automatic update method Pending CN107977426A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201711213921.6A CN107977426A (en) 2017-11-28 2017-11-28 A kind of open-pit mine stope step automatic update method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201711213921.6A CN107977426A (en) 2017-11-28 2017-11-28 A kind of open-pit mine stope step automatic update method

Publications (1)

Publication Number Publication Date
CN107977426A true CN107977426A (en) 2018-05-01

Family

ID=62012098

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201711213921.6A Pending CN107977426A (en) 2017-11-28 2017-11-28 A kind of open-pit mine stope step automatic update method

Country Status (1)

Country Link
CN (1) CN107977426A (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108805154A (en) * 2017-08-23 2018-11-13 辽宁工程技术大学 A kind of geological fault recognition methods based on space clustering
CN112634389A (en) * 2020-12-10 2021-04-09 华能伊敏煤电有限责任公司 Strip mine plan drawing method and device based on unmanned aerial vehicle, and server

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20010032402A1 (en) * 1997-09-17 2001-10-25 Russell Matthew F. Continuous shovel
CN104462649A (en) * 2014-11-06 2015-03-25 中国有色金属长沙勘察设计研究院有限公司 Automatic updating method of ore body block model reserves
CN104541650A (en) * 2015-02-06 2015-04-29 武汉科技大学 Dynamic reclamation method for open pit mine stope

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20010032402A1 (en) * 1997-09-17 2001-10-25 Russell Matthew F. Continuous shovel
CN104462649A (en) * 2014-11-06 2015-03-25 中国有色金属长沙勘察设计研究院有限公司 Automatic updating method of ore body block model reserves
CN104541650A (en) * 2015-02-06 2015-04-29 武汉科技大学 Dynamic reclamation method for open pit mine stope

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
王志宏 等: "露天矿三维可视化地质模型的实时动态更新", 《辽宁工程技术大学学报》 *

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108805154A (en) * 2017-08-23 2018-11-13 辽宁工程技术大学 A kind of geological fault recognition methods based on space clustering
CN112634389A (en) * 2020-12-10 2021-04-09 华能伊敏煤电有限责任公司 Strip mine plan drawing method and device based on unmanned aerial vehicle, and server

Similar Documents

Publication Publication Date Title
CN110490415B (en) Building progress assessment method for visual coordination of multiple unmanned aerial vehicles
CN105243453B (en) A kind of mining ore dynamic Blending optimization method
CN111339692B (en) Laser point cloud data-based power line sag determination method and device
CN101707026A (en) Combined optimization method for simplifying digital map linear factors
CN103336894B (en) A kind of city plot ratio automatic Mesh Partition Method
CN107464223A (en) A kind of dot cloud hole method for repairing and mending based on section
CN109872394A (en) Long-narrow triangular mesh grid optimization method based on least square method supporting vector machine
CN110070038B (en) Method for measuring and calculating urban green land rate based on urban greening coverage area
CN108647607A (en) Objects recognition method for project of transmitting and converting electricity
CN108978573A (en) A kind of method of terrain data quick visualization auxiliary river bed change research
CN111496786A (en) Point cloud model-based mechanical arm operation processing track planning method
CN104820826B (en) A kind of domatic extraction and recognition methods based on digital elevation model
CN107977426A (en) A kind of open-pit mine stope step automatic update method
CN108647261A (en) Global isoplethes drawing method based on meteorological data discrete point gridding processing
CN106548278A (en) A kind of high standard capital farmland construction Project Areas preferably automatedization computational methods
CN103995944B (en) A kind of free air anomaly extreme value unbiased isopleth map method for drafting
CN105869210A (en) Interpolation data processing method in three-dimensional geological surface model
CN111985691A (en) Site selection method for wind power plant booster station
CN115375872B (en) Automatic sketching method for GNSS measurement linear ground objects
CN111739163B (en) Unmanned aerial vehicle image data modeling method for intelligent acceptance of open stope
CN103796217B (en) A kind of estimation range partitioning method and device based on drive test data
CN111062577B (en) GIS-based substation site selection method
CN106204305A (en) A kind of plot automatic batch cutting method and device
CN104700407A (en) Rock mass crack recognizing method and system
CN112347901A (en) Rock mass analysis method based on three-dimensional laser scanning technology

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
RJ01 Rejection of invention patent application after publication

Application publication date: 20180501

RJ01 Rejection of invention patent application after publication