用户名: 密码: 验证码:
数字采矿软件平台关键技术研究
详细信息    本馆镜像全文|  推荐本文 |  |   获取CNKI官网全文
摘要
随着信息技术的迅速发展,信息技术愈来愈广泛地应用于社会各个领域,传统产业的信息化改造与提升成为大势所趋。对于古老的采矿业而言更是如此,采矿业的创新发展——数字矿山成为必然趋势。数字采矿是数字矿山最基础、最核心的部分。我国在数字采矿软件方面对外依存度高,严重制约了矿山信息化进程。针对我国矿山特点和矿山企业对数字矿山建设的实际需求,开发具有自主知识产权的数字化矿业软件系统具有重要意义。
     数字采矿软件系统是一个庞大的巨型系统,其涉及领域广、层次深,实现难度大,必须采用总体设计分步实施的战略思想,因此,搭建良好的数字采矿软件开发与应用平台是最重要的环节。搭建平台是为了提供一个可扩展的开发环境和可视化应用环境,为专业功能模块的实现提供技术支撑。平台搭建主要涉及软件体系结构、交互机理、数据模型、建模技术与算法、模型分析与处理技术等方面的关键技术,本文从采矿软件的具体需求出发,着重对上述关键技术展开研究,主要内容包含以下几个方面:
     (1)对软件的体系结构进行研究。针对数字化采矿软件涉及多专业、多功能、需求多样性等特点,提出“层次式平台+插件”的结构体系,有效地实现框架和构件的共享与复用,实现专业功能模块的任意扩展,有效降低了二次开发难度。
     (2)在全面分析三维交互和二维交互各自优缺点的基础上,结合采矿工程设计的特点,提出了“工作面”的概念,确保设计人员在真三维环境下设计工作的精确性和便捷性。
     (3)在全面研究矿山描述对象构成、特点及数字采矿软件对三维数据模型的要求和地学三维数据模型的研究成果的基础上,提出了采用结构建模与属性建模相结合的松散型建模方案。结构模型主要是表征描述对象的空间几何形态,而属性模型主要表征描述对象的内部属性,实现了采矿设计的精准性和地质属性查询的准确性。
     (4)对数字采矿软件应用中所涉及到的结构建模关键技术与算法进行深入研究。提出了一种新的多边形区域三角化算法,解决了对存在“洞”、“岛”的多边形区域进行三角化难题,为矿体切割缝合、三维联通巷道建模等提供了解决方案;提出了一种新的三维空间实体布尔运算算法,有效的解决了数字采矿结构建模过程中大量存在的开放网格与开放网格、开放网格与闭合网格之间的布尔运算问题,通过采用OBB树进行三角形相交测试,大大提高了运行速度;改进了轮廓线拼接法和体数据等值面法以实现复杂矿体三维建模技术,有效的解决了算法存在的内存、速度以及轮廓线间距不一致等问题;提出两种基于中心线—断面三维构模技术:直接断面拼接法和平行帮线拼接法,从而实现两种井巷工程建模技术:局部建模法和整体建模法;通过重建线上三角形集的方法,解决了DTM在地性特征线附近出现台阶的问题。
     (5)针对传统地质块段模型存在的不足及矿山海量属性数据的存储和快速查询的需要,引入外存八叉树对属性模型进行管理,并对外存八叉树快速构建、查询及与结构模型的快速转换进行研究,通过将点在多面体内判定的三维问题转化为点在多边形内判定的二维问题,并提出虚拟八叉树的概念、引入八叉树的访问机理——游标技术,从而实现快速构建、访问外存八叉树的目的;采用半结构化格网(QUG)三维数据类型,实现结构模型不同精度要求的快速栅格化及属性模型快速、低内存区域查询与可视化表达。
     (6)对结构模型与属性模型相结合的三维模型分析处理和综合应用技术进行了研究,实现了矿体边界随边界品位改变的动态更新、矿山属性模型随地质属性进一步探明的动态更新、矿山三维模型的剖切、探测、体积量算等技术。
     本文的研究成果解决了数字采矿软件平台搭建过程中存在的关键技术和难点问题,为数字采矿软件的整体实现提供开发与应用平台。
