区域矿产资源GIS评价关键算法研究
|
摘要
在充分研究区域矿产资源GIS评价原理与方法流程的基础上,总结归纳开发矿产资源GIS评价系统所需的关键算法。在深入研究上述关键算法和MAPGIS数据中心中间件开发和应用技术的基础上,设计并实现区域矿产资源GIS评价系统软件工具的相关功能插件,为全国矿产资源潜力评价项目服务。
在矿产资源评价实际工作中,主要面临预测要素信息提取与综合,多元信息表达,找矿信息立体化等问题,而这一点恰好可以用GIS技术解决。其中空间分析和空间索引技术可以解决信息提取与综合问题,等值线图的自动绘制可以实现地球物理、地球化学等多元预测信息的表达。同时,三维可视化技术可以将地质专家大脑中的地质模型转化为预测模型,并使之具象化、可视化。
本篇论文在现有区域成矿预测理论研究和区域矿产资源GIS评价系统软件需求分析的基础上,主要开展以下几个关键算法的研究和开发工作:
⑴研究空间分析与二维空间索引技术,预测要素提取与综合相关关键算法的改进;
⑵分析区域矿产资源GIS评价系统软件多元信息表达技术,实现各种等值线图件的自动绘制功能;
⑶在现有区域矿产资源GIS评价工作流程的基础上,提出将计算机地貌晕渲技术应用到区域矿产资源GIS评价软件处理流程中,提供三维环境下,矿产资源预测评价原型系统;
⑷软件应用测试。应用区域矿产资源GIS评价软件,对东天山铜镍硫化物矿床开展定位预测研究。
Based on the full research of method model of Mineral Resources Assessment, this paper summarizes the kernel algorithms during developing and programming software of Mineral Resources Assessment on basis of Geographical Information System (GIS). Based on the research of the kernel technologies and kits of MAPGIS, the author and his colleagues developed and programmed Mineral Resources Assessment System (MARS). It has been applied in National Mineral Resources Assessment Project.
In the whole procedure of Mineral Resources Assessment, there are two important problems of multi-feature information extraction and results presentation. Exactly, GIS has an advantage on these issues. Specifically, Spatial Analysis and Spatial Index of GIS can deal with Multi-feature information extraction and Integration; auto-creating contour map provides result visualization expression. In addition, with the maturity of three-dimension (3D) visualization technology, the paper presents a method that it has applied 3D visualization technology to improve MRAS’effects of visualization.
Based on the theory of Regional Mineral Resource Assessment and analysis requirements of MRAS, the paper carries out researches in the following areas:
⑴.Based on research of technologies of Spatial Index and Spatial Analysis in GIS, the paper improves Point-In-Polygon query algorithm on basis of BSP tree.
⑵.Based on technologies of automatic drawing map in GIS, the paper emphasizes an algorithm for contour tracing in irregular and complicated areas.
⑶.Present an improved MRAS software processing. The processing applies Hillshade technology to improve visualization effect of software.
⑷.Apply improved MRAS software to carry out qualitative prediction of copper and nickel deposits in East Tianshan area, Xinjiang Autonomous Region.
在矿产资源评价实际工作中,主要面临预测要素信息提取与综合,多元信息表达,找矿信息立体化等问题,而这一点恰好可以用GIS技术解决。其中空间分析和空间索引技术可以解决信息提取与综合问题,等值线图的自动绘制可以实现地球物理、地球化学等多元预测信息的表达。同时,三维可视化技术可以将地质专家大脑中的地质模型转化为预测模型,并使之具象化、可视化。
本篇论文在现有区域成矿预测理论研究和区域矿产资源GIS评价系统软件需求分析的基础上,主要开展以下几个关键算法的研究和开发工作:
⑴研究空间分析与二维空间索引技术,预测要素提取与综合相关关键算法的改进;
⑵分析区域矿产资源GIS评价系统软件多元信息表达技术,实现各种等值线图件的自动绘制功能;
⑶在现有区域矿产资源GIS评价工作流程的基础上,提出将计算机地貌晕渲技术应用到区域矿产资源GIS评价软件处理流程中,提供三维环境下,矿产资源预测评价原型系统;
⑷软件应用测试。应用区域矿产资源GIS评价软件,对东天山铜镍硫化物矿床开展定位预测研究。
Based on the full research of method model of Mineral Resources Assessment, this paper summarizes the kernel algorithms during developing and programming software of Mineral Resources Assessment on basis of Geographical Information System (GIS). Based on the research of the kernel technologies and kits of MAPGIS, the author and his colleagues developed and programmed Mineral Resources Assessment System (MARS). It has been applied in National Mineral Resources Assessment Project.
In the whole procedure of Mineral Resources Assessment, there are two important problems of multi-feature information extraction and results presentation. Exactly, GIS has an advantage on these issues. Specifically, Spatial Analysis and Spatial Index of GIS can deal with Multi-feature information extraction and Integration; auto-creating contour map provides result visualization expression. In addition, with the maturity of three-dimension (3D) visualization technology, the paper presents a method that it has applied 3D visualization technology to improve MRAS’effects of visualization.
Based on the theory of Regional Mineral Resource Assessment and analysis requirements of MRAS, the paper carries out researches in the following areas:
⑴.Based on research of technologies of Spatial Index and Spatial Analysis in GIS, the paper improves Point-In-Polygon query algorithm on basis of BSP tree.
⑵.Based on technologies of automatic drawing map in GIS, the paper emphasizes an algorithm for contour tracing in irregular and complicated areas.
⑶.Present an improved MRAS software processing. The processing applies Hillshade technology to improve visualization effect of software.
⑷.Apply improved MRAS software to carry out qualitative prediction of copper and nickel deposits in East Tianshan area, Xinjiang Autonomous Region.
引文
[1].USGS National Mineral Resource Team.Assessment of undiscovered deposits of gold, silver, copper, lead, and zinc in the United States[J].USGS Circular 1178, 1998,1999.
[2].USGS Western Minerals Team, US Department of Interior, USGS, Advanced resource assessment methods[0l].http://mineral.usgs.gov/west/projects/aramdel.shtmal,2002.
[3].Harris D P. Mineral resource appraisal[M]. Oxford University press, 1984.
[4].王世称,范继璋,杨永华,矿产资源评价[M],长春:吉林科学技术出版社,1990,1~69,149~217
[5].王世称,陈永良,夏立显等.综合信息矿产预测理论与方法[M],北京:科学出版社,2000,1-200.
[6].肖克炎,朱裕生,张晓华等.矿产资源评价中的成矿信息提取与综合技术[J].矿床地质1999,19(4):379～384
[7].赵鹏大.“三联式”资源定量预测与评价-数字找矿理论与实践探讨[J].地球科学—中国地质大学学报,2002,27(5):482-489.
[8].赵鹏大,陈建平,张寿庭.“三联式”成矿预测新进展[J].地学前缘,2003,10(2):455-463.
[9].肖克炎,王勇毅,陈郑辉等.中国矿产资源评价新技术与评价新模型[M].北京地质出版社2006年
[10].成秋明,刘江涛,张生元等. GIS中的空间建模器技术及其在矿产资源潜力评价中的应用[J].地球科学2009,34(2):338~346
[11].王世称王於天,综合信息解译原理与矿产预测图编制方法[M].1989,长春:吉林大学出版社.
[12].Agertberg, F.P., B.-C.G. F, W.D. F, Statistical pattern integration for mineral exploration. Computer Applications for Mineral Exploration in Resource Exploration, ed. G. G and M.D. F. 1990, Oxford: Pergamon Press.
[13].赵文吉,陈永良,宫辉力,一种基于图层综合的矿产资源潜力制图模型.地质科学, 2003. 38(2): p. 267-274.
[14].陈永良, GIS矿产预测多源地学信息的自动提取与综合研究. 2000,吉林大学:长春.
[15].Philip J.S, David H.E. Geometric Tools for Computer Graphics[M].USA:House of Electronics Industry. 2004: 495~505,571~582
[16].Manber U. Introduction to algorithms—a creative approach[J]. Reading,MA: Addison-Wesley; 1989.
[17].Foley JD, van Dam A, Feiner SK, Hughes JF. Computer graphics—principles and practice[M]. 2nd ed. Reading, MA: Addison-Wesley; 1990.
[18].Linhart J. A quick point-in-polyhedron test[J]. Computers & Graphics1990;14(3/4):445–7.
[19].Haines E. Point in polygon strategies. In: Heckbert PS, editor.Graphics gems IV[M]. Boston, MA: Academic Press; 1994. p. 24–46.
[20].Feito F, Torres JC, Urena A. Orientation, simplicity, and inclusiontest for planar polygons[J]. Computers & Graphics 1995;19(4):595–600.
[21].Feito F, Torres JC. Inclusion test for general polyhedra[J]. Computers& Graphics 1997;21(1):23–30.
[22].Preparata FP, Shamos MI. Computational geometry: an introduction[M]. New York: Springer; 1985.
[23].Hormann K, Agathos A. The point in polygon problem for arbitrarypolygons[J]. Computational Geometry: Theory and Applications. 2001;20(3):131–44
[24].Taylor G. Point in polygon test[J]. Survey Review 1994;32:479–84.
[25].Rueda AJ, Feito FR, Rivero M. A triangle-based representation forpolygons and its applications[J]. Computers & Graphics2002;26(5):805–14.
[26].Wang W, Li J, Wu E. 2D point-in-polygon test by classifying edgesinto layers[J]. Computers & Graphics 2005;29(3):427–39.
[27].Huang CW, Shih TY. On the complexity of point-in-polygonalgorithms[J]. Computers & Geosciences 1997;23(1):109–18.
[28] Zalik B, Kolingerova I. A cell-based point-in-polygon algorithmsuitable for large sets of points[J]. Computers & Geosciences2001;27(10):1135–45.
[29].De Berg M, Van Kreveld M, Overmars M, Schwarzkpf O.Computational geometry: algorithms and applications. 2nd ed[M]. Berlin: Springer; 2000.
[30].Zalik B, Jezernik A, Rizmanzalik K. Polygon trapezoidation by setsof open trapezoids[J]. Computers & Graphics 2003;27(5):791–800.
[31].Teillaud M. Union and split operations on dynamic trapezoidalmaps[J]. Computational Geometry: Theory and Applications 2000;17(3/4):153–63
[32].Berg.M etc. Computational Geometry: Algorithms and Applications Second Edition. New York: Springer~Verlag Berlin Heidelberg. 1997: 110~134,137~162,206~233
[33].陈敏.GIS空间索引技术探究.福建电脑.2005, 8: 20~21
[34].Chazelle.B. Triangulating a simple polygon in linear time[J]. Disc. Comp. Geom. 1991,6:485~524
[35].Zalik B, Gordon J, A universal trapezoidation algorithm for planar polygons[J]. Computers & Graphics, 1999,23(3),253~263
[36].Haines, Eric. Abnormal normals[J]. Ray Tracing News, 1987
[37].Haines, Eric. Essential ray tracing algorithom. In Andrew Glassnew, editor, An Introduction to Ray Tracing[M], 1989, Academic Press, San Diego, pages 33~77.
[38].Haines, Eric. Fast ray– convex polyhedron intersection. In James Arvo, editor, Graphics Gem IV[M],1991, Academic Press, San Diego, Pages 247~250.
[39].Heckbert, Paul S.,. Graphics Gems IV[M]. 1994, Academic Press, San Diego.
[40].Fuchs, Henry, Zvi Kedem, and Bruce Naylor. On visible surface generation by priori tree structure[J]. Proceeding of SIGGRAPH, 1980, 124~133.
[41].Sartaj Sahni著汪诗林,孙晓东,等译.数据结构、算法与应用——C++语言描述[M].机械工业出版社,2006,320~328
[42].Newman W M, Sproull R F. Principles of Interactive Computer Graphics [M]. McGraw-Hill, New York, 1979.
[43].Sproull R F, Southerland I E. A Clipping Divider [M]. FJCC, Thompson Books, Washington D.C, 1968.
[44].Liang L D, Barsky B A. A new concept and method for line clipping [J]. ACM Transactions on Graphics, 1984, 3(1):278-283.
[45].Nicholl T M, Lee D T, Nicholl R A. An efficient new algorithm for 2D line clipping [J]. SIGGRAPH' 87, Computer Graphics,1987,21(4):643~648.
[46].Andreev R, Sofianska E. New algorithm for two dimensional line clipping [J]. Computers &Graphics, 1991, 15(4):519-526.
[47].Wang Hao-Hong, Wu Rui-Xun, Cai Shi-Jie. A new efficient line clipping algorithm based on geometric transformation [J]. Journal of Sofrware, 1998, 9(10):728-733(in Chinese)
[48].Wang Jun, Liang You-Dong, Peng Qun-Sheng. A 2-D line clipping algorithm with the least arithmetic operations [J]. Chinese Journal of Computers, 1991, 14 (7): 495-504 (in Chinese)
[49].Sutherland I E, Hodgman G W. Reentrant polygon clipping [J].Communication of the ACM, 1994, 17(1):32-42
[50].Cyrus M, Beck J. Generalized two and three dimensional clipping. Computers &Graphics, 1978, 3(1): 23-28
[51].Weiler K, Atherton P. Hidden surface removal using polygon area sorting [J]. ACM SIGGRAPH Computer Graphics, 1977, 11(2): 214-222
[52].Liu Yong-Kui, Yan Ye, Shi Jiao-Ying. An efficient algorithm for the line clipping against a polygon. Chinese Journal of Computers,1999,22(11): 1210-1214(in Chinese)
[53].Lu Guo-Dong, Xing Shi-hai, Peng Xun-Sheng. An Efficient Algorithm of Line Clipping Against Polygonal Window Based on the Vertex Encodin. Chinese Journal of Computers, 2002, 25(9): 987-993
[54].Zhao Hai-Zhen, Li Tong-lin, Yu Guo-Feng. Clipping of Complex Grid Contour[J]. Journal of Image and Graphics,2002,7(4): 380-383
[55].Sun Chunjuan, Wang wencheng, Li jing, Wu Enhua. Line Clipping Against a Polygon through Convex Segments[J]. Journal of Computer-Aided Design and Computer Graphics,2006,18(12),1799~1805.
[56].A. Guttman. R-TREES. A dynamic Index Structure For Spatial Searching. 1984
[57].Oosterom. An R-Tree Based Map-Overlap Algorithm. 1994
[58].Zalik, B.Kolingerova. A cell-based point-in-polygon algorithm suitable for large sets of points. Computers & Geosciences,2001, 27(10), 1135-1145
[59].Liu Xiao-Ping, Zhu Xiao-qiang, etc. Building Algorithm of Triangulation Based on LiDAR Point Clouds[J].Journal of Software, 2008,19(zk),1-9
[60].王家华.克里金地质绘图技术.石油工业出版社.1999,5:268~300
[61].董玉杰,彦伟达,马远乐.油藏数值模拟中复杂等值线图的绘制方法研究.计算机仿真,2007,24(7):220~224
[62].刘传志,张华,张亚男.等高线自动绘制中断层处理的新方法.海洋测绘,2005,25(3):70~73
[63].朱求安,张万昌,余钧辉.基于GIS的空间插值方法研究.江西师范大学学报,2003,28(2):183~188
[64].颜辉武,祝国瑞,徐智勇.基于Voronoi图的距离倒数加权法的改进研究.武汉大学学报,2004,29(11):1017~1020
[65].王家华,高海余,周叶.克里金地质绘图技术――计算机的模型和算法.北京:石油工业出版社,1999
[66].王靖波,潘懋,张绪定.基于Kriging方法的空间散乱点插值.计算机辅助设计与图形学学报,1999,11(6):525~529
[67].尹宝才,孔德慧,吴思宁.基于空间网格表面距离德插值曲面.软件学报,2000,11(10):1405~1411
[68].章孝灿,黄智才,戴企成.GIS中基于拓扑结构和凸壳技术的快速TIN生成算法[J].计算机学报,2002,25(11):1212~1218
[69].陈学工,黄晶晶.基于最优凸壳技术的Delaunay三角剖分.计算机工程,2007,33(17):93~95.
[70].崔汉国,方锡武,简宪华.二维约束点集Delaunay三角剖分算法研究[J].海军工程大学学报,2003,15(6):49~51.
[71].李立新,谭建荣.约束Delaunay三角剖分中强行嵌入约束边的对角线交换算法[J].计算机学报,1999,22(10):1114~1119.
[72].陈学工,黄晶晶.Delaunay三角网剖分中的约束边嵌入算法[J].计算机工程,2007,33(16):56~58.
[73].董玉杰,颜伟达,马远乐.油藏数据模拟中发杂等值线图的绘制方法研究[J].计算机仿真,2007,24(7):220~224
[74].郭鹏,董兰芳,夏泽举.地质数据的等值线绘制方法研究[J].计算机仿真,2009,26(9):168~171
[75].管倩倩,王飞,陈丽娜.利用散乱采样点绘制光滑等值线的误差分析.微计算机信息,2006,11(3):239~241.
[76].张东升,张会青,韩俊卿.等高线自动赋值及注记的算法实现.大地纵横,2004,11(3):27~29.
[77].龚健雅.地理信息系统基础.北京:科学出版社,2001
[78].陈学工,黄晶晶.等高线高程自动标注算法的研究.测绘技术,2007,32(4):101~103
[79].Guo Qing Sheng, Brandenberger C, Huini L.The Spatial Characteristics of a Line and Their Application to Line Simplification.Geospatial Information Science,2002,5(1):62~67
[80].杨建宇,杨崇俊,明冬萍,等.WebGIS系统中矢量数据的压缩与化简方法综述.计算机工程与应用,2004,(32):36~38
[81].张宁宁,张树有,谭建荣.映射相关边概念的多边形内外点判别算法.计算机辅助设计与图形学学报,2004,16(7):935~938
[82]. Sunday D . Polyline Simplification.http://geometryalgorithms.com/Archive/a-lgorithm_0205/,2006
[83].张宏,温永宁,刘爱利.地理信息系统算法基础.北京:科学出版社,2006
[84].Beck Zaratian.希望图书创作室译. Visual C++ 6.0程序员指南[M].北京:北京希望电脑公司. 1998.
[85].姬富强,张环宙.利用三次B样条函数作等值线分析[J].潮州师专学报,1997,(12):25~28.
[86].Gerald Farin.Class A Bezier curves.Computer Aided Geometric Design,2006,23(7):537~581.
[87].和正民.关于计算机自动绘制光滑曲线的数学方法的探索.北京地质,1998,(1):17~23.
[88].李正越,娄健.自动生成高质量等值线图的算法探讨.中国煤田地质,1998,10(3):62~64.
[89].李岩影,过境君.等高线扫面图像的自适应识别方法.北京测绘,2000,(2):9~12.
[90].黄本宇,王家华,王湘波.复杂地质构造的等值线填充及实现[J].阜阳师范学院学报(自然科学版),2006,23(4):50~52
[91].吴信才.面向网络的新一代地理信息系统[M].北京:科学出版社,2009年
[92].吴信才.空间数据库[M].北京.科学出版社2009年
[93].吴信才.数据中心集成开发平台[M].北京.电子工业出版社2010年
[94].吴信才,吴亮等.面向服务的分布式空间信息支持平台[J].地球科学2006,31(5):585～589
[95].Singer D A. Basic concepts in three quantitative assessments of undiscovered mineral resources[J]. Nonrenewable Resources, 1993,2(2):1-14.
[96].Singer D A. Basic concepts in three quantitative assessments of undiscovered mineral resources[J]. Nonrenewable Resources, 1993,2(2):1-14.
[97].Bonham-Carter G F. Geographic information systems for geoscientists: Modelling with GIS[M], Pergram on/ Elsevier Science Publications,1996,398。
[98].施祖辉.地貌晕渲法[M].北京测绘出版社,1983.
[99].俞连笙,王涛.地图整饰[M].北京:测绘出版社,1995
[100].郭礼珍,李霖,张园玉.基于视觉表象的彩色晕渲地图色彩设计[J].武汉大学学报(信息科学版),2004,29(6):492~495
[101].曹纯贫.数字地貌晕渲中若干参数的设置[J].测绘通报. 2003(5):17~19
[102].江文萍,毋河海,杜清远,等。大型彩色晕渲的自动生成技术研究[J].武汉大学学报(信息科学版),2004,29(6):496-499
[103].甘昱,庞小平,李雪梅.大比例尺彩色地貌晕渲图的生成技术[J].测绘通报,2005(11):58~62
[104].WEIBEI,R.AND HELLER,M. Digital Terrain Modelling[M]. Geographical Information System: Principles And Application,1991
[105].ZHOU QIMING. Relief Shading Using Digital Evaluation Models[J]. Computers and Geosciences,18(8):1035~1045
[106].吴樊,俞连笙.基于DEM的地貌晕渲图的制作[J].测绘信息与工程,2003,28(1):31~32。
[107].刘修国,张剑波.基于DEM库的地表模型实时简化方法[J].小型微型计算机系统.2004,25(2):280~282
[108].刘学惠.基于图象空间判据的地表模型加速绘制技术[J].软件学报.1998,(9):481～485
[109].胡卫明,吴兵,凌海滨.地图等高线自动内插算法[J].计算机学报.2000,23(8),847~851
[110].李锡堤.数值地形的彩绘明暗图制作及应用[J].1996,56:69~84
[111].Donald H, M.Pauline, etc.著.蔡士杰等译.计算机图形学(第二版).北京:电子工业出版社.2004:122~123
[112].吴立新,史文中.地理信息系统原理与算法[M].北京:科学出版社.2003:184~200
[113].彭省临,杨中宝,李朝艳,等.基于GIS确定地球化学异常下限的新方法[J].地球科学与环境学报,2004,26(3):28-31.
[114].龙宝林,薛迎喜,冯京,等.新疆东天山斑岩铜矿的找矿模型试探[J].中国地质,2001,28(5):35～38.
[115].张良臣,吴乃元.天山地质构造及演化史[J].新疆地质,1985,3(3):1-14.
[116].成守德,王广瑞,杨树德等.新疆古板块构造[J].新疆地质,1986,4(2):1-26.
[117].肖序常,汤耀庆,冯益民等.新疆北部及其邻区大地构造[M].北京:地质出版社,1992,1-200.
[118].马瑞士,叶尚夫,王赐银,等.东天山造山带构造格架和演化[A].新疆地质科学,第二辑[C].北京,地质出版社,1990,21-36.
[119].马瑞士,王赐银,叶尚夫,等.东天山构造格架及地壳演化[M].南京:南京大学出版社,1993,1-200.
[120].娄德波,新疆东天山铜镍矿资源潜力评价方法研究博士学位论文[D].北京.中国地质科学院.2008年
[2].USGS Western Minerals Team, US Department of Interior, USGS, Advanced resource assessment methods[0l].http://mineral.usgs.gov/west/projects/aramdel.shtmal,2002.
[3].Harris D P. Mineral resource appraisal[M]. Oxford University press, 1984.
[4].王世称,范继璋,杨永华,矿产资源评价[M],长春:吉林科学技术出版社,1990,1~69,149~217
[5].王世称,陈永良,夏立显等.综合信息矿产预测理论与方法[M],北京:科学出版社,2000,1-200.
[6].肖克炎,朱裕生,张晓华等.矿产资源评价中的成矿信息提取与综合技术[J].矿床地质1999,19(4):379～384
[7].赵鹏大.“三联式”资源定量预测与评价-数字找矿理论与实践探讨[J].地球科学—中国地质大学学报,2002,27(5):482-489.
[8].赵鹏大,陈建平,张寿庭.“三联式”成矿预测新进展[J].地学前缘,2003,10(2):455-463.
[9].肖克炎,王勇毅,陈郑辉等.中国矿产资源评价新技术与评价新模型[M].北京地质出版社2006年
[10].成秋明,刘江涛,张生元等. GIS中的空间建模器技术及其在矿产资源潜力评价中的应用[J].地球科学2009,34(2):338~346
[11].王世称王於天,综合信息解译原理与矿产预测图编制方法[M].1989,长春:吉林大学出版社.
[12].Agertberg, F.P., B.-C.G. F, W.D. F, Statistical pattern integration for mineral exploration. Computer Applications for Mineral Exploration in Resource Exploration, ed. G. G and M.D. F. 1990, Oxford: Pergamon Press.
[13].赵文吉,陈永良,宫辉力,一种基于图层综合的矿产资源潜力制图模型.地质科学, 2003. 38(2): p. 267-274.
[14].陈永良, GIS矿产预测多源地学信息的自动提取与综合研究. 2000,吉林大学:长春.
[15].Philip J.S, David H.E. Geometric Tools for Computer Graphics[M].USA:House of Electronics Industry. 2004: 495~505,571~582
[16].Manber U. Introduction to algorithms—a creative approach[J]. Reading,MA: Addison-Wesley; 1989.
[17].Foley JD, van Dam A, Feiner SK, Hughes JF. Computer graphics—principles and practice[M]. 2nd ed. Reading, MA: Addison-Wesley; 1990.
[18].Linhart J. A quick point-in-polyhedron test[J]. Computers & Graphics1990;14(3/4):445–7.
[19].Haines E. Point in polygon strategies. In: Heckbert PS, editor.Graphics gems IV[M]. Boston, MA: Academic Press; 1994. p. 24–46.
[20].Feito F, Torres JC, Urena A. Orientation, simplicity, and inclusiontest for planar polygons[J]. Computers & Graphics 1995;19(4):595–600.
[21].Feito F, Torres JC. Inclusion test for general polyhedra[J]. Computers& Graphics 1997;21(1):23–30.
[22].Preparata FP, Shamos MI. Computational geometry: an introduction[M]. New York: Springer; 1985.
[23].Hormann K, Agathos A. The point in polygon problem for arbitrarypolygons[J]. Computational Geometry: Theory and Applications. 2001;20(3):131–44
[24].Taylor G. Point in polygon test[J]. Survey Review 1994;32:479–84.
[25].Rueda AJ, Feito FR, Rivero M. A triangle-based representation forpolygons and its applications[J]. Computers & Graphics2002;26(5):805–14.
[26].Wang W, Li J, Wu E. 2D point-in-polygon test by classifying edgesinto layers[J]. Computers & Graphics 2005;29(3):427–39.
[27].Huang CW, Shih TY. On the complexity of point-in-polygonalgorithms[J]. Computers & Geosciences 1997;23(1):109–18.
[28] Zalik B, Kolingerova I. A cell-based point-in-polygon algorithmsuitable for large sets of points[J]. Computers & Geosciences2001;27(10):1135–45.
[29].De Berg M, Van Kreveld M, Overmars M, Schwarzkpf O.Computational geometry: algorithms and applications. 2nd ed[M]. Berlin: Springer; 2000.
[30].Zalik B, Jezernik A, Rizmanzalik K. Polygon trapezoidation by setsof open trapezoids[J]. Computers & Graphics 2003;27(5):791–800.
[31].Teillaud M. Union and split operations on dynamic trapezoidalmaps[J]. Computational Geometry: Theory and Applications 2000;17(3/4):153–63
[32].Berg.M etc. Computational Geometry: Algorithms and Applications Second Edition. New York: Springer~Verlag Berlin Heidelberg. 1997: 110~134,137~162,206~233
[33].陈敏.GIS空间索引技术探究.福建电脑.2005, 8: 20~21
[34].Chazelle.B. Triangulating a simple polygon in linear time[J]. Disc. Comp. Geom. 1991,6:485~524
[35].Zalik B, Gordon J, A universal trapezoidation algorithm for planar polygons[J]. Computers & Graphics, 1999,23(3),253~263
[36].Haines, Eric. Abnormal normals[J]. Ray Tracing News, 1987
[37].Haines, Eric. Essential ray tracing algorithom. In Andrew Glassnew, editor, An Introduction to Ray Tracing[M], 1989, Academic Press, San Diego, pages 33~77.
[38].Haines, Eric. Fast ray– convex polyhedron intersection. In James Arvo, editor, Graphics Gem IV[M],1991, Academic Press, San Diego, Pages 247~250.
[39].Heckbert, Paul S.,. Graphics Gems IV[M]. 1994, Academic Press, San Diego.
[40].Fuchs, Henry, Zvi Kedem, and Bruce Naylor. On visible surface generation by priori tree structure[J]. Proceeding of SIGGRAPH, 1980, 124~133.
[41].Sartaj Sahni著汪诗林,孙晓东,等译.数据结构、算法与应用——C++语言描述[M].机械工业出版社,2006,320~328
[42].Newman W M, Sproull R F. Principles of Interactive Computer Graphics [M]. McGraw-Hill, New York, 1979.
[43].Sproull R F, Southerland I E. A Clipping Divider [M]. FJCC, Thompson Books, Washington D.C, 1968.
[44].Liang L D, Barsky B A. A new concept and method for line clipping [J]. ACM Transactions on Graphics, 1984, 3(1):278-283.
[45].Nicholl T M, Lee D T, Nicholl R A. An efficient new algorithm for 2D line clipping [J]. SIGGRAPH' 87, Computer Graphics,1987,21(4):643~648.
[46].Andreev R, Sofianska E. New algorithm for two dimensional line clipping [J]. Computers &Graphics, 1991, 15(4):519-526.
[47].Wang Hao-Hong, Wu Rui-Xun, Cai Shi-Jie. A new efficient line clipping algorithm based on geometric transformation [J]. Journal of Sofrware, 1998, 9(10):728-733(in Chinese)
[48].Wang Jun, Liang You-Dong, Peng Qun-Sheng. A 2-D line clipping algorithm with the least arithmetic operations [J]. Chinese Journal of Computers, 1991, 14 (7): 495-504 (in Chinese)
[49].Sutherland I E, Hodgman G W. Reentrant polygon clipping [J].Communication of the ACM, 1994, 17(1):32-42
[50].Cyrus M, Beck J. Generalized two and three dimensional clipping. Computers &Graphics, 1978, 3(1): 23-28
[51].Weiler K, Atherton P. Hidden surface removal using polygon area sorting [J]. ACM SIGGRAPH Computer Graphics, 1977, 11(2): 214-222
[52].Liu Yong-Kui, Yan Ye, Shi Jiao-Ying. An efficient algorithm for the line clipping against a polygon. Chinese Journal of Computers,1999,22(11): 1210-1214(in Chinese)
[53].Lu Guo-Dong, Xing Shi-hai, Peng Xun-Sheng. An Efficient Algorithm of Line Clipping Against Polygonal Window Based on the Vertex Encodin. Chinese Journal of Computers, 2002, 25(9): 987-993
[54].Zhao Hai-Zhen, Li Tong-lin, Yu Guo-Feng. Clipping of Complex Grid Contour[J]. Journal of Image and Graphics,2002,7(4): 380-383
[55].Sun Chunjuan, Wang wencheng, Li jing, Wu Enhua. Line Clipping Against a Polygon through Convex Segments[J]. Journal of Computer-Aided Design and Computer Graphics,2006,18(12),1799~1805.
[56].A. Guttman. R-TREES. A dynamic Index Structure For Spatial Searching. 1984
[57].Oosterom. An R-Tree Based Map-Overlap Algorithm. 1994
[58].Zalik, B.Kolingerova. A cell-based point-in-polygon algorithm suitable for large sets of points. Computers & Geosciences,2001, 27(10), 1135-1145
[59].Liu Xiao-Ping, Zhu Xiao-qiang, etc. Building Algorithm of Triangulation Based on LiDAR Point Clouds[J].Journal of Software, 2008,19(zk),1-9
[60].王家华.克里金地质绘图技术.石油工业出版社.1999,5:268~300
[61].董玉杰,彦伟达,马远乐.油藏数值模拟中复杂等值线图的绘制方法研究.计算机仿真,2007,24(7):220~224
[62].刘传志,张华,张亚男.等高线自动绘制中断层处理的新方法.海洋测绘,2005,25(3):70~73
[63].朱求安,张万昌,余钧辉.基于GIS的空间插值方法研究.江西师范大学学报,2003,28(2):183~188
[64].颜辉武,祝国瑞,徐智勇.基于Voronoi图的距离倒数加权法的改进研究.武汉大学学报,2004,29(11):1017~1020
[65].王家华,高海余,周叶.克里金地质绘图技术――计算机的模型和算法.北京:石油工业出版社,1999
[66].王靖波,潘懋,张绪定.基于Kriging方法的空间散乱点插值.计算机辅助设计与图形学学报,1999,11(6):525~529
[67].尹宝才,孔德慧,吴思宁.基于空间网格表面距离德插值曲面.软件学报,2000,11(10):1405~1411
[68].章孝灿,黄智才,戴企成.GIS中基于拓扑结构和凸壳技术的快速TIN生成算法[J].计算机学报,2002,25(11):1212~1218
[69].陈学工,黄晶晶.基于最优凸壳技术的Delaunay三角剖分.计算机工程,2007,33(17):93~95.
[70].崔汉国,方锡武,简宪华.二维约束点集Delaunay三角剖分算法研究[J].海军工程大学学报,2003,15(6):49~51.
[71].李立新,谭建荣.约束Delaunay三角剖分中强行嵌入约束边的对角线交换算法[J].计算机学报,1999,22(10):1114~1119.
[72].陈学工,黄晶晶.Delaunay三角网剖分中的约束边嵌入算法[J].计算机工程,2007,33(16):56~58.
[73].董玉杰,颜伟达,马远乐.油藏数据模拟中发杂等值线图的绘制方法研究[J].计算机仿真,2007,24(7):220~224
[74].郭鹏,董兰芳,夏泽举.地质数据的等值线绘制方法研究[J].计算机仿真,2009,26(9):168~171
[75].管倩倩,王飞,陈丽娜.利用散乱采样点绘制光滑等值线的误差分析.微计算机信息,2006,11(3):239~241.
[76].张东升,张会青,韩俊卿.等高线自动赋值及注记的算法实现.大地纵横,2004,11(3):27~29.
[77].龚健雅.地理信息系统基础.北京:科学出版社,2001
[78].陈学工,黄晶晶.等高线高程自动标注算法的研究.测绘技术,2007,32(4):101~103
[79].Guo Qing Sheng, Brandenberger C, Huini L.The Spatial Characteristics of a Line and Their Application to Line Simplification.Geospatial Information Science,2002,5(1):62~67
[80].杨建宇,杨崇俊,明冬萍,等.WebGIS系统中矢量数据的压缩与化简方法综述.计算机工程与应用,2004,(32):36~38
[81].张宁宁,张树有,谭建荣.映射相关边概念的多边形内外点判别算法.计算机辅助设计与图形学学报,2004,16(7):935~938
[82]. Sunday D . Polyline Simplification.http://geometryalgorithms.com/Archive/a-lgorithm_0205/,2006
[83].张宏,温永宁,刘爱利.地理信息系统算法基础.北京:科学出版社,2006
[84].Beck Zaratian.希望图书创作室译. Visual C++ 6.0程序员指南[M].北京:北京希望电脑公司. 1998.
[85].姬富强,张环宙.利用三次B样条函数作等值线分析[J].潮州师专学报,1997,(12):25~28.
[86].Gerald Farin.Class A Bezier curves.Computer Aided Geometric Design,2006,23(7):537~581.
[87].和正民.关于计算机自动绘制光滑曲线的数学方法的探索.北京地质,1998,(1):17~23.
[88].李正越,娄健.自动生成高质量等值线图的算法探讨.中国煤田地质,1998,10(3):62~64.
[89].李岩影,过境君.等高线扫面图像的自适应识别方法.北京测绘,2000,(2):9~12.
[90].黄本宇,王家华,王湘波.复杂地质构造的等值线填充及实现[J].阜阳师范学院学报(自然科学版),2006,23(4):50~52
[91].吴信才.面向网络的新一代地理信息系统[M].北京:科学出版社,2009年
[92].吴信才.空间数据库[M].北京.科学出版社2009年
[93].吴信才.数据中心集成开发平台[M].北京.电子工业出版社2010年
[94].吴信才,吴亮等.面向服务的分布式空间信息支持平台[J].地球科学2006,31(5):585～589
[95].Singer D A. Basic concepts in three quantitative assessments of undiscovered mineral resources[J]. Nonrenewable Resources, 1993,2(2):1-14.
[96].Singer D A. Basic concepts in three quantitative assessments of undiscovered mineral resources[J]. Nonrenewable Resources, 1993,2(2):1-14.
[97].Bonham-Carter G F. Geographic information systems for geoscientists: Modelling with GIS[M], Pergram on/ Elsevier Science Publications,1996,398。
[98].施祖辉.地貌晕渲法[M].北京测绘出版社,1983.
[99].俞连笙,王涛.地图整饰[M].北京:测绘出版社,1995
[100].郭礼珍,李霖,张园玉.基于视觉表象的彩色晕渲地图色彩设计[J].武汉大学学报(信息科学版),2004,29(6):492~495
[101].曹纯贫.数字地貌晕渲中若干参数的设置[J].测绘通报. 2003(5):17~19
[102].江文萍,毋河海,杜清远,等。大型彩色晕渲的自动生成技术研究[J].武汉大学学报(信息科学版),2004,29(6):496-499
[103].甘昱,庞小平,李雪梅.大比例尺彩色地貌晕渲图的生成技术[J].测绘通报,2005(11):58~62
[104].WEIBEI,R.AND HELLER,M. Digital Terrain Modelling[M]. Geographical Information System: Principles And Application,1991
[105].ZHOU QIMING. Relief Shading Using Digital Evaluation Models[J]. Computers and Geosciences,18(8):1035~1045
[106].吴樊,俞连笙.基于DEM的地貌晕渲图的制作[J].测绘信息与工程,2003,28(1):31~32。
[107].刘修国,张剑波.基于DEM库的地表模型实时简化方法[J].小型微型计算机系统.2004,25(2):280~282
[108].刘学惠.基于图象空间判据的地表模型加速绘制技术[J].软件学报.1998,(9):481～485
[109].胡卫明,吴兵,凌海滨.地图等高线自动内插算法[J].计算机学报.2000,23(8),847~851
[110].李锡堤.数值地形的彩绘明暗图制作及应用[J].1996,56:69~84
[111].Donald H, M.Pauline, etc.著.蔡士杰等译.计算机图形学(第二版).北京:电子工业出版社.2004:122~123
[112].吴立新,史文中.地理信息系统原理与算法[M].北京:科学出版社.2003:184~200
[113].彭省临,杨中宝,李朝艳,等.基于GIS确定地球化学异常下限的新方法[J].地球科学与环境学报,2004,26(3):28-31.
[114].龙宝林,薛迎喜,冯京,等.新疆东天山斑岩铜矿的找矿模型试探[J].中国地质,2001,28(5):35～38.
[115].张良臣,吴乃元.天山地质构造及演化史[J].新疆地质,1985,3(3):1-14.
[116].成守德,王广瑞,杨树德等.新疆古板块构造[J].新疆地质,1986,4(2):1-26.
[117].肖序常,汤耀庆,冯益民等.新疆北部及其邻区大地构造[M].北京:地质出版社,1992,1-200.
[118].马瑞士,叶尚夫,王赐银,等.东天山造山带构造格架和演化[A].新疆地质科学,第二辑[C].北京,地质出版社,1990,21-36.
[119].马瑞士,王赐银,叶尚夫,等.东天山构造格架及地壳演化[M].南京:南京大学出版社,1993,1-200.
[120].娄德波,新疆东天山铜镍矿资源潜力评价方法研究博士学位论文[D].北京.中国地质科学院.2008年