三维地质勘查软件核心技术研究与实现
|
摘要
地质勘查软件能够辅助地质人员建立三维数据模型,进行矿床模拟、开采评估、设计规划、生产管理等工作,国外早在20世纪70年代就已开始对该类型的软件做研发工作,而国内尚没有成熟的软件。本文是从2005年至今的5年时间中,对研发三维矿山勘查软件探矿者MinESoft的理论和实践总结。在研发三维勘查软件的过程中,借鉴了同类软件的优点,探索出“二维-三维并举”“三维可视化3DEM模式”等方案,提出了地质信息系统的概念,加强了计算机信息技术与地学专业的结合,实现了地质三维可视化。
探矿者MinESoft软件基于Windows平台,使用VC++2005编译,以OpenGL做三维渲染,各种算法均由探矿者研发团队独立设计实现,是独立平台的矿山三维勘查软件。在参与算法设计和实践编程的过程中,完成的模块主要有：二维符号库设计模块、二维矢量制图模块、3DEM三维建模模块(单工程矿体圈定、剖面编辑、三维重建)、三维空间分析模块、储量计算模块(地质块段法、地质截面法)；此外,设计并实现了两套完整的数据结构：扩展的二维FTR拓扑数据结构、三维T-Rep拓扑数据结构。
相对于国内外同类软件,上述模块中的主要创新点有：
1.设计了FTR二维拓扑数据结构和属性存储结构；通过复合要素的概念,解决了悬挂弧段、多边形桥连、尖连等经典拓扑意义下无法处理的问题。
2.结合B-Rep等广泛使用的三维数据结构,提出了支持三维拓扑关系的T-Rep数据结构。该结构在保持了拓扑的完整性的同时,简化了三维数据结构的复杂性；并在T-Rep数据结构之上,完成了三维叠置分析、缓冲区分析等空间分析问题。
3.参考现有的三维重建理论,同时实现了模拟退火遗传算法和MP移动棱台算法,二者相互补充,可完成绝大多数情况下的三维重建问题；
4.将三维可视化技术与我国传统的地质储量估算方法相结合,使得在完成三维地质实体建模的同时,可以方便的使用地质块段法、地质截面法等方法进行储量估算。
Geological survey software can assist the geologists to build three-dimensional data model in computer, which can work in ore deposit simulation, mine assessment, design planning, mine management, etc. As early as 1970s, this kind of software has been developed in foreign country. However, we have no mature geological survey software now. Therefore, we have been developing this three dimensional mine survey software in the last five years, which we call it "TanKuangZhe"(MinESoft). During the developing, we came up with new concept "Geology Information System", and added two-dimensional module in three-dimensional system. Combining computer information technology with geosciences, we implements geology three-dimensional visualization.
MinESoft is based on Windows platform, compiled with VS Studio 2005(VC++ language), rendered in OpenGL library. All algorithms are developed ourselves. As my part, I took part in this software developing from August 2005 until now. The module I have finished are as follows, "Two-Dimensional Symbol Editor", "Two-Dimensional Vector Editor"(Includes topology and attribute library), "3DEM Three-Dimensional Modeling"(Includes demarcating single engineering mine, section editor, three-dimensional reconstruction), "Three-dimensional spatial analysis", "Reserves estimation"(Includes geological ore block method, geological cross section method). Furthermore, I have designed and implement two data structure, one is used in two-dimensional called "Extended FTR two dimension topology data structure", the other is used in three-dimensional called "T-Rep topology data structure".
Firstly, Extended FTR two-dimensional topology data structure and its attribute library will be introduced. In this chapter, some techniques will be used in dealing with "suspend arcs", "bridged polygon", "pointed polygon" problems. On that base, T-Rep topology data structure in three-dimensional will be introduced in detail. Then two methods of three-dimensional reconstruction will be imported, which are simulated annealing genetic algorithm and marching prismoid algorithm. As its application, some algorithms will be described. Through read this chapter, the essential part of this software can be acquired.
Some innovations are brought forth during this software. First is a concept called compound feature, with an Extended FTR two-dimensional topology data structure. This data structure can solve suspend arcs, bridged polygon, pointed polygon problems. Using B-Rep for reference, T-Rep topology data structure in three-dimensional is raised. T-Rep maintains the integrity of three-dimensional topology; meanwhile, T-Rep simplifies three-dimensional topology complexities. Two methods of three-dimensional reconstruction will be imported, which are simulated annealing genetic algorithm and marching prismoid algorithm. The two algorithms complete each other. One is good at reconstructing complex curve, while the other can solve branching problem. Finally, MinESoft combines three-dimensional visualization and geology completing three-dimensional data module. We can use geological ore block method or geological cross section method to do reserves estimation.
探矿者MinESoft软件基于Windows平台,使用VC++2005编译,以OpenGL做三维渲染,各种算法均由探矿者研发团队独立设计实现,是独立平台的矿山三维勘查软件。在参与算法设计和实践编程的过程中,完成的模块主要有：二维符号库设计模块、二维矢量制图模块、3DEM三维建模模块(单工程矿体圈定、剖面编辑、三维重建)、三维空间分析模块、储量计算模块(地质块段法、地质截面法)；此外,设计并实现了两套完整的数据结构：扩展的二维FTR拓扑数据结构、三维T-Rep拓扑数据结构。
相对于国内外同类软件,上述模块中的主要创新点有：
1.设计了FTR二维拓扑数据结构和属性存储结构；通过复合要素的概念,解决了悬挂弧段、多边形桥连、尖连等经典拓扑意义下无法处理的问题。
2.结合B-Rep等广泛使用的三维数据结构,提出了支持三维拓扑关系的T-Rep数据结构。该结构在保持了拓扑的完整性的同时,简化了三维数据结构的复杂性；并在T-Rep数据结构之上,完成了三维叠置分析、缓冲区分析等空间分析问题。
3.参考现有的三维重建理论,同时实现了模拟退火遗传算法和MP移动棱台算法,二者相互补充,可完成绝大多数情况下的三维重建问题；
4.将三维可视化技术与我国传统的地质储量估算方法相结合,使得在完成三维地质实体建模的同时,可以方便的使用地质块段法、地质截面法等方法进行储量估算。
Geological survey software can assist the geologists to build three-dimensional data model in computer, which can work in ore deposit simulation, mine assessment, design planning, mine management, etc. As early as 1970s, this kind of software has been developed in foreign country. However, we have no mature geological survey software now. Therefore, we have been developing this three dimensional mine survey software in the last five years, which we call it "TanKuangZhe"(MinESoft). During the developing, we came up with new concept "Geology Information System", and added two-dimensional module in three-dimensional system. Combining computer information technology with geosciences, we implements geology three-dimensional visualization.
MinESoft is based on Windows platform, compiled with VS Studio 2005(VC++ language), rendered in OpenGL library. All algorithms are developed ourselves. As my part, I took part in this software developing from August 2005 until now. The module I have finished are as follows, "Two-Dimensional Symbol Editor", "Two-Dimensional Vector Editor"(Includes topology and attribute library), "3DEM Three-Dimensional Modeling"(Includes demarcating single engineering mine, section editor, three-dimensional reconstruction), "Three-dimensional spatial analysis", "Reserves estimation"(Includes geological ore block method, geological cross section method). Furthermore, I have designed and implement two data structure, one is used in two-dimensional called "Extended FTR two dimension topology data structure", the other is used in three-dimensional called "T-Rep topology data structure".
Firstly, Extended FTR two-dimensional topology data structure and its attribute library will be introduced. In this chapter, some techniques will be used in dealing with "suspend arcs", "bridged polygon", "pointed polygon" problems. On that base, T-Rep topology data structure in three-dimensional will be introduced in detail. Then two methods of three-dimensional reconstruction will be imported, which are simulated annealing genetic algorithm and marching prismoid algorithm. As its application, some algorithms will be described. Through read this chapter, the essential part of this software can be acquired.
Some innovations are brought forth during this software. First is a concept called compound feature, with an Extended FTR two-dimensional topology data structure. This data structure can solve suspend arcs, bridged polygon, pointed polygon problems. Using B-Rep for reference, T-Rep topology data structure in three-dimensional is raised. T-Rep maintains the integrity of three-dimensional topology; meanwhile, T-Rep simplifies three-dimensional topology complexities. Two methods of three-dimensional reconstruction will be imported, which are simulated annealing genetic algorithm and marching prismoid algorithm. The two algorithms complete each other. One is good at reconstructing complex curve, while the other can solve branching problem. Finally, MinESoft combines three-dimensional visualization and geology completing three-dimensional data module. We can use geological ore block method or geological cross section method to do reserves estimation.
引文
[1]Marien Molennar. A topology for 3D vector maps [M]. ITC Journal,1992:25-33.
[2]Journel GSLIB Geostatistical Software Library and User's Guide[M]. New York Oxford,1998.
[3]Jeffrey Start, John Estes. Geographic Information Systems[M]. Prentice Hall,1990.
[4]王家耀.空间信息系统原理[M].北京：科学出版社,2001.
[5]邬伦,刘瑜等,地理信息系统[M].北京：科学出版社,2001.
[6]汤国安,赵牡丹,地理信息系统[M].北京：科学出版社,2000.
[7]陈俊,宫鹏,实用地理信息系统[M].北京：科学出版社,1998.
[8]修文群,池天河,城市地理信息系统[M].北京：希望电子出版社,1999.
[9]龚健雅,地理信息系统基础[M].北京：科学出版社,2001：84-85.
[10]吴信才,地理信息系统原理与方法[M].北京：电子工业出版社,2002：24-28.
[11]夏炎等,三维地质模型的数据结构研究[M].北京：地质出版社,1997.
[12]孙家广等,计算机图形学[M].北京：清华大学出版社,1995.
[13]李超岭等,VES可视化固体矿产勘查微机评价系统,矿产资源储量计算汇编[M].北京：地质出版社,2000.
[14]邓德善,金属、非储量计算,矿产资源储量计算汇编[M].北京：地质出版社,2000.
[15]谢荣安,GIS数据模型设计中的问题探讨[J].地矿测绘,2004,20(4)：6-8.
[16]祁华斌等.基于ArcGIS的地图符号库建立与符号化实施[J].测绘通报,2003(1).
[17]李海萍,PC ARC/INFODE符号系统及其地图符号设计方法[J].西北师范大学学报,1998,34(4).
[18]强建华,基于ArcGIS的矿产资源类型符号库的设计与实现[J].中国煤炭地质,2009,21(9).
[19]刘新贵,孙群,赵国成,肖强,一种实用的点状符号库快速建立与显示方法[J].地理空间信息,2009,7(1).
[20]李志刚,电子地图的信息特性[J].测绘学院学报,2002(3).
[21]肖克炎,夏立显,邹伟,李楠,陈郑辉等,地质勘探三维可视化技术与系统开发[M].北京：中国大地出版社,2009.
[22]赵军喜,GIS中地图符号库的设计与实现[D].郑州：解放军测绘学院,1999.
[23]杜清运,地图数据库中多边形数据的自动组织[J].测绘学报,1989(3).
[24]朱长青,史文中,空间分析建模与原理[M].北京：科学出版社,2006.
[25]刘胡瑶,基于轨迹计算的临界多边形求解算法[J].计算机辅助设计与图形学学报,2006(8).
[26]方志祥,GIS矩形网格中任意多边形裁剪算法[J].武汉理工大学学报(交通科学与工程版),2005(5).
[27]陈正鸣,多边形链求交的改进算法[J].计算机辅助设计与图形学学报,2004(12).
[28]徐智渊,一种用于光线与三角形网格求交运算的有效剔除算法[J].软件学报,2003(10).
[29]明镜,北京市新生界三维地质结构模型构建[J].北京大学学报(自然科学版),2009(1)：111-119.
[30]熊祖强,工程地质三维建模及分析系统设计研究[J].岩石力学与工程学报,2007(S2).
[31]刘军旗,矿产资源勘查定量化表达的集成模式与关键技术[J].地球科学(中国地质大学学报),2009(2).
[32]冯斌,海洋地质调查数据库管理系统设计与实现[J].计算机工程,2009(3).
[33]李明超,基于三维地质模型的工程岩体结构精细数值建模[J].岩石力学与工程学报,2007(9).
[34]朱良峰,地质实体模型的三维交互与分析技术研究[J].岩土力学,2007(9).
[35]李军,一种基于耦合的三维拓扑结构表示方法[J].国防科技大学学报,2002(3).
[36]王孝通,基于R树面向对象的航海资料数据模型[J].中国航海,1998(2).
[37]陈晟,优化的R-树缓冲管理算法[J].计算机学报,1999(5).
[38]李开生,高层体系结构中DDM数据过滤方法[J].系统仿真学报,2009(8).
[39]郑炜,DPHI-Tree一种新型的并行高维主存索引树[J].西北工业大学学报,2009(4).
[40]姚秋林,一种空间更优的数据流查询包含编码区间索引[J].软件学报,2009(9).
[41]刘润涛,一种极小化交叠空间数据索引结构[J].哈尔滨工程大学学报,2009(8).
[42]孙殿柱,基于动态空间索引结构的三角网格模型布尔运算[J].计算机辅助设计与图形学学报,2009(9).
[43]蒋涛,一种度量空间中的可逆近邻搜索算法[J].华中科技大学学报(自然科学版),2009(8).
[44]张翀,一种适用于点和区间混合型维度数据集的多维索引[J].国防科技大学学报,2009(3).
[45]谢超,基于参数化模板技术的电子地图设计[J].武汉大学学报(信息科学版),2009(8).
[46]姚山,基于共享的林业地图点状符号库的设计[J].北京林业大学学报,2005(S2).
[47]吴小芳,基于GDI-+的高精度地图符号库的设计与实现[J].武汉大学学报(信息科学版),2004(10).
[48]何忠焕,GIS符号库中复杂线状符号设计技术的研究[J].武汉大学学报(信息科学版),2004(2).
[49]顾步云,基于网格模型的光滑B样条曲面重建算法[J].华南理工大学学报(自然科学版),2007(12).
[50]戴宁,STL数据快速拓扑重建关键算法[J].计算机辅助设计与图形学学报,2005(11).
[51]李芳玉,基于栅格的三维GIS缓冲体分析研究[J].计算机工程,2007(21).
[52]常勇,基于增强现实的空间信息三维可视化及空间分析[J].系统仿真学报,2007(9).
[53]李芳玉,三维缓冲体生成栅格算法研究[J].计算机辅助设计与图形学学报,2005(9).
[54]吴旭彦,GPS实时地图匹配技术中缓冲区分析的研究[J].西南交通大学学报,2001(2).
[55]王生生,混合维拓扑和尺寸关系的定性空间推理[J].计算机研究与发展,2009(7).
[56]成秋明,GIS中的空间建模器技术及其在全国矿产资源潜力预测中的应用[J].地球科学(中 国地质大学学报),2009(2).
[57]张和生,基于地学信息复合叠置分析对煤层底板突水的预测[J].煤炭学报,2009(8).
[58]薛正平,基于决策树和图层叠置的精准农业产量图分析方法[J].农业工程学报,2006(8).
[59]谢忠,简单矢量数据多边形裁剪问题的图模型[J].测绘学报,2009(4).
[60]陈国良,三维地质断层结构模型构建及切割分析技术研究[D].中国地质大学(武汉),2006.
[61]马登武,叶文,李瑛,基于包围盒的碰撞检测算法综述[J].系统仿真学报,2006,18(4)：1058-1062.
[62]张征宇,丁玉成,洪军,STL模型分割截面的三角剖分算法[J].计算机辅助设计与图形学学报,2005,17(6)：1240-1245.
[63]潘胜玲,刘学军,黄雄等,基于Hash函数的T1N拓扑关系重建[J].地理与地理信息科学,2006,2(2)：21-24.
[64]Ivana Kolingerova, Borut Zalik, Improvements to randomized incremental Delaunay insertion, Computers & Graphics[J].2002,26:477-490.
[65]张丽艳,吴熹,三角网格模型上任意两点间近似最短路径算法研究[J].计算机辅助设计与图形学学报,2003,15(5)：592-597.
[66]刘少华,吴东胜,罗小龙等,Delaunay三角网中点目标快速定位算法研究[J].测绘科学,2007,32(2)：69-70.
[67]马小虎,潘志庚,石教英,基于凹凸顶点判定的简单多边形Delaunay三角剖分[J].计算机辅助设计与图形学学报,1999,11(1)：1-3.
[68]Levy B,Petitjean S,Ray N, et al, Least squares conformal maps for automatic texture atlas generation[J]. ACM Trans. on Graphics.2002,21(3):362-371.
[69]李岩,于金辉,石教英,面向三维剪纸的网格模型切割方法[J].软件学报,2006,17(增刊)：169-175.
[70]曹代勇,李青元,朱小弟等,地质构造三维可视化模型探讨[J].地质勘探,2001,37(4).
[71]刘奇,周明全,刘晓宁,一种基于标志点的三维表面模型的切割方法[J].计算机应用研究,2007(2).
[72]Nienhuys HW, van der Stappen AF, A Delaunay approach to interactive cutting in triangulated surfaces. In:Proc. of the 5th Int'l Workshop Algorithmic Foundations of Robotics(WAFR 2002) [M]. Springer-Verlag,2002:113-130.
[73]Philip J.Schneder,David H.Eberly, Geometric Tools for Computer Graphics[J]. Morgan Kaufmann Publishers,2002(7).
[74]N.C.Gabrielides,A.I.Ginnis,P.D.Kaklis,et al. G1-smooth branching surface construction from cross sections[J]. Computer-Aided Design,2007,39 (8):639-651.
[75]Zhang Jiawan,Sun Jizhou,Sun Zhigang. VolGraph a PC-based visualization system for three-dimensional medical reconstructions[J]. Transactions of Tianjin University,2003,9 (3):206-210.
[76]Kwansik Kim. Data level comparisons of direct volume rendering algorithms[D]. Santa Cruz: University of California,2001.
[77]Feng Dong,Gordon J.Clapworthy,Mel Krokos. Volume Rendering of Fine Details Within Medical Data[M].IEEE Visualization,2001.387-394.
[78]C.Rezk-Salama,K.Engel,M.Bauer,et al. Interactive volume on standard PC graphics hardware using multi-textures and multi-stage rasterization[M]. Siggraph/Eurographics Workshop On Graphics Hardware,2000:109-118.
[79]J.Wilhelms,V.Gelder. A coherent projection approach for direct volume rendering[J]. Computer Graphics,1991,25 (4):275-281.
[80]Xu Meihe,Tang Zesheng. General surface reconstruction from a set of planner contours[J]. Journal of Tsinghua University (Science and Technology),1997,37 (4):59-64.
[81]Burr.D.J. Elastic matching of line drawings[J]. IEEE Transactions on Pattern Analysis and Machine Intelligence,1981,3 (6):708-713.
[82]Mehran Moshfeghi. Elastic Matching of multimodality medical images[J]. CVGIP:Graphical Models and Image Processing,1991,53 (3):271-282.
[83]H.N.Christiansen,T.W.Sederberg. Conversion of complex contours line definition into polygonal element mosaics[J]. ACM SIGGRAPH Computer Graphics,1978,12 (3):187-192.
[84]Cook,L.T,Dwyer,S.J,Batnitzky,S,et al. A three dimensional display system for diagnostic imaging applications[J]. IEEE Comp. Graphics Application,1983,3 (5):13-19.
[85]H.Fuchs,Z.M.Kedem,S.P.Uselton. Optimal surface reconstruction from planar contours[J]. Communications of the ACM,1977,20 (10):693-702.
[86]Marsan A L,Dutta D. Computational techniques for automatically tilling and skinning branched objects[J]. Computers & Graphics,1994,23:111-126.
[87]David Meyers,Shelley Skinner,Kenneth Sloan. Surface from contours[J]. ACM Transactions on Graphics,1992,11 (3):228-258.
[88]S.B.Xu,W.X.Lu. Surface reconstruction of 3D objects in computerized tomography. Computer Vision[J].Graphics Image and Processing,1988,44 (3):270-278.
[89]William J. Schroeder, Jonathan A. Zarge, William E. Lorensen. Decimation of triangle meshes[J]. Computer & Graphics.1992,26 (2):65-70.
[90]Mark W. Jones,Min Chen. A new approach to the construction of surfaces from contour data[J]. Computer Graphics Forum,1994,13 (3):75-84.
[91]Z.L.Wang,J.C.M.Teo,C.K.Chui,et al.Computational biomechanical modeling of the lumbar spine using marching-cubes surface smoothened finite element voxel meshing[J]. Computer Methods and Programs in Biomedicine,2005,80 (1):25-35.
[92]Lopes A,Brodlie K. Improving the robustness and accuracy of the marching cubes algorithm for isosurfacing[J]. IEEE Transactions on Visualization and Computer Graphics,2003,9 (1):16-29.
[93]Bend Hamann,Isaac J. Trotts,Gerald E. Farin. On approximating contours of the piecewise trilinear interpolant using triangular rational-quadratic Bezier patches[J]. IEEE Transactions on Visualization and Computer Graphics,1997,3 (3):215-227.
[94]Seungtaik Oh,Bon Ki Koo. Data perturbation for fewer triangles in marching tetrahedra[J]. Graphical Models,2007,69 (3):211-218.
[95]Gabor.T.Herman,Hsun.Kao.Liu. Three-dimensional display of human organs from computed tomograms[J]. Computer Graphics Image Processing,1979,9 (1):1-21.
[96]H. E. Cline,W. E. Lorensen,S. Ludk,et al. Two algorithms for three-dimensional reconstruction of tomograms[J]. Med & Phys,1988,15 (3):320-327.
[97]William E.Lorensen,Harvey E.Cline. Marching Cubes:A high resolution 3D surface construction algorithm[J]. Computer Graphics,1987,21 (4):163-169.
[98]E.Keppel. Approximating complex surfaces by triangulation of contour lines[J]. IBM Journal of Research and Development,1975,19 (1):2-11.
[99]Hai Chen,Kwan-Yee K.Wong,Chen Liang,et al. Extracting surface representations from rim curves[J]. Lecture Notes in Computer Science,2006,732-741.
[100]Meyers D. Reconstruction of surfaces from planar contours:[Doctor of Philosophy Dissertation] [D]. Washington:University of Washington,1994.
[101]J.Jeong,K.Kim,H.Park,et al. A new method for solving branching problems in surface reconstruction[J]. The International Journal of Advanced Manufacturing Technology,2000,16(4):259-264.
[102]Joaquin. Pina Amargos,Rene. Alquezar Mancho. Reconstruction of surface from cross section using skeleton information[J]. A Sanfliu and J. Ruiz- Shucloper CLARP 2003,LNCS 2905,2003.180-187.
[103]Gill Barequet,Matthew Dickerson,David Eppstein. On trianglation three-dimensional polygons. Computational Geometry [J].Theory and Applications,1998,10 (3):155-170.
[104]Michael J. Laszlo. Fast generation and display of iso-surface wireframes[J]. Graphical Models and Image Processing,1992,54 (6):473-483.
[105]P.Cignoni,F. Ganovelli,C. Montani,et al. Reconstruction of topologically correct and adaptive trilinear surfaces[J]. Computers and Graphics,2000,24 (3):399-418.
[106]李小勇,物体表面重建方法的研究与实现[D].中南大学,2007.
[107]徐晓玲,李现民,李桂清等,体素重建中的快速移动立方体方法[J].系统仿真学报,2002,14(4)：509～513.
[108]朱经纬,蒙培生,王乘,基于 MC算法的螺旋CT扫描数据的三维重建[J].华中科技大学学报(自然科学版),2002,3(30)：74～76.
[109]马洪滨,熊俊楠,基于地质统计学的储量估算系统[J].煤炭学报,2007(3).
[110]尚建嘎,刘修国,张宝一,层次风格固体矿产储量估算软件体系结构设计[J].计算机应用研究,2007(8).
[2]Journel GSLIB Geostatistical Software Library and User's Guide[M]. New York Oxford,1998.
[3]Jeffrey Start, John Estes. Geographic Information Systems[M]. Prentice Hall,1990.
[4]王家耀.空间信息系统原理[M].北京：科学出版社,2001.
[5]邬伦,刘瑜等,地理信息系统[M].北京：科学出版社,2001.
[6]汤国安,赵牡丹,地理信息系统[M].北京：科学出版社,2000.
[7]陈俊,宫鹏,实用地理信息系统[M].北京：科学出版社,1998.
[8]修文群,池天河,城市地理信息系统[M].北京：希望电子出版社,1999.
[9]龚健雅,地理信息系统基础[M].北京：科学出版社,2001：84-85.
[10]吴信才,地理信息系统原理与方法[M].北京：电子工业出版社,2002：24-28.
[11]夏炎等,三维地质模型的数据结构研究[M].北京：地质出版社,1997.
[12]孙家广等,计算机图形学[M].北京：清华大学出版社,1995.
[13]李超岭等,VES可视化固体矿产勘查微机评价系统,矿产资源储量计算汇编[M].北京：地质出版社,2000.
[14]邓德善,金属、非储量计算,矿产资源储量计算汇编[M].北京：地质出版社,2000.
[15]谢荣安,GIS数据模型设计中的问题探讨[J].地矿测绘,2004,20(4)：6-8.
[16]祁华斌等.基于ArcGIS的地图符号库建立与符号化实施[J].测绘通报,2003(1).
[17]李海萍,PC ARC/INFODE符号系统及其地图符号设计方法[J].西北师范大学学报,1998,34(4).
[18]强建华,基于ArcGIS的矿产资源类型符号库的设计与实现[J].中国煤炭地质,2009,21(9).
[19]刘新贵,孙群,赵国成,肖强,一种实用的点状符号库快速建立与显示方法[J].地理空间信息,2009,7(1).
[20]李志刚,电子地图的信息特性[J].测绘学院学报,2002(3).
[21]肖克炎,夏立显,邹伟,李楠,陈郑辉等,地质勘探三维可视化技术与系统开发[M].北京：中国大地出版社,2009.
[22]赵军喜,GIS中地图符号库的设计与实现[D].郑州：解放军测绘学院,1999.
[23]杜清运,地图数据库中多边形数据的自动组织[J].测绘学报,1989(3).
[24]朱长青,史文中,空间分析建模与原理[M].北京：科学出版社,2006.
[25]刘胡瑶,基于轨迹计算的临界多边形求解算法[J].计算机辅助设计与图形学学报,2006(8).
[26]方志祥,GIS矩形网格中任意多边形裁剪算法[J].武汉理工大学学报(交通科学与工程版),2005(5).
[27]陈正鸣,多边形链求交的改进算法[J].计算机辅助设计与图形学学报,2004(12).
[28]徐智渊,一种用于光线与三角形网格求交运算的有效剔除算法[J].软件学报,2003(10).
[29]明镜,北京市新生界三维地质结构模型构建[J].北京大学学报(自然科学版),2009(1)：111-119.
[30]熊祖强,工程地质三维建模及分析系统设计研究[J].岩石力学与工程学报,2007(S2).
[31]刘军旗,矿产资源勘查定量化表达的集成模式与关键技术[J].地球科学(中国地质大学学报),2009(2).
[32]冯斌,海洋地质调查数据库管理系统设计与实现[J].计算机工程,2009(3).
[33]李明超,基于三维地质模型的工程岩体结构精细数值建模[J].岩石力学与工程学报,2007(9).
[34]朱良峰,地质实体模型的三维交互与分析技术研究[J].岩土力学,2007(9).
[35]李军,一种基于耦合的三维拓扑结构表示方法[J].国防科技大学学报,2002(3).
[36]王孝通,基于R树面向对象的航海资料数据模型[J].中国航海,1998(2).
[37]陈晟,优化的R-树缓冲管理算法[J].计算机学报,1999(5).
[38]李开生,高层体系结构中DDM数据过滤方法[J].系统仿真学报,2009(8).
[39]郑炜,DPHI-Tree一种新型的并行高维主存索引树[J].西北工业大学学报,2009(4).
[40]姚秋林,一种空间更优的数据流查询包含编码区间索引[J].软件学报,2009(9).
[41]刘润涛,一种极小化交叠空间数据索引结构[J].哈尔滨工程大学学报,2009(8).
[42]孙殿柱,基于动态空间索引结构的三角网格模型布尔运算[J].计算机辅助设计与图形学学报,2009(9).
[43]蒋涛,一种度量空间中的可逆近邻搜索算法[J].华中科技大学学报(自然科学版),2009(8).
[44]张翀,一种适用于点和区间混合型维度数据集的多维索引[J].国防科技大学学报,2009(3).
[45]谢超,基于参数化模板技术的电子地图设计[J].武汉大学学报(信息科学版),2009(8).
[46]姚山,基于共享的林业地图点状符号库的设计[J].北京林业大学学报,2005(S2).
[47]吴小芳,基于GDI-+的高精度地图符号库的设计与实现[J].武汉大学学报(信息科学版),2004(10).
[48]何忠焕,GIS符号库中复杂线状符号设计技术的研究[J].武汉大学学报(信息科学版),2004(2).
[49]顾步云,基于网格模型的光滑B样条曲面重建算法[J].华南理工大学学报(自然科学版),2007(12).
[50]戴宁,STL数据快速拓扑重建关键算法[J].计算机辅助设计与图形学学报,2005(11).
[51]李芳玉,基于栅格的三维GIS缓冲体分析研究[J].计算机工程,2007(21).
[52]常勇,基于增强现实的空间信息三维可视化及空间分析[J].系统仿真学报,2007(9).
[53]李芳玉,三维缓冲体生成栅格算法研究[J].计算机辅助设计与图形学学报,2005(9).
[54]吴旭彦,GPS实时地图匹配技术中缓冲区分析的研究[J].西南交通大学学报,2001(2).
[55]王生生,混合维拓扑和尺寸关系的定性空间推理[J].计算机研究与发展,2009(7).
[56]成秋明,GIS中的空间建模器技术及其在全国矿产资源潜力预测中的应用[J].地球科学(中 国地质大学学报),2009(2).
[57]张和生,基于地学信息复合叠置分析对煤层底板突水的预测[J].煤炭学报,2009(8).
[58]薛正平,基于决策树和图层叠置的精准农业产量图分析方法[J].农业工程学报,2006(8).
[59]谢忠,简单矢量数据多边形裁剪问题的图模型[J].测绘学报,2009(4).
[60]陈国良,三维地质断层结构模型构建及切割分析技术研究[D].中国地质大学(武汉),2006.
[61]马登武,叶文,李瑛,基于包围盒的碰撞检测算法综述[J].系统仿真学报,2006,18(4)：1058-1062.
[62]张征宇,丁玉成,洪军,STL模型分割截面的三角剖分算法[J].计算机辅助设计与图形学学报,2005,17(6)：1240-1245.
[63]潘胜玲,刘学军,黄雄等,基于Hash函数的T1N拓扑关系重建[J].地理与地理信息科学,2006,2(2)：21-24.
[64]Ivana Kolingerova, Borut Zalik, Improvements to randomized incremental Delaunay insertion, Computers & Graphics[J].2002,26:477-490.
[65]张丽艳,吴熹,三角网格模型上任意两点间近似最短路径算法研究[J].计算机辅助设计与图形学学报,2003,15(5)：592-597.
[66]刘少华,吴东胜,罗小龙等,Delaunay三角网中点目标快速定位算法研究[J].测绘科学,2007,32(2)：69-70.
[67]马小虎,潘志庚,石教英,基于凹凸顶点判定的简单多边形Delaunay三角剖分[J].计算机辅助设计与图形学学报,1999,11(1)：1-3.
[68]Levy B,Petitjean S,Ray N, et al, Least squares conformal maps for automatic texture atlas generation[J]. ACM Trans. on Graphics.2002,21(3):362-371.
[69]李岩,于金辉,石教英,面向三维剪纸的网格模型切割方法[J].软件学报,2006,17(增刊)：169-175.
[70]曹代勇,李青元,朱小弟等,地质构造三维可视化模型探讨[J].地质勘探,2001,37(4).
[71]刘奇,周明全,刘晓宁,一种基于标志点的三维表面模型的切割方法[J].计算机应用研究,2007(2).
[72]Nienhuys HW, van der Stappen AF, A Delaunay approach to interactive cutting in triangulated surfaces. In:Proc. of the 5th Int'l Workshop Algorithmic Foundations of Robotics(WAFR 2002) [M]. Springer-Verlag,2002:113-130.
[73]Philip J.Schneder,David H.Eberly, Geometric Tools for Computer Graphics[J]. Morgan Kaufmann Publishers,2002(7).
[74]N.C.Gabrielides,A.I.Ginnis,P.D.Kaklis,et al. G1-smooth branching surface construction from cross sections[J]. Computer-Aided Design,2007,39 (8):639-651.
[75]Zhang Jiawan,Sun Jizhou,Sun Zhigang. VolGraph a PC-based visualization system for three-dimensional medical reconstructions[J]. Transactions of Tianjin University,2003,9 (3):206-210.
[76]Kwansik Kim. Data level comparisons of direct volume rendering algorithms[D]. Santa Cruz: University of California,2001.
[77]Feng Dong,Gordon J.Clapworthy,Mel Krokos. Volume Rendering of Fine Details Within Medical Data[M].IEEE Visualization,2001.387-394.
[78]C.Rezk-Salama,K.Engel,M.Bauer,et al. Interactive volume on standard PC graphics hardware using multi-textures and multi-stage rasterization[M]. Siggraph/Eurographics Workshop On Graphics Hardware,2000:109-118.
[79]J.Wilhelms,V.Gelder. A coherent projection approach for direct volume rendering[J]. Computer Graphics,1991,25 (4):275-281.
[80]Xu Meihe,Tang Zesheng. General surface reconstruction from a set of planner contours[J]. Journal of Tsinghua University (Science and Technology),1997,37 (4):59-64.
[81]Burr.D.J. Elastic matching of line drawings[J]. IEEE Transactions on Pattern Analysis and Machine Intelligence,1981,3 (6):708-713.
[82]Mehran Moshfeghi. Elastic Matching of multimodality medical images[J]. CVGIP:Graphical Models and Image Processing,1991,53 (3):271-282.
[83]H.N.Christiansen,T.W.Sederberg. Conversion of complex contours line definition into polygonal element mosaics[J]. ACM SIGGRAPH Computer Graphics,1978,12 (3):187-192.
[84]Cook,L.T,Dwyer,S.J,Batnitzky,S,et al. A three dimensional display system for diagnostic imaging applications[J]. IEEE Comp. Graphics Application,1983,3 (5):13-19.
[85]H.Fuchs,Z.M.Kedem,S.P.Uselton. Optimal surface reconstruction from planar contours[J]. Communications of the ACM,1977,20 (10):693-702.
[86]Marsan A L,Dutta D. Computational techniques for automatically tilling and skinning branched objects[J]. Computers & Graphics,1994,23:111-126.
[87]David Meyers,Shelley Skinner,Kenneth Sloan. Surface from contours[J]. ACM Transactions on Graphics,1992,11 (3):228-258.
[88]S.B.Xu,W.X.Lu. Surface reconstruction of 3D objects in computerized tomography. Computer Vision[J].Graphics Image and Processing,1988,44 (3):270-278.
[89]William J. Schroeder, Jonathan A. Zarge, William E. Lorensen. Decimation of triangle meshes[J]. Computer & Graphics.1992,26 (2):65-70.
[90]Mark W. Jones,Min Chen. A new approach to the construction of surfaces from contour data[J]. Computer Graphics Forum,1994,13 (3):75-84.
[91]Z.L.Wang,J.C.M.Teo,C.K.Chui,et al.Computational biomechanical modeling of the lumbar spine using marching-cubes surface smoothened finite element voxel meshing[J]. Computer Methods and Programs in Biomedicine,2005,80 (1):25-35.
[92]Lopes A,Brodlie K. Improving the robustness and accuracy of the marching cubes algorithm for isosurfacing[J]. IEEE Transactions on Visualization and Computer Graphics,2003,9 (1):16-29.
[93]Bend Hamann,Isaac J. Trotts,Gerald E. Farin. On approximating contours of the piecewise trilinear interpolant using triangular rational-quadratic Bezier patches[J]. IEEE Transactions on Visualization and Computer Graphics,1997,3 (3):215-227.
[94]Seungtaik Oh,Bon Ki Koo. Data perturbation for fewer triangles in marching tetrahedra[J]. Graphical Models,2007,69 (3):211-218.
[95]Gabor.T.Herman,Hsun.Kao.Liu. Three-dimensional display of human organs from computed tomograms[J]. Computer Graphics Image Processing,1979,9 (1):1-21.
[96]H. E. Cline,W. E. Lorensen,S. Ludk,et al. Two algorithms for three-dimensional reconstruction of tomograms[J]. Med & Phys,1988,15 (3):320-327.
[97]William E.Lorensen,Harvey E.Cline. Marching Cubes:A high resolution 3D surface construction algorithm[J]. Computer Graphics,1987,21 (4):163-169.
[98]E.Keppel. Approximating complex surfaces by triangulation of contour lines[J]. IBM Journal of Research and Development,1975,19 (1):2-11.
[99]Hai Chen,Kwan-Yee K.Wong,Chen Liang,et al. Extracting surface representations from rim curves[J]. Lecture Notes in Computer Science,2006,732-741.
[100]Meyers D. Reconstruction of surfaces from planar contours:[Doctor of Philosophy Dissertation] [D]. Washington:University of Washington,1994.
[101]J.Jeong,K.Kim,H.Park,et al. A new method for solving branching problems in surface reconstruction[J]. The International Journal of Advanced Manufacturing Technology,2000,16(4):259-264.
[102]Joaquin. Pina Amargos,Rene. Alquezar Mancho. Reconstruction of surface from cross section using skeleton information[J]. A Sanfliu and J. Ruiz- Shucloper CLARP 2003,LNCS 2905,2003.180-187.
[103]Gill Barequet,Matthew Dickerson,David Eppstein. On trianglation three-dimensional polygons. Computational Geometry [J].Theory and Applications,1998,10 (3):155-170.
[104]Michael J. Laszlo. Fast generation and display of iso-surface wireframes[J]. Graphical Models and Image Processing,1992,54 (6):473-483.
[105]P.Cignoni,F. Ganovelli,C. Montani,et al. Reconstruction of topologically correct and adaptive trilinear surfaces[J]. Computers and Graphics,2000,24 (3):399-418.
[106]李小勇,物体表面重建方法的研究与实现[D].中南大学,2007.
[107]徐晓玲,李现民,李桂清等,体素重建中的快速移动立方体方法[J].系统仿真学报,2002,14(4)：509～513.
[108]朱经纬,蒙培生,王乘,基于 MC算法的螺旋CT扫描数据的三维重建[J].华中科技大学学报(自然科学版),2002,3(30)：74～76.
[109]马洪滨,熊俊楠,基于地质统计学的储量估算系统[J].煤炭学报,2007(3).
[110]尚建嘎,刘修国,张宝一,层次风格固体矿产储量估算软件体系结构设计[J].计算机应用研究,2007(8).
© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号 地址：北京市海淀区学院路29号 邮编：100083 电话：办公室：(+86 10)66554848；文献借阅、咨询服务、科技查新：66554700 |