摘要
为解决复杂矿体投影轮廓线生成计算量大、速度慢等问题,提出一种基于网格划分的矿体投影轮廓线自动生成方法,将构成矿体模型的三角网格降维投影,生成二维三角形面片集;采用自适用规则网格划分投影区域,将三角形面片数据存储至网格单元中并建立索引关系;采用邻接单元搜索方法将网格单元进行分类,并用单元的边界矩形代替内部单元中的三角形面片参与运算;对跨越了多个网格单元的三角形面片,将其划分至与之相交的三角形面片所在的边界单元中,有利于减少冗余计算;最后布尔运算递归求并,得到投影轮廓线。研究结果表明:该方法提高了筛除效率和求解速度,收敛稳定,速度较快,投影轮廓线精度较高,能够满足矿山实际工程需求及应用,已在DIMINE数字采矿软件中得到应用。
The projection contour line of orebody is the basis of mine engineering layout and mining design.It is often used in business scenarios such as orebody structure analysis,model reconstruction,mine development design,mining plan formulation,etc..Especially for model reconstruction,the accuracy of orebody contour directly affects the accuracy of reconstructed orebody model,and then affects the refined management of ore reserves and mining design.Therefore,it is of great significance to study the projection contour of orebody for the management of mine resources and reserves and production design.In order to solve the problems of complex orebody projection contour line generation,such as large amount of calculation and slow speed,an automatic generation method of complex orebody projection contours based on grid partition was proposed.The triangle mesh that constitutes the orebody model is projected to the designated plane by reducing the dimension to generate two-dimensional triangular patch set.Using self-adaptive rules to divide the grid into projection region,the triangular patches are stored in the corresponding grid cells,and the quad-tree method is used to establish the index relationship between triangular patches and the grid,and establish a two-dimensional index to the grid cells’rows and columns.The grid unit is divided by using the method of adjacent element search,and the boundary rectangle of the element is used instead of the triangular surface of the internal element to participate in the operation.For triangular sheets spanning multiple grid elements in boundary elements,it is divided into boundary elements where triangular facets intersect with each other to reduce redundancy calculation.Finally,the projection contours is obtained by merging the set of recursive Boolean operations in the form of grid elements.In the research process,the CGAL:join algorithm was selected to conduct comparative experiments with this algorithm,and the number of triangles removed and the speed of solution were analyzed.CGAL:join algorithm does not screen the number of internal triangular patches,but this algorithm deals with the internal triangular patches,and the larger the search factor M,the less triangles are removed.Because CGAL:join algorithm does not filter out the internal triangular patches,the time consumption of CGAL:join algorithm is generally longer than that of this algorithm.With the increase of the number of patches,the time difference is more obvious.In this algorithm,the larger the search factor M,the more time-consuming,but the difference is small.The results show that the method improves the screening efficiency and solving speed,its convergence is stable,the speed is fast,and the projection contour line precision is high,which can meet the actual engineering requirements and application of mine,and has been applied in DIMINE digital mining software.
作者
李广斌
李安平
徐刚强
LI Guangbin;LI Anping;XU Gangqiang(Wulatehouqi Zijin Mining Co.,Ltd.,Wulatehouqi 015500,Inner Mongolia,China;Changsha Digital Mine Co.,Ltd.,Changsha 410083,Hunan,China)
出处
《黄金科学技术》
CSCD
2021年第2期296-305,共10页
Gold Science and Technology
关键词
复杂矿体
投影轮廓线
网格划分
布尔运算
单元分类
搜索因子
complex ore body
projection contour
grid division
Boolean operation
unit classification
search factor