With the rapid development of information technology, it is more and more widely used in all areas of society, the transformation and upgradtion of information technology in traditional industry become a general trend, especially for such an old industry as mining. Digital Mine, as the innovation and development of the mining industry will become an inevitable trend. Digital mining is the most basic and central part of Digital Mine. China's mining software in high external dependence has seriously constrained the process of mining informationization. For the characteristics of mining enterprises in China and the actual needs of the construction of Digital Mine, developing proprietary software system of digital mine is of great significance.
     Digital mining software system is a huge system, which involves broad fields, deep levels and great difficulty in realization, and must be implemented step by step strategic thinking, therefore to build a good digital mining development and application platform is the most important step. The platform is to provide a visualization application environment and a scalable development environment to provide technical support for the realization of other professional function modules. Platform construction mainly relates to software architecture, interaction mechanism, data model, modeling techniques and algorithms, model analysis and processing technology and other aspects of the key technologies. From the specific needs of the mining software, the paper focuses on the study of these key technologies with main contents as follows:
     (1) The software architecture has been researched. As mining software involves multi-disciplinary, multi-function and diverse demands, the "hierarchical platform+plug-in" structural system has been put forward, which has made the sharing and reuse of framework and component possible, the professional function module be realized in any extension, and the difficulty of secondary development effectively be reduced.
     (2) Based on comprehensive analysis of the advantages and disadvantages of three-dimensional interaction and two-dimensional interactions, combined with the characteristics of the mining engineering design, the concept of "work plane" has been proposed, to ensure the precision and convenience of design work in three-dimensional environment.
     (3) After a comprehensive study of the composition and characteristics of mining data object, and the 3D model requirements for the digital mining software and the research results of 3D geological model, a modeling program, with loose combination of structural modeling and attribute modeling, has been proposed. Structural model is mainly characterized by describing the geometry of space objects, while the attribute model is mainly characterized by the internal properties. This modeling program ensured the precision of mining design and geological properties query.
     (4) The key technology and algorithm exist in the structure modeling for digital mining software applications have been thoroughly studied. A new polygon triangulation algorithm has been proposed to solve the polygon triangulation problem of having "hole" and "island", and provide a solution for the ore body stapler and 3D modeling of laneway. A new algorithm for the boolean operations for 3D Model has been proposed to solve the issue for the boolean operations between open mesh and open mesh or between open mesh and close mesh, and the speed has been greatly improved by using OBB tree triangle intersection test. The contour splicing method and the volume data iso-surface method has been improved to solve the memory, speed and contour spacing inconsistencies and other issues. Two kinds of centerline-section modeling techniques was proposed, namely, direct section splicing method and parallel waist splicing method, corresponding to two kinds of modeling technology of laneway, namely, local modeling method and overall modeling method. The problem of steps occuring near the characteristic line on the DTM has been solved by reconstructing the triangle set on the line.
     (5) For the shortcomings of the traditional geological block model, as well as the needs of mass attribute data memory and fast query, out-of-core octree model has been introduced into property management. The technology of quickly building and query of out-of-core octree model, and rapid conversion between out-of-core octree model and structural model have been studied. The technology of quickly building out-of-core octree model has been achieved by transforming 3D problem of the determine point within a polyhedron into 2D problem of the determine point within a polygon, and the concept of a virtual octree has been put forward, and introducing the visit mechanism of octree-cursor technology. Semi-structured grid (QUG) three-dimensional data type was introduced to achieve structural models of different accuracy and fast voxelization, and to realize the fast, low-memory query and visualization of attribute model.
     (6) The analysis, processing and integrated application technology of three-dimensional model combining structural model and attribute model has been studied. It has realized the dynamic update of orebody boundary with changing boundary grade and the dynamic update of property model with further verified geological properties, as well as techniques of 3D model cutting, detecting, volume measuring and calculation.
     The achievements stated in this paper have solved the key technical and difficult issues in the process to build the digital mining software platforms, and provided a development and application platform for the overall realization of digital mining software.
引文
[1]古德生.地下金属矿采矿科学技术的发展趋势[J].黄金,2004(1):18-22.
    [2]陈科文,古德生.信息科技在采矿工业中的应用与展望[J].金属矿山,2002(1):5-7.
    [3]吴立新.数字地球、数字中国与数字矿区[J].矿山测量,2000(1):6-9.
    [4]吴立新,殷作如,邓智毅等.论21世纪的矿山——数字矿山[J].煤炭学报,2000,25(4):337-342.
    [5]吴立新,殷作如,钟亚平.再论数字矿山特征、框架与关键技术[J].煤炭学报,2002,28:2-7.
    [6]吴立新,朱旺喜,张瑞新.数字矿山与我国矿山未来发展[J].科技导报,2004(7):1-2.
    [7]孙豁然,徐帅.论数字矿山[J].金属矿山,2007(2):1-5.
    [8]王李管,曾庆田,贾明涛.数字矿山整体实施方案及其关键技术[J].采矿技术,2006(3):494-498.
    [9]王青,吴惠城,牛京考.数字矿山的功能内涵及系统构成[J],2004(1):7-10.
    [10]毕思文,殷作如,何晓群等.数字矿山的概念、框架、内涵及应用示范[J].科技导报,,2004,(6):39-63.
    [11]僧德文,李仲学,张顺.等数字矿山系统框架与关键技术研究[J].金属矿山,2005(12):47-50.
    [12]陈建宏.可视化集成采矿CAD系统研究[D]. 中南大学,2002.
    [13]王李管,邓顺华,陈建宏.矿床模型与开采辅助设计软件系统研究[J].中南矿冶学院学报,1994(5).
    [14]陈建宏,邓顺华,王李管.交互式集成图形平台的露天矿模拟开采设计[J].冶金矿山设计与建设,1996(2):78-82.
    [15]董卫军,胡乃联.利用ADS技术开发露天矿采剥计划CAD系统[J].有色矿冶1998(2):9-12.
    [16]孙豁然,李旭升,何红胜.基于AutoCAD地测采CAD系统的开发与应用[J].中国矿业,1997,6(2):67-71.
    [17]董卫军,蔡美峰,王双红.有关采矿CAD开发技术的研究[J].有色矿业,1999(1):4-6.
    [18]陈建宏,周科平,古德生.新世纪采矿CAD技术的发展:可视化、集成化和智能化[J].科技导报,2004(7):32-34.
    [19]邵安林,孙豁然,刘晓军.我国采矿CAD开发存在的问题与对策[J].金属矿山,2004(2):1-4.
    [20]过江,古德生,罗周全.区域智能化采矿构想初探[J].金属矿山,2006,6(3):147-150.
    [21]王卫星,崔冰.金属矿山数字化[J].金属矿山,2005(5):1-4.
    [22]宋焕斌,张兵.国际矿业发展趋势分析[J].昆明理工大学学报,2005,5(3):37-39.
    [23]古德生,李夕兵等.现代金属矿床开采科学技术[M].北京:冶金工业出版社,2006.
    [24]胡晋山,何宗宜,康建荣等.数字矿山的数据组织及其不确定性分析[J].测绘科学,2007(3):139-141.
    [25]郭达志 张海荣,张书毕等.MGIS特征及其不确定性[J].矿山测量,,2002(2):8-10.
    [26]李一帆.数字矿山信息系统的研究及应用[D]. 中国科学院武汉岩土力学研究所,2007.
    [27]王家耀.空间信息系统原理[M].北京:科学出版社,2001.
    [28]吴立新,史文中.地理信息系统原理与算法[M].北京:科学出版社,2003.
    [29]Zlatanova S, Rahman A. and,Shi W. Topological models and frameworks for 3D spatial objects[J]. Computers&Geosciences,2004,30(4):419-428.
    [30]张子平.三维地理信息系统空间分析算法若干问题研究[D].武汉大学,2002.
    [31]杨必胜.城市三维地理信息系统的建模研究[D].武汉大学,2002.
    [32]程朋根,龚健雅.地勘三维空间数据模型及其数据结构设计[J].测绘学报,2001,30(1):74-81.
    [33]程朋根.地矿三维空间数据模型及相关算法研究[D].武汉大学,2005.
    [34]李德仁,李清泉.一种三维GIS混合数据结构研究[J].测绘学报,1997,25(2):128-133.
    [35]Shi W Z. A hybrid model for 3D GIS[J]. Geoinformatics,1996(1):400-409.
    [36]Li R X. Date Structure and Application Issues in 3D Geographic Information System[J]. Geomatics,1994,48(3):209-244.
    [37]齐安文,吴立新,李冰等.一种新的三维地学空间构模方法:类三棱柱法[J].煤炭学报,2002,27(2):158-163.
    [38]边馥苓,傅仲良,胡自锋.面向目标的栅格矢量一体化三维数据模型[J].武汉测绘科技大学学报,2000(25):294-298.
    [39]戴吾蛟,邹铮嵘.基于体素的三维GIS数据模型的研究[J].矿山测量,2001(1):20-22.
    [40]张煜,白世伟.一种基于三棱柱体体元的三维地层建模方法—应用[J].中国图像图形学报,2001,6(3):285-290.
    [41]韩国建,郭达志,金学林.矿体信息的八叉树存储和检索技术[J].测绘学报,1992(21):13-17.
    [42]Homer H,Thomas S. A. Survey of Construction and Manipulation of Octree[J]. CVGIP, 1998(43):409-431.
    [43]Mallet J. L. Geomodeling[M]. New York:Oxford University Press,2002.
    [44]Simon W. H.3D Geoscience Modeling:Computer Techniques for Geological Characterization[M]. Springer-Verlag,1994.
    [45]吴立新,史文中,Cheristepher Gold.3DGIS与3DGMS中的空间构模技术.地理与地理信息科学[J],2003,10(1):5-11.
    [46]Kim Y H,KO S. L. Improvement of Cutting Simulation Using the Octree Method[J]. The International Journal of Advanced Manufacturing Technology,2005,28(11): 1152-1160.
    [47]Pilout M, Tem pfliK,Molenaar M. A Tetrahedron-Based 3D Vector Data Model for Geoinformation.In:Advanced Geographic Data Modelling[J]. Netherlands Geodetic Commision,Publications on Geodesy,1994(40).
    [48]李仲学,李翠平.矿床仿真及体视化技术[J],2002,17(5):5-7.
    [49]李春民,李仲学,王云海.”数字矿山”三维可视化研究[J].2006,18(增刊2):515-518.
    [50]陈颖彪,钟耳顺.矿山地质勘察三维可视化管理系统与建模技术研究[J].矿业研究与开发,2002,24(1):37-40.
    [51]杜培军,郭达志,田艳凤.顾及矿山特性的三维GIS数据结构与可视化[J],2001,30(3):238-242.
    [52]徐云和,程朋根,陈红华.地3维GIS模型的构建及可视化[J],2003(2):48-50.
    [53]潘结南,孟召平,甘莉.矿山三维地质建模与可视化研究[J],2005,33(1):16-18.
    [54]Simon W Houlding.3D Geoscience modeling-computer techniques for geological characterization[M]. New York Heidelburg, Springer-Verlag,1994.
    [55]郑贵洲,申永利.地质特征三维分析及三维地质模拟现状研究[J].地球科学进展,2004(2):218-223.
    [56]D.Hartly.金属矿地下开采的计算机辅助设计[J].国外金属矿山,1990(11):68-72.
    [57]张幼蒂.采矿系统工程研究现状与展望[J].中国矿业大学学报,1994(2):196-202.
    [58]林在康,燕雪峰.采矿CAD软件包体系模型[J].中国矿业大学学报,2000,29(1):308-311.
    [59]陈建宏,周智勇,古德生.采矿CAD系统研究现状与关键技术[J].金属矿山,2004(10):5-8.
    [60]吕文生,蔡嗣经,杨鹏.矿山现代设计方法探讨[J].矿冶,2003(4):16-18.
    [61]余仙金.地质勘探中三维GIS技术的分析与探讨[J].建材与装饰,2008(6):327-328.
    [62]孙家广等.计算机图形学(第三版)[M].北京:清华大学出版社,1998.
    [63]B. Sheiderrnan. Direct manipulation A Step Beyond Programming Languages[J]. IEEE Computer,1983,16(8).
    [64]马卫娟,方志刚.人机交互风格及其发展趋势[J].航空计算技术,1999(3):16-20.
    [65]吕苗荣.信息提取与矿山信息系统的研究开发[D]. 中南大学,2003.
    [66]李壮阔.矿山信息系统体系结构研究与矿山数据集成与分析基础平台开发[D].昆明理工大学,2004.
    [67]李学锋.矿山企业数据仓库的应用研究[D]. 昆明理工大学,2005.
    [68]孙昌爱,金茂忠,刘超.软件体系结构研究综述[J].软件学报,2002(7):1228-1237.
    [69]D.E. Perry. Software engineering and software architecture. In:Feng, Yu-lin, ed. Proceedings of the International Conference on Software:Theory and Practice[M]. Beijing:Electronic Industry Press,2000.
    [70]Boehm.B. Engineering context (for software architecture), invited talk, In:Garlan D., ed. Proceedings of the 1st International Workshop on Architecture for Software Systems Seattle[M]. New York:ACM Press,1995.
    [71]Zhang Shi-kun, Wang li-fu,Yang fu-qing. Architecture based software develpoment model[J]. Research and Development of World Techno logy,1999,21(3):31-35.
    [72]Sun Chang-ai, Jin Maozhong,Liu Chao. Overviews on software architecture research[J]. Journal of Software,2002,13(7):1228-1235.
    [73]Zhang Guang-quan, Zhu Xue-yang,Zheng Jian-dan. Research of software architecture based on the temporal logic language XYZ/E (Ⅱ)-a description of typical architecture style[J]. Journal of Chongqing Normal University (Natural Science Edition),2002, 19(1):1-3.
    [74]尚建嘎,刘修国,张宝一.层次风格固体矿产储量估算软件体系结构设计[J].计算机应用研究,2007(8):255-261.
    [75]张友升.软件体系结构[M].北京:清华大学出版社,2004.
    [76]Jerry Anderson. ActiveX Programming with Visual C++5.0[M].北京:清华大学出版社,1998.
    [77]Tom Armstrong,Ron Patton. ATL开发指南(第二版)[M].北京:电子工业出版社,2000.
    [78]伯克斯(Box.D),潘爱民译.COM本质论[M].北京:中国电力出版社,2001.
    [79]Edward Yourdon, Carl Argila,殷人昆等译.实用面向对象软件工程教程[M]. 电子工业出版社,1998.
    [80]李俊娥,周洞.平台\插件”软件体系结构风格[J].小型微型计算机系统,2007,28(5):877-881.
    [81]颜辉武.体视化技术及其在地下水资源研究中的应用[D].武汉大学,2002.
    [82]彭群生,鲍虎军,金小刚.计算机真实感图形的算法基础[M].北京:科学出版社,1999.
    [83]Ken Shocmake. A User Interface for Specifying Three-Dimensional Orientation Using a Mouse. Proceedings of the Conference on Graphics interface'92.1992.
    [84]马小虎,潘志庚,石教英.基于凹凸顶点判定的简单多边形Delaunay三角剖分[J].计算机辅助设计与图形学学报,1999,11(1):1-3.
    [85]Garey M R, Johnson D S,et al Preparata F P. Triangulating a simple polygon[J]. Information Proceeding Letters,1978,7(4):175-179.
    [86]R. Seidel. A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons [J]. Comput. Geom. Theory Appl,1991,1(1):51-64.
    [87]B. Chazelle. Discrete Comp. Geom[J]. Triangulating a simple polygon in linear time, 1991,6(5):485-524.
    [88]Wu Liang. Fast and Robust Simple Polygon Triangulation With/Without Holes by Sweep Line Algorithm. http://www.mema.ucl.ac.be/-wu/Poly2Tri/poly2tri.html. 2007-03-18].
    [89]李学军,黄文清.平面区域三角化的快速算法[J].计算机辅助设计与图形学学报,2003,15(2):233-238.
    [90]刘海涛,张三元,叶修梓.一种快速相容三角剖分算法[J].计算机应用研究,2007(1):235-237.
    [91]罗广祥,马智民.基于单调性图形综合的面状要素名称注记定位线确定[J].地球科学与环境学报,2004,26(2):75-80.
    [92]Philip J, Schneider,David H.Eberly. Geometric tools for computer Graphics[M]. Beijing Publishing House of Electronics Industry,2004.
    [93]陈向平,应道宁.统一于NIP的多边形三角剖分算法[J].计算机学报,1989 12(3):194-199.
    [94]邓先礼,胡达等.多连通多边形三角化找桥算法的研究及实现[J].计算机与现代化,2004(5):4-6.
    [95]徐春蕾,李思昆.一种适用任意平面多边形的三角剖分算法[J].国防科技大学学报,2000,22(2):82-85.
    [96]SLOAN S W. A fast algorithm for constructing delaunay triangulation in the plane [J]. Advanced Engineering Software,1987,9(1):34-55.
    [97]SLOAN S W. A fast algorithm for constructing delaunay triangulation in the plane[J]. A dvanced Engineering Software,1987,9 (1):34-55.
    [98]李立新,谭建荣.约束Delaunay三角网剖分中强行嵌入约束边的对角线交换算法[J].计算机学报,1999,22(10):1114-1118.
    [99]刘学军,龚健雅.约束数据域的Delaunay三角剖分与修改算法[J].测绘学报,2001,30(1):82-88.
    [100]D. Meyers, S. Skinner,K Sloan. Surfaces from Contours,ACM Transactions on Graphics[J],1992,11(3):228-258.
    [101]M.W. Jones,M. Chen. A new approach to the construction of surfaces from contour data[C]. in Euroigraphics'94.1994.
    [102]Meyers D. Reconstruction of surfaces from planar contours [D]. University of Washington,1991.
    [103]李梅,毛善君,马蔼乃.平行轮廓线三维矿体重建算法[J].计算机辅助设计与图形学学报,2006(7):1017-1021.
    [104]吴涛,刘金义.基于轮廓线的三维重建方法的研究[J].抚顺石油学院学报,1999(3):44-48.
    [105]张勇,纪凤欣,欧宗瑛等.一种由二维轮廓线重建物体表面的方法[J].小型微型计算机系统,2002(12):1514-1516.
    [106]陈敏,鲍旭东.由任意形状轮廓线重建三维表面的方法研究[J].计算机工程与应用,2006(12):73-76.
    [107]Shinagawa Y,Kunii T L. Constructing a reeb graph automatically from corss section[J]. IEEE Computer Graphics graph and Application,1991,11(6):44-51.
    [108]Kergosein Y L. Generic sign systems in medical imaging[J]. IEEE Computer Graphics and Application,1991,11(5):46-65.
    [109]Ekoule A B, Peyrin F C,Odet C L. A triangulation algorithm from arbitrary shaped multiple planar contours[J]. ACM Transaction on Graphics,1991,10(2): 182-199.
    [110]Marsan A L,Dutta D. Computational techniques for automatically tilling and skinning branched obiects[J]. Computers&Graphics,1999(23):111-126
    [111]Meyers D, Skinner S,Sloan K. Surface from contours.[J]. ACM Transaction on Graphics,1992,11(3):228-258.
    [112]Bresler Y, Fessler J A,Macovski A. A Bayesian approach to reconstruction from incomplete projections of a multiple objects 3D domain[J]. IEEE Transaction on Analysis and Machine intelligent,1989,11(8):840-858.
    [113]Christiansen H N,Sederberg T W. Conversion of complex contour linedefinitions into polygonal element mosaics[J]. Computer Graphics 1978,12(3):187-192.
    [114]Xu M H,fang Z S. General surface reconstruction from a set of planar contours[J].清华大学学报,1997,37(4):59-64.
    [115]Keppel E. Approximating complex surfaces lines[J]. IBM Journal of Research Development,by triangulation of contour,1975,19(1):2-11.
    [116]陈凌钧,金建荣,汪国昭.三维重建的统一方法—模拟退火法[J].计算机学报, 1997,20(12):1133-1136.
    [117]金建荣,陈凌钧.三维重建的神经网络算法[J].浙江大学学报,1998,32(1):15-20.
    [118]Moshfeghi M. Matching of multimodality medical images[J]. Graphical Models and Image Processing,1991,53(3):102-112.
    [119]管伟光,马颂德.具有形变的平面轮廓匹配问题[J].自动化学报,1994,22(6):666-671.
    [120]Jones M W,Chen Min. A new approach to the construction of surfaces from contour data[J]. Computer Graphics Forum,1994,13(3):75-84.
    [121]Cong G,Parvin B. An algebraic solution to surface recovery cross-section contours[J]. Graphical Models and Image Processing,1999(61):222-243.
    [122]Lorensen W E,Cline H E. Marching cubes:a high resolution 3D surface construction algorithm[J]. Computer Graphics,1987,21(4):163-169.
    [123]Xu S B,Lu W X. Surface reconstruction of 3D objects in computerized tomography[J], Computer Vision Graphics Image Processing,1988,44(3):270-278.
    [124]S. Ganapathy,T. G. Dennehy. A NEW GENERAL TRIANGULATION METHOD FOR PLANAR CONTOURS[J]. Computer Graphics,1982,16(3):69-75.
    [125]H Fuchs,Z. Kedem, et al. Optimal Surface Reconstruction from Plannar Contours[J]. CACM,1977,20.
    [126]刘钢,王锐,鲍虎军等.一种可见外壳生成算法[J].软件学报,2002(13):1823-1828.
    [127]张勇,纪凤欣,欧宗瑛等.一种由二维轮廓线重建物体表面的方法[J].小型微型计算机系统,2002(12):1514-1516.
    [128]Rosenfeld A,Pfaltz J.L. Sequential operations in digital picture processing[J]. Journal of ACM,1966,13(4):471-494.
    [129]Borgefors G. Distance transform in arbitrary dimensions [J]. Computer Vision, Graphics, and Image Processing,1984 27(3):321-345.
    [130]王钲旋,李文辉,庞云阶.基于围线追踪的完全欧氏距离变换算法[J].计算机学报,1998,21(3):217-222.
    [131]Olivier Cuisenaire,Benoit Macq. Fast Euclidean distance trans-formations by propagation using multiple neighbourhoods[J]. Computer Vision and Image Understanding,1999,76(2):163-172.
    [132]刘相滨,邹北骥,孙家.基于边界跟踪的快速欧氏距离变换算法[J].计算机学报,2006,29(2):108-114.
    [133]Doi A,Koide A. An efficient method of triangulating equi-valued surfaces by using tetrahedral cells[J]. IEICE Transactions,1991, E74(1):214-224.
    [134]Durst M J. Additional reference to marching cubes [J]. Computer Graphics,1988, 22(2):72-73.
    [135]Cignoni P, Ganovelli F,et al Montani. Reconstruction of topologically correct and adaptive trilinear surfaces[J]. Computers and Graphics,2000,24(3):399-418.
    [136]Nielson G,Hamann B. The asymptotic decider:resolving the ambiguity in marching cubes[C]. in Proceedings of Visualization'91.1991. Los Alamitos CA.
    [137]William J S, Jonathan A Z,William E L. Decimation of triangle meshes[J]. Computer Graphics,1992,26(2):65-70.
    [138]Kalvin A,Taylor R. Superfaces:Polygonal mesh simplification with bounded error[J]. IEEE Computer Graphics & Application,1996,16(3):64-77.
    [139]Hoppe H,DeRose T. Mesh optimization[J]. Computer Graphics,1993,27(1):19-26.
    [140]Garland M,Heckbert P S. Surface simplification using quadric error metrics[J]. Computer Graphics,,1997,31(3):209-216.
    [141]Hoppe H,De Rose T. Mesh Optimization[C]. in Proc.of the Computer Graphics.1993.
    [142]郭开波,张李超,王从军等.STL模型布尔运算的实现[J].华中科技大学学报(自然科学版).2006,34(7):97-99.
    [143]Mantyla M. Boolean operations of 2-manifolds through vertex neighborhood classification[J]. ACM Transactions on Graphics,1986,5(1):1-229.
    [144]Gottschalk S, Lin M C,Manocha D. OBBTree:A hierarchical structure for rapid interference detection[C]. in Computer Graphics (SIGGRAPH'96).1996. New Orleans, LA, USA.
    [145]S. Gottschalk. Separating axis theorem[C]. in Technical Report TR96-024.1996. Department of Computer Science, UNC Chapel Hill.
    [146]Moller Tomas. A Fast Triangle-Triangle Intersection Test, Journal of Graphics Tools[J], 1997,2(2):25-30.
    [147]F.S.Hill.计算机图形学[M].北京:2006.
    [148]唐泽圣.三维数据场可视化[M]. 北京:清华大学出版社,1999.
    [149]杨奎奇,宋振玲.OpenGL在巷道三维显示中的应用[J].兰州工业高等专科学校学报,2004,11(2):8-11.
    [150]魏占营,王宝山,李青元.地下巷道的三维建模及C++实现[J].武汉大学学报:信息科学版,2005,30(7):650-653.
    [151]张海明,孙燕,郭丹.基于OpenGL的三维虚拟煤矿系统的实现[J].科学技术与工程,2007,7(4):643-645.
    [152]孙卡,翁正平,等张志庭.基于带约束三角剖分的三维巷道建模方法[J].矿业研究与开发,2007,27(5):64-65.
    [153]僧德文,李仲学,李春民.地矿工程三维数据场可视化仿真技术[J].金属矿山,2004(12):51-54.
    [154]王志宏,陈应显.露天矿三维可视化矿床地质模型的建立[J].辽宁工程技术大学学报,2004,23(2):145-148.
    [155]赵景昌,陈鹏.露天矿短期采剥计划CAD系统的开发[J].辽宁工程技术大学学报,2006,25(5):666-668.
    [156]申闫春,才庆祥等.虚拟现实技术在露天矿生态重建仿真中的应用[J].中国矿业大学学报,2002,31(1):1-5.
    [157]陈冲,张莹等.基于Extend的大型露天矿卡车调度系统仿真[J].系统仿真学报,2007,19(4):914-921.
    [158]蒲浩,宋占峰等.基于约束Delaunay三角剖分的道路三维建模方法[J].华中科技大学学报(自然科),2005,33(6):111-113
    [159]Salmon J,Warren M. Parallel, out-of-core methods for n-body simulation[C]. in Proceedings of 8th SIAM Conference on Parallel Processing for Scientific Computing 1997. Minneapolis,MN.
    [160]Tu T,0 D. R. Etree:a Database-oriented Method for Generating Large Octree Meshes[J]. Engineering with Computers,2004,20(2):117-128.
    [161]吕广宪,潘懋,吴焕萍等.面向真三维地学建模的海量虚拟八叉树模型研究[J].北京大学学报(自然科学版),2007(4):496-501.
    [162]毕林,王李管,陈建宏等.基于八叉树的复杂地质体块段模型建模技术[J].中国矿业大学学报2008,4:532-537.
    [163]荆永滨,王李管,毕林.复杂矿体的块段模型建模算法[J].华中科技大学学报(自然科学版),2010(2):97-100.
    [164]Feito FR,Torres JCI. Inclusion test for general polyhedra[J]. Computers & Graphics, 1997,21(1):23-30.
    [165]李清泉,李德仁.八叉树的三维行程编码[J].武汉测绘科技大学学报,1997,22(2):102-106.
    [166]G. M. Morton. A computer oriented geodetic data base and a new technique in file sequencing. Technical report,IBM. Ottawa, Canada,1966.
    [167]R. Bayer,E. M. McCreight. Organization and maintenance of large ordered indices[J]. Acta Informatica,1972(1):173-189.
    [168]D. ComerT. he ubiquitous B-Tree[J]. ACM Comput Surv,1979(11):121-137.
    [169]J. Gray,A. Reuter. Transaction processing:concepts and techniques[M]. San Francisco:Morgan Kaufmann,1992.
    [170]A. Silberschatz, H. F. Korth,S. Sudarshan. Database system concepts[M]. New York:
    McGrall Hill,1997.
    [171]严蔚敏,吴伟民.数据结构[M].北京:清华大学出版社,2001.
    [172]Jack. A. Orenstein,T. H. Merrett. A class of data structure for associative searching[C]. in In Proceedings of ACMSIGACT-SIGMOD.1984. Waterloo,Ontario,Canada.
    [173]Jack. A,Orenstein. Spatial query processing in an object-oriented database system[C]. in In Proceedings of ACMSIGMOD.1986. Washington D.C.
    [174]MOKBEL MF, AREFWG,KAMEL I. Analysis of multi-dimensional space-filling curves[J]. Geo Informatica,2003,7(7):179-209.
    [175]Christos Faloutsos,Shari Roseman. Fractals for secondary key retrieval[C]. in In Proceedings of the Eighth ACMSIGACT-SIGMID-SIGART Symposium on Principles of Database Systems (PODS).1989.
    [176]Vitter J. External memory algorithms and data structures:Dealing with massive data[J]. ACM Computing Surveys 2001,33(2):209-271.
    [177]S. Anand,Kenneth Knott. An algorithm for converting the boundary representation of a CAD model to its octree representation[J]. Computers & Industrial Engineering,1991, 21(4):343-347.
    [178]Jiang YD. Block model conversion using binary space partitioning trees[J]. Computers & Geosciences,1996,22(4):409-417.
    [179]I. Gargantini HHA. Ray Tracing an Octree:Numerical Evaluation of the First Intersection[J]. Computer Graphics Forum,1993,12(4):199-210.
    [180]Ogayar CJ, Segura RJ,Feito FR. Point in solid strategies [J]. Computers & Graphics, 2005,29(4):616-624.
    [181]Taylor G. Point in polygon test[J]. Survey Review,1994,32(254):479-484.
    [182]Hormann K Agathos A. The point in polygon problem for arbitrary polygons [J]. Computational Geometry,2001(20):131-144.
    [183]张耀波.内点判别法的一种新算法[J].测绘信息与工程,1998(4):17-19.
    [184]王学军.基于左边的点在简单多边形内的判别算法[J].机械工程师,2006(2):53-54.
    [185]夏仁波,刘伟军,王越超.点在平面多边形内外的判断方法[J].机械工程学报,2006,42(3):130-135.
    [186]龚健雅.地理信息系统基础[M].北京:科学出版社,2001.
    [187]熊磊,杨鹏,李贺英.基于不规则四面体的矿床三维体视化模型[J].北京科技大学学报,2006(8):716-720.
    [188]龚君芳,吴信才,刘修国等.三维四面体网格模型在固体矿产储量估算中的研究与应用[J].金属矿山,2008(9):87-89.
    [189]何鑫,王李管.一种基于八叉树的地质体三维网格剖分方法[J].金属矿山,2008(11):65-70.
    [190]关振群,宋超,顾元宪等.有限元网格生成方法研究的新进展[J].计算机辅助设计与图形学学报,200315(1):1-14.
    [191]Levoy M. Display of Surfaces from Volume Data[J]. IEEEComputer Graphics& Applications,1988,8(3):29-37.
    [192]魏继增,孙济洲.基于Ray-casting算法的并行存储系统[J].计算机工程,2009,35(3):47-52.
    [193]WU Q,XU H. An effective method for 3D geological modeling with multi-source data integration[J]. Computers&Geosciences,2005,31(1):35-43.
    [194]洪雄,张建勋,曾庆森.基于似三棱柱构模的三维地质体的剖切[J].计算机工程与设计,2008,29(15):4097-4099.
    [195]朱良峰,任开蕾,潘信等.地质实体模型的三维交互与分析技术研究[J].岩土力学,2007,28(9):1096-1963.
    [196]陈国良,刘修国,尚建嘎等.三维地质结构模型的切割分析技术及方法[J].计算机工程,2007,33(20):184-186.
    [197]周翠英,董立国,刘祚秋等.OpenGL三维地层切割面的实现技术[J].土木工程学报,2006,39(2):62-65.
    [198]Bentley J L. Multidimensional binary search trees used for associatived searching[J]. Comm.ACM 1975:509-517.
    [199]Bentley J L. Kd Trees for Semidynamic Point Sets. The 6th Annual ACM Symposium on Computational Geometry. San Francisco,1990.
    [200]吴焕萍,潘懋,胡金星等.基于空间索引的规则格网DTM内插算法研究[J].地理与地理信息科学,2004,20(1):43-46.
    [201]刘春,史文中,刘大杰.导航电子地图中道路数据的空间索引和组织[J].工程勘察,2003(1):38-41.
    [202]J.Wilhelms,A. V. Gelder. Octrees for faster isosurface generation[J]. ACM Transactions on Graphics,1992,11(3):201-227.
    [203]曹代勇,王占刚.三维地质模型特殊可视化操作的实现[J].煤炭学报,2004,29(4):422-424.
    [204]工军锋,黄勇,匡勇等.地面数字模型的建立及在矿山中的应用[J].露大采矿技术,2004(5):33-35.
    [205]吴清海.露天煤矿采剥量计算方法[J].煤炭工程,2008(11):21-22.
    [206]王神虎,邢存恩,崔永丰.基于GIS巷道工程量自动统计计算系统的研究[J].山西煤炭,2005,25(4):11-15.
    [207]陈学工,潘懋.空间散乱点集Delaunay四面体剖分切割算法[J].计算机辅助设计与图形学学报,2002(1).
    [208]庞明勇,戴文俊.基于体积分布特征匹配的三维实体网格模型检索[J].系统仿真学报,2007(1):30-34.
    [209]王泉德.任意三角网格模型体积的快速精确计算方法[J].计算机工程与应用,2009,45(18):32-34.
    [210]A.M Alyassin et. al. Evaluation of new algorithms for the interactive measurement of surface area and volume[J]. Med. Phys,1994,21(6):741-751.
    [211]Goldman,Ronald N. Area of Planar Polygons and Volume of Polyhedra, Graphics Gems II[M]. New York:Academic Press,1991.

© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号

地址:北京市海淀区学院路29号 邮编:100083

电话:办公室:(+86 10)66554848;文献借阅、咨询服务、科技查新:66554700