面向大数据集的地形模型多分辨率建模关键技术研究
|
摘要
多分辨率地形简化模型不仅在户外场景绘制领域有着广泛的应用,而且在科学计算可视化研究领域也越来越受到关注。由此可见,兼顾两种领域双重需求的多分辨率建模技术有着重要的研究意义和应用前景。
本文的主要研究内容包括:①建立了面向大数据集的地形外存物理模型和逻辑模型。分析了传统多分辨率外存模型通过采用影像金字塔技术,对相同地形以不同分辨率冗余存储的问题,提出了不增加物理存储的多分辨率外存框架,使载入内存的数据量大大减少。②根据静态几何误差相近、地形空间封闭的原则,在逻辑模型基础上进行了聚类分析。提出了基于多分辨率的空间填充曲线自动生成算法,实现了基于聚类的局部数据检索、更新和增量调度,使数据载入内存的效率显著提高。③构造了一种新的隐式层次结构,给出了节点位置与层次之间、父子节点之间相互索引的计算公式和理论证明。分析了经典的逐层简化算法存在的问题,提出了层次模型简化技术与群智能算法相结合的模型简化方法。该方法在保证简化模型的自适应性和精度要求的同时大大提高了简化算法的效率。④分析了传统算法中采用统一误差计算方法和阈值的缺点,结合科学计算领域对高质量简化模型的需求,我们提出了自适应确定误差阈值的方法,使多分辨率模型在简化比例较高的情况下,仍然保持较高的模型精度。⑤针对大部分算法在修补多分辨率模型裂缝时产生许多冗余三角形的问题,提出了结合裂缝可见性的多分辨率模型裂缝修补算法。研究了多分辨率纹理数据的外存组织与调度以及多纹理合成技术,其合成的纹理模型与三维几何模型具有良好的结合性。
Terrain model has been widely used in many fields such as 3D games, flight training, environmental simulation for the battlefield, geological information system (GIS), virtual reality (VR), and so on. At present, the study about terrain model has been applied into other fields which include aeronautics, airborne system, navigation system in 3D terrain、forecast for geological disaster and so on. Recently, with the rapid development of the digital measuring techniques, terrain model can represent more detailed features and then terrain scene turns to be more complicated. Accordingly, rendering large scale or super large scale terrain scene has to be supported by external memory. However, the obvious velocity difference between external memory and RAM has been a bottleneck in dealing with large scale data. Therefore, it is extremely meaningful for studying external memory management in terrain model, which is the basic for rendering terrain scene with large data and also becomes one of the focuses studied by the domestic and overseas scholars.
Simplifying terrain model is not only the key technique of rendering terrain scene with large data, but also increasingly draws attention from fields such as 3D model retrieval, terrain navigation, simulation of water flow and so on. It is difficult for most model simplifying algorithms to consider both the efficiency of algorithms and the quality of the approximations. Therefore, researchers usually focus on one side according to the above different demands. The goal of the former is to improve the algorithm efficiency, and then meet the requirement of the graphic hardware. In scientific visualization field, the quality of approximations is more important, that is to say, the approximations should be of high accurate even with higher simplification ratio. With the development of scientific visualization, however, applications of many researching fields also have included rendering the dynamic scene. Therefore, it is extremely significant to develop an effective method for rapidly producing high-quality multi-resolution approximations of the original model.
In view of this, we have deeply studied on these aspects including data organization based on large-scale terrain data set, multi-resolution modeling methods and their key techniques etc. The main work and contributions in this paper are just as followed.
(1) The research advances about out-of-core data organization, multi-resolution modeling methods and their key techniques have been introduced in details.
The classical methods and latest developments proposed by domestic and overseas scholars in multi-resolution modeling field have been classified and described. The key problems are also analyzed and summarized. There are mainly the following several aspects:①Out-of-core technique for large data set;②data fitting of approximations and simplification method of terrain model;③error metric for the simplification model;④cracks stitching of multi-resolution models and synthesis of multi-textures of terrain model.
(2) The terrain out-of-core model has been studied for the terrain model with large-scale data set. Based on the physical model and logical model, the data organization method and its scheduling strategy have been proposed.
By analyzing traditional multi-resolution external memory model, which takes image pyramid technique, the problem of redundant resolution storage was identified. We proposed the terrain data organization method and the data scheduling strategy, including five steps: data reorganization of the original terrain, multi-resolution logic model for external memory, clustering analysis on multi-resolution terrain, coding of nodes in a cluster, and incremental data scheduling.
Detailed works are just as follows:①Division of physical data blocks for the various data sources has been completed, which considers both the constraint conditions of the logical model and the expansibility of physical model.②Logical multi-resolution model was created in terms of terrain fluctuant features. There are no adding physical storages of multi-detailed layers in such model, but building a multi-resolution logical model index on the basic of changeless physical model. Therefore, under the situation of no adding redundant physical storage, the data loaded into the RAM will be radically reduced.③Clustering analysis for the logical model has been done, according to the principle that static errors are similar. All the data blocks in each clustering can constitute a closed terrain area. So, once a certain clustering is determined by needs of RAM, we can lessen searching scope, directly carrying such data into RAM without losing the data block.④Building multi-resolution filled curves, we can arrange sequence and code for data block in every clustering. By this method we can intercept continuous data block by needs of RAM according to local features of filled curves.⑤Incremental data scheduling has been adopted to further reduce data carried into RAM, which can improve the responding speed of I/O operations.
According to five steps above, multi-resolution external memory organization has been performed, which data carried into RAM has been reduced sharply. By clustering analysis and incremental data scheduling, efficiency of carrying data into RAM has been improved obviously. (3) The terrain model simplification method has been proposed based on terrain features, using the idea of discrete particle swarm algorithm.
After analyzing the existed problem in classical hierarchical model, we put forward the method that combine the hierarchical model simplification with the swarm intelligence algorithm. What is new in this method is that the particle has been redefined as a set of feature bits, and a new evaluation function has been proposed. It is better to measure the surface of an approximation model. Based on it, an optimal particle can be produced and has been taken as the heuristic information to accelerate the simplification. As a result, the simplification across layers has been performed. Therefore, the efficiency of our method and the quality of approximations are improved greatly.
The main works are following:①A RAM data structure was proposed, which suitable for external memory data loading, namely connotative hierarchical structure (CHS). After proving the properties of connotative hierarchy theoretically, we explained the relation between the layer information of a node and its position, and the index equations between father nodes and their child nodes each other.②In order to put all the detailed features of terrain into the consideration of error function, the concept of simplification field was presented.③A new divergence function has been put forward based on simplification areas and its equations have also presented. In virtue of this function, the simplification model is of quite high accuracy even as the higher simplification ratio, due to the entire characters and local characters in model are both considered.④Redefining particle structure as a state of simplification model and carrying out particle compressing storage by use of CHS.⑤Setting up particle evaluating metric based on the divergence function and simplification ratio of the model, we can keep the convergence of the algorithm, and accelerate the process of the optimal multi-resolution terrain model.
(4) These methods have been studied in this paper on confirming adaptively the multi-threshold of error metrics in the simplification model.
Analyzing the disadvantages in traditional algorithm using the unified error threshold calculating method, we proposed the multi-threshold error strategy according to the higher quality demands of the scientific fields. By this strategy, we resolved the problem how to improve the model accuracy. Firstly, the base of our work is an algorithm for selecting the feature points of terrain model presented by CHS. And then we proposed the corresponding strategies to deal with three various terrain features.
①Aiming at the terrain that combines canyon with plateau, we put forward the method of bisection threshold based on grain calculation, because of their clear division features of terrains. After rough division for terrain, we respectively take the different error calculating and threshold to improve the accuracy of the simplification model.②Aiming at the rugged terrain without obvious division, we put forward self-adaptability model simplification method based on merging feature areas. After merging the areas with the similar matching degree, we neglect the nodes that meet error tolerance, and then made a further division for some complicated terrains. The advantage is that it can produce the accurate simplification models and improve efficiency of the algorithm.③Aiming at the flat terrain without division features, we made a mend on the basic of the second method and put forward the strategy of terrain fluctuant degree. We focus on resolving the problems how to unite multi-resolution feature fields and divide irregular simplification areas, then enlarging the grain of merging the feature areas. Thus, it took short time to combine the feature areas and divide the various simplification areas. Compared with method of②, the model accuracy of model and the efficiency of the algorithm are both slightly improved.
The above three methods are all tested on real data, and the results showed they can achieve the good balance between the quality of approximations and the efficiency of the algorithms.
(5) This paper has studied the continuity of multi-resolution models and the multi-texture synthesis of terrain models
The continuity of multi-resolution mesh models has always been a difficult problem that has to be considered and resolved. Many algorithms produced a lot of redundant triangles due to cracks stitching, which led to debase the efficiency of good algorithm in some extent, and thus the self-adaptability of simplification models is also been declined. In this paper, we sum up all the cracks stitching methods before and then put forward a cracks stitching method combining our CHS with terrain features. The redundant triangles have been deceased greatly in virtue of ignoring the invisible cracks in those flat areas, and accordingly improved the whole performance of algorithm. The experimental results showed that our seamless model is of the three characteristics:①mesh continuity;②changeless accuracy of multi-resolution model;③changeless terrain curving surface.
Texture plays an indispensable role on the terrain scene, but the data quantity of texture model usually exceeds the geometrical model of the terrains. For this problem, we put forward two kinds of resolving methods. One is to implement the multi-resolution texture storage and scheduling by use of our external memory model; the other is to meet the demands of terrain roaming by synthesis of the real-time texture according to the small block texture data and the terrain geometrical features. The experiments showed that the texture model and the geometrical model have been integrated tightly.
On the whole, certain other algorithms are faster or generate higher quality approximations than ours, but they typically do not meet the capability of our algorithm in both areas. In our whole framework, there are many key technologies, including terrain out-of-core model, data scheduling, model simplification, cracks stitching, multi-texture synthesis and so forth. The results in this paper are theoretical significant and of application value in the aspect of multi-resolution modeling of terrains, and in the application fields of considering the both requirements of rendering and scientific computation.
本文的主要研究内容包括:①建立了面向大数据集的地形外存物理模型和逻辑模型。分析了传统多分辨率外存模型通过采用影像金字塔技术,对相同地形以不同分辨率冗余存储的问题,提出了不增加物理存储的多分辨率外存框架,使载入内存的数据量大大减少。②根据静态几何误差相近、地形空间封闭的原则,在逻辑模型基础上进行了聚类分析。提出了基于多分辨率的空间填充曲线自动生成算法,实现了基于聚类的局部数据检索、更新和增量调度,使数据载入内存的效率显著提高。③构造了一种新的隐式层次结构,给出了节点位置与层次之间、父子节点之间相互索引的计算公式和理论证明。分析了经典的逐层简化算法存在的问题,提出了层次模型简化技术与群智能算法相结合的模型简化方法。该方法在保证简化模型的自适应性和精度要求的同时大大提高了简化算法的效率。④分析了传统算法中采用统一误差计算方法和阈值的缺点,结合科学计算领域对高质量简化模型的需求,我们提出了自适应确定误差阈值的方法,使多分辨率模型在简化比例较高的情况下,仍然保持较高的模型精度。⑤针对大部分算法在修补多分辨率模型裂缝时产生许多冗余三角形的问题,提出了结合裂缝可见性的多分辨率模型裂缝修补算法。研究了多分辨率纹理数据的外存组织与调度以及多纹理合成技术,其合成的纹理模型与三维几何模型具有良好的结合性。
Terrain model has been widely used in many fields such as 3D games, flight training, environmental simulation for the battlefield, geological information system (GIS), virtual reality (VR), and so on. At present, the study about terrain model has been applied into other fields which include aeronautics, airborne system, navigation system in 3D terrain、forecast for geological disaster and so on. Recently, with the rapid development of the digital measuring techniques, terrain model can represent more detailed features and then terrain scene turns to be more complicated. Accordingly, rendering large scale or super large scale terrain scene has to be supported by external memory. However, the obvious velocity difference between external memory and RAM has been a bottleneck in dealing with large scale data. Therefore, it is extremely meaningful for studying external memory management in terrain model, which is the basic for rendering terrain scene with large data and also becomes one of the focuses studied by the domestic and overseas scholars.
Simplifying terrain model is not only the key technique of rendering terrain scene with large data, but also increasingly draws attention from fields such as 3D model retrieval, terrain navigation, simulation of water flow and so on. It is difficult for most model simplifying algorithms to consider both the efficiency of algorithms and the quality of the approximations. Therefore, researchers usually focus on one side according to the above different demands. The goal of the former is to improve the algorithm efficiency, and then meet the requirement of the graphic hardware. In scientific visualization field, the quality of approximations is more important, that is to say, the approximations should be of high accurate even with higher simplification ratio. With the development of scientific visualization, however, applications of many researching fields also have included rendering the dynamic scene. Therefore, it is extremely significant to develop an effective method for rapidly producing high-quality multi-resolution approximations of the original model.
In view of this, we have deeply studied on these aspects including data organization based on large-scale terrain data set, multi-resolution modeling methods and their key techniques etc. The main work and contributions in this paper are just as followed.
(1) The research advances about out-of-core data organization, multi-resolution modeling methods and their key techniques have been introduced in details.
The classical methods and latest developments proposed by domestic and overseas scholars in multi-resolution modeling field have been classified and described. The key problems are also analyzed and summarized. There are mainly the following several aspects:①Out-of-core technique for large data set;②data fitting of approximations and simplification method of terrain model;③error metric for the simplification model;④cracks stitching of multi-resolution models and synthesis of multi-textures of terrain model.
(2) The terrain out-of-core model has been studied for the terrain model with large-scale data set. Based on the physical model and logical model, the data organization method and its scheduling strategy have been proposed.
By analyzing traditional multi-resolution external memory model, which takes image pyramid technique, the problem of redundant resolution storage was identified. We proposed the terrain data organization method and the data scheduling strategy, including five steps: data reorganization of the original terrain, multi-resolution logic model for external memory, clustering analysis on multi-resolution terrain, coding of nodes in a cluster, and incremental data scheduling.
Detailed works are just as follows:①Division of physical data blocks for the various data sources has been completed, which considers both the constraint conditions of the logical model and the expansibility of physical model.②Logical multi-resolution model was created in terms of terrain fluctuant features. There are no adding physical storages of multi-detailed layers in such model, but building a multi-resolution logical model index on the basic of changeless physical model. Therefore, under the situation of no adding redundant physical storage, the data loaded into the RAM will be radically reduced.③Clustering analysis for the logical model has been done, according to the principle that static errors are similar. All the data blocks in each clustering can constitute a closed terrain area. So, once a certain clustering is determined by needs of RAM, we can lessen searching scope, directly carrying such data into RAM without losing the data block.④Building multi-resolution filled curves, we can arrange sequence and code for data block in every clustering. By this method we can intercept continuous data block by needs of RAM according to local features of filled curves.⑤Incremental data scheduling has been adopted to further reduce data carried into RAM, which can improve the responding speed of I/O operations.
According to five steps above, multi-resolution external memory organization has been performed, which data carried into RAM has been reduced sharply. By clustering analysis and incremental data scheduling, efficiency of carrying data into RAM has been improved obviously. (3) The terrain model simplification method has been proposed based on terrain features, using the idea of discrete particle swarm algorithm.
After analyzing the existed problem in classical hierarchical model, we put forward the method that combine the hierarchical model simplification with the swarm intelligence algorithm. What is new in this method is that the particle has been redefined as a set of feature bits, and a new evaluation function has been proposed. It is better to measure the surface of an approximation model. Based on it, an optimal particle can be produced and has been taken as the heuristic information to accelerate the simplification. As a result, the simplification across layers has been performed. Therefore, the efficiency of our method and the quality of approximations are improved greatly.
The main works are following:①A RAM data structure was proposed, which suitable for external memory data loading, namely connotative hierarchical structure (CHS). After proving the properties of connotative hierarchy theoretically, we explained the relation between the layer information of a node and its position, and the index equations between father nodes and their child nodes each other.②In order to put all the detailed features of terrain into the consideration of error function, the concept of simplification field was presented.③A new divergence function has been put forward based on simplification areas and its equations have also presented. In virtue of this function, the simplification model is of quite high accuracy even as the higher simplification ratio, due to the entire characters and local characters in model are both considered.④Redefining particle structure as a state of simplification model and carrying out particle compressing storage by use of CHS.⑤Setting up particle evaluating metric based on the divergence function and simplification ratio of the model, we can keep the convergence of the algorithm, and accelerate the process of the optimal multi-resolution terrain model.
(4) These methods have been studied in this paper on confirming adaptively the multi-threshold of error metrics in the simplification model.
Analyzing the disadvantages in traditional algorithm using the unified error threshold calculating method, we proposed the multi-threshold error strategy according to the higher quality demands of the scientific fields. By this strategy, we resolved the problem how to improve the model accuracy. Firstly, the base of our work is an algorithm for selecting the feature points of terrain model presented by CHS. And then we proposed the corresponding strategies to deal with three various terrain features.
①Aiming at the terrain that combines canyon with plateau, we put forward the method of bisection threshold based on grain calculation, because of their clear division features of terrains. After rough division for terrain, we respectively take the different error calculating and threshold to improve the accuracy of the simplification model.②Aiming at the rugged terrain without obvious division, we put forward self-adaptability model simplification method based on merging feature areas. After merging the areas with the similar matching degree, we neglect the nodes that meet error tolerance, and then made a further division for some complicated terrains. The advantage is that it can produce the accurate simplification models and improve efficiency of the algorithm.③Aiming at the flat terrain without division features, we made a mend on the basic of the second method and put forward the strategy of terrain fluctuant degree. We focus on resolving the problems how to unite multi-resolution feature fields and divide irregular simplification areas, then enlarging the grain of merging the feature areas. Thus, it took short time to combine the feature areas and divide the various simplification areas. Compared with method of②, the model accuracy of model and the efficiency of the algorithm are both slightly improved.
The above three methods are all tested on real data, and the results showed they can achieve the good balance between the quality of approximations and the efficiency of the algorithms.
(5) This paper has studied the continuity of multi-resolution models and the multi-texture synthesis of terrain models
The continuity of multi-resolution mesh models has always been a difficult problem that has to be considered and resolved. Many algorithms produced a lot of redundant triangles due to cracks stitching, which led to debase the efficiency of good algorithm in some extent, and thus the self-adaptability of simplification models is also been declined. In this paper, we sum up all the cracks stitching methods before and then put forward a cracks stitching method combining our CHS with terrain features. The redundant triangles have been deceased greatly in virtue of ignoring the invisible cracks in those flat areas, and accordingly improved the whole performance of algorithm. The experimental results showed that our seamless model is of the three characteristics:①mesh continuity;②changeless accuracy of multi-resolution model;③changeless terrain curving surface.
Texture plays an indispensable role on the terrain scene, but the data quantity of texture model usually exceeds the geometrical model of the terrains. For this problem, we put forward two kinds of resolving methods. One is to implement the multi-resolution texture storage and scheduling by use of our external memory model; the other is to meet the demands of terrain roaming by synthesis of the real-time texture according to the small block texture data and the terrain geometrical features. The experiments showed that the texture model and the geometrical model have been integrated tightly.
On the whole, certain other algorithms are faster or generate higher quality approximations than ours, but they typically do not meet the capability of our algorithm in both areas. In our whole framework, there are many key technologies, including terrain out-of-core model, data scheduling, model simplification, cracks stitching, multi-texture synthesis and so forth. The results in this paper are theoretical significant and of application value in the aspect of multi-resolution modeling of terrains, and in the application fields of considering the both requirements of rendering and scientific computation.
引文
[1] Clark F O, Larry H M, John R W, et al. Visual terrain mapping for Mars exploration[J]. Computer Vision and Image Understanding, 2007, 105(1): 73-85.
[2]陆艳青.海量地形数据实时绘制的技术研究[D].杭州:浙江大学博士学位论文, 2003.
[3] Bremer P T, Pascucci V, Edelsberunner H, et al. A topological hierarchy for functions on triangulated surfaces[J]. IEEE Transactions on Visualization and Computer Graphics, 2004, 10(4): 385-396.
[4] Ben-Moshe B, Katz M J, Mitchell J S B, et al. Visibility preserving terrain simplification an experimental study[J]. Computational Geometry, 2004, 28(2-3): 175-190.
[5]丁娅琳. Google Earth [OL]. [2006-6-29] http://www.digitalearth.cn/readCont.asp?contID=4462
[6] Intergovernmental Committee on Surveying and Mapping. ICSM Guidelines for Digital Elevation Data [OL]. [2008-8-12] http://www.icsm.gov.au/icsm/elevation/icsm-guidelinesdigitalelevationdatav1.pdf
[7] Global Land Cover Facility (GLCF). Shuttle Radar Topography Mission (SRTM) [OL].[2006-12-17] http://glcf.umiacs.umd.edu/data/srtm/
[8] Kim J K, Ra J B. A real-time terrain visualization algorithm using wavelet-based compression[J]. The Visual Computer, 2004, 20(2-3): 67-85.
[9] Brooks S S, Whalley J L. Multilayer hybrid visualizations to support 3D GIS[J]. Computers, Environment and Urban Systems, 2008, 32(4): 278-292.
[10] Gu J J, Cao Q X, Huang Y. Rapid traversability assessment in 2.5D Grid-based map on rough terrain[J]. International Journal of Advanced Robotic Systems, 2008, 5(4): 389-394.
[11] Cignoni P, Ganovelli F, Gobbetti E, et al. Interactive out-of-core visualization of very large landscapes on commodity graphics platform[C]. Proceedings of ICVS 2003, Berlin Heidelberg: Springer-Verlag Press, 2003: 21-29.
[12]马照亭,潘懋,胡金星,吴焕萍,王占刚.一种基于数据分块的海量地形快速漫游方法[J].北京大学学报:自然科学版, 2004, 44(4): 619-625.
[13] Platings M, Day A M. Compression of large-scale terrain data for real-time visualization using a tiled quad tree[J]. Computer Graphics Forum, 2004, 23(4): 741-759.
[14]戴晨光,张永生,邓雪清.一种用于实时可视化的海量地形数据组织与管理方法[J].系统仿真学报, 2005, 17(2): 406-409.
[15] Sumengen S, Balcisoy S. Real-time simulation of autonomous vehicles on planet-sized continuous LOD terrains[C/OL]. Proceedings of WSCG’2005, Plzen Czech Republic, 2005. http://wscg.zcu.cz/WSCG2005/Papers_2005/Poster/H03-full.pdf
[16]施松新,叶修梓,张三元,张引.基于分块的大规模地形实时渲染方法[J].浙江大学学报工学版, 2007, 41(12): 2002-2006.
[17] Pajarola R. Large scale terrain visualization using the restricted quadtree triangulation[C]. Proceedings of IEEE Visualization 98, North Carolina: IEEE Computer Society Press, 1998:19-26.
[18] Cignoni P, Montani C, Rocchini C, Scopign R. External memory management and simplification of huge meshes[J]. IEEE Transactions on Visualization and Computer Graphics, 2003, 9(4): 525-537.
[19] Danovaro E, Floriani L D, Puppo E, et al. Multi-resolution out-of-core modeling of terrain and geological data[C]. Proceedings of ACMGIS'05, Bremen Germany: ACM Press, 2005: 143-152.
[20]李胜,冀俊峰,刘学慧,吴恩华.超大规模地形场景的高性能漫游[J].软件学报, 2006, 17(3): 535-545.
[21] Lindstrom P, Silva C T. A memory insensitive technique for large model simplification[C]. Proceedings of IEEE Visualization 2001, IEEE Computer Society Press, 2001: 121-126.
[22] Pascucci V. Frank R J. Global static indexing for real-time exploration of very large regular grids[C]. Proceedings of Supercomputing 01, 2001: 45-52.
[23] Lindstrom P, Pascucci V. Terrain simplification simplified: a general framework for view-dependent out-of-core visualization[J]. IEEE Transactions on Visualization and Computer Graphics, 2002, 8(3): 239-254.
[24] Isenburg M, Lindstrom P, Gumhold S, Snoeyink J. Large mesh simplification using processing sequences[C]. Proceedings of Visualization 2003, IEEE Computer Society Press, 2003: 465-472.
[25]王海洋,蔡康颖,王文成,吴恩华.外存模型简化中数据读取及内存分配的优化[J].计算机辅助设计与图形学学报, 2005, 17(8): 1736-1743.
[26]赵友兵,潘志庚,石教英.视点相关的地形LOD模型的动态生成算法[J].软件学报, 1999, 10(z): 251-254.
[27] Lindstrom P. Out-of-core construction and visualization of multiresolution surfaces[C]. Proceedings of ACM SIGGRAPH 2003, ACM Press, California, 2003: 93-102.
[28]许妙忠.大规模地形实时绘制的算法研究[J].武汉大学学报信息科学版, 2005, 30(5): 392-395.
[29] Bao X H, Pajarola R, Shafae M. SMART:An efficient technique for massive terrain visualization from out-of-core[C]. Proceedings of VMV 2004, Stanford, USA, 2004: 16-18.
[30] Lauritsen T, Nielsen S L. Rendering very large, very detailed terrains[R]. Denmark, 2005.
[31]蒲浩,宋占峰.基于可见性预处理的地形模型视相关简化算法[J].武汉大学学报信息科学版, 2005, 30(7): 636-639.
[32]吴金钟,刘学慧,吴恩华.超量外存地表模型的实时绘制技术[J].计算机辅助设计与图形学学报, 2005, 17(10): 2196-2202.
[33]高宇,魏迎梅,吴玲达.大规模外存场景的交互绘制[J].计算机辅助设计与图形学学报, 2007, 19(6): 792-797.
[34] Cignoni P, Ganovelli F, Gobbetti E. BDAM-batched dynamic adaptive meshes for high performance terrain visualization[J]. Computer Graphics Forum, 2003, 22(3): 505-514.
[35] Heckbert P S, Garland M. Fast polygonal approximation of terrains and height fields[R]. Report CMU-CS-95-181, Carnegie Mellon University, 1995.
[36] Shin B S, Jung H S. Contour-Based terrain model reconstruction using distance[C]. Proceedings of Gervasi et al. (Eds.), ICCSA 2005, Berlin Heidelberg: Springer-Verlag Press, 2005: 1177-1186.
[37] Scheib V, Haber J, Ming C, et al. Efficient fitting and rendering of large scattered data sets using subdivision surfaces[J]. EUROGRAPHICS, 2002, 21(3): 353-362.
[38] Casta?o D, Kunoth A. Multilevel regularization of wavelet based fitting of scattered data[J]. Numerical Algorithms, 2005, 39(1-3): 81-96.
[39] Daehmen W, Gmelig Meyling R H J, Ursem J H M. Scattered data interpolation by bivariate c1-piecewise quadratic functions[J]. Approximation Theory and its Applications, 1990, 6(3): 6-29.
[40] Arge E, Daehlen M, Tveito A. Approximation of scattered data using smooth grid functions[J]. Journal of Computational and Applied Mathematics, 1995, 59(2): 191-205.
[41] Haber J, Zeilfelder F, Davydov O, Seidel H P. Smooth approximation and rendering of large scattered data sets[C]. Proceedings of the conference on Visualization01, San Diego, California: IEEE Computer Society Press, 2001: 341-348.
[42] Tobor I, Reuter P, Schlick C. Efficient reconstruction of large scattered geometric datasets using the partition of unity and radial basis functions[J]. Journal of WSCG, 2004, 12(1-3): 467-474.
[43] Coll N, Guerrieri M, Rivara M C , Sellarès J A. Accurate interpolation of terrain surfaces from over-sampled grid data[C]. Proceedings of the 17th International Meshing Roundtable, 2008: 351-368.
[44] Bertram M, Tricoche X, Hagen H. Adaptive smooth scattered-data approximation for large-scale terrain visualization[C]. Proceedings of the symposium on Data visualisation 2003, Eurographics Association, 2003: 177-184.
[45] Pouderoux J, Gonzato J C. Adaptive hierarchical RBF interpolationfor creating smooth digital elevation models[C]. Proceedings of ACMGIS04, Washington, Dc, USA: ACM Press, 2004: 232-240.
[46]陈刚,夏青,万刚.地形RSG模型的动态构网算法[J].测绘学报, 2002, 31(1): 44-48.
[47] Xu K, Zhou X, Lin X. Direct mesh: a multiresolution approach to terrain visualization[C]. Proceedings of ICDE, 2004: 766-777.
[48] Hoppe H. View-dependent refinement of progressive meshes[C]. Proceedings of SIGGRAPH97. Los Angeles: ACM Press, 1997: 189-198.
[49] Hoppe H. Smooth view-dependent level-of-detail control and its applications to terrain rendering[C]. Proceedings of IEEE Visualization98, North Carolina: IEEE Computer Society Press, 1998: 35-42.
[50] El-Sana J, Varshney A. Generalized view-dependent simplification[J]. Computer Graphics Forum, 1999, 18(3): 83-94.
[51] Lindstrom P, Model simplification using image and geometry-based metrics[D] Atlanta, USA: Georgia Institute of Technology, 2000.
[52] Garland M. Quadric-based polygonal surface simplification[D]. Pittsburgh: Carnegie Mellon University, 1999.
[53] Garland M, Zhou Y. Quadric-based simplification in any dimension[J]. ACM Transactions on Graphics, 2005, 24(2): 209-239.
[54] Amor M, Boo M. A new architecture for efficient hybrid representation of terrains[J]. Journal of Systems Architecture, 2007, 4(5): 1-16.
[55] Ben-Moshe B, Matthew J K, Zaslavsky I. Distance Preserving Terrain Simplification - An Experimental Study[C]. Proceedings of The Canadian Conference on Computational Geometry, 2007: 129-132.
[56] Lindstrom P, Koller D, Ribarsky W, et al. Real-Time, continuous level of detail rendering of height fields[J]. ACM Computer Graphics (SIGGRAPH’96), 1996, 30(3): 109-118.
[57] Duchaineau M, Wolinsky M. ROAMing terrain: real-time optimally adapting meshes[C]. Proceedings of the IEEE Visualization. Los Alamitos: IEEE Computer Society Press, 1997: 81-88.
[58] Ulrich T. Rendering massive terrains using chunked level of detail control[C/OL]. Proceedings of SIGGRAPH2002, San Antonio, Texas USA: ACM Press, 2002. http://tulrich.com/geekstuff/sig-notes.pdf
[59] Losasso F, Hoppe H. Geometry Clipmaps: Terrain rendering using nested regular grids[C]. Proceedings of SIGGRAPH 2004, Los Angeles: ACM Press, 2004: 769-786.
[60] Asirvatham A, Hoppe H. Terrain rendering using GPU-based geometry clipmaps[C]. Proceedings of Addison-Wesley, 2005: 27-45.
[61] Lindstrom P, Pascucci V. Visualization of large terrains made easy[C].Proceedings of IEEE Visualization 2001. San Diego, California, USA: IEEE, 2001: 363-370.
[62]王林旭,李思昆,潘晓辉.动态地形的实时可视化[J].计算机学报, 2003, 26(11): 1524-1529.
[63] Volkov V, Li L. Real-Time refinement and simplification of adaptive triangular meshes[C]. Proceedings of 14th IEEE Visualization Conference(VIS’03), 2003: 155-162.
[64] Suáreza J P, Plazab A. Four-triangles adaptive algorithms for RTIN terrain meshes[J]. Mathematical and Computer Modelling, 2009, 49(5-6): 1012-1020.
[65] Willem H, Boer D. Fast terrain rendering using geometrical MipMapping[C/OL]. 2000, http://www.connectii.net/emersion
[66]魏峰,王文成,吴恩华.结合可见性处理的顺序点模型树[J].计算机学报, 2005, 28(28): 950-958.
[67] Larsen B D, Christensen N J. Real-time terrain rendering using smooth hardware optimized level of detail[J]. Journal of WSCG, 2003, 11(1): 282-289.
[68] Yotam L, Neta S, Tal G, et al. A GPU persistent grid mapping for terrain rendering[J]. The Visual Computer, 2008, 24(2): 139-153.
[69] Levenberg J. Fast view-dependent level-of-detail rendering using cached geometry[C]. Proceedings of IEEE Visualization 2002, Los Alamitos: IEEE Computer Society Press, 2002: 259-265.
[70] Schneider J, Westermann R. GPU-Friendly high-quality terrain rendering[J]. Journal of WSCG, 2006, 14(1-3): 49-56.
[71] Yotam L, Zvi K, Jihad E S. Seamless patches for GPU-based terrain rendering[C]. Proceedings of WSCG2007, Plzen Czech Republic, 2007: 201-208.
[72] R?ttger S, Heidrich W, Slusallek P. Real-Time generation of continuous levels of detail for height fields[C]. Proceedings of Skala V, ed. Winter School in Computer Graphics(WSCG’98), Plzen: Science Press, 1998: 315-322.
[73] Smullen S, Smullen C W, et al. Interactive 3D terrain exploration and visualization[C]. Proceedings of the 43rd ACM Southeast Conference, Kennesaw, GA, USA: ACM Press, 2005: 148-152.
[74] Li B Y, Liao H S, Chang C H, et al. Visualization for HPC data-large terrain model[C]. Proceedings of the Seventh International Conference on High Performance Computing and Grid in Asia Pacific Region. Hsinchu, Taiwan: IEEE Computer Society Press, 2004, 20-22: 280-284.
[75] Balmelli L,Kovacevic J,Vetterli M. Quadtrees for Embedded Surface Visualization: Constraints and Efficient Data Structures[C]. Proceedings of ICIP99, Kobe, Japan: IEEE Press, 1999:487-491.
[76] Pajarola R. Overview of quadtree-based terrain triangulation and visualization[R]. Department of Information & Computer Science, University of California, Irvine, UCI-ICS-02-01, 2002.
[77] Clasen M, Hege H C. Terrain rendering using spherical clipmaps[C/OL]. Proceedings of IEEE-VGTC Symposium on Visualization, Lisbon, Portugal: Eurographics Press, 2006. http://www.zib.de/clasen/download/SphericalClipmaps_Electronic.pdf
[78]赵学胜,白建军,王志鹏.基于QTM的全球地形自适应可视化模型[J].测绘学报, 2007, 36(3): 316-320.
[79] Pajarola R, Antonijuan M, Lario R. QuadTIN: Quadtree based Triangulated Irregular Networks[C]. Proceedings of IEEE Visualization 2002, IEEE Computer Society Press, 2002: 395-402.
[80]王源,刘建永等.视点相关实时LoD地形模型动态构网算法[J].测绘学报, 2003, 32(1): 46-52.
[81] Pajarola R, Gobbetti E. Survey of semi-regular multiresolution models for interactive terrain rendering[J]. The Visual Computer, 2007, 23(8): 583-605.
[82]王璐锦,唐泽圣.基于分形维数的地表模型多分辨率动态绘制[J].软件学报, 2000, 11(9): 1181-1188.
[83]莫灿林,谭建荣,张树有.基于自适应神经网络的自由曲面分形生成[J].软件学报, 2001, 12(4): 592-598.
[84]莫灿林,谭建荣.基于整数维约束的分维形状映射生成方法[J].计算机学报, 2002, 25(3): 247-253.
[85] Saux E, Thibaud R, et al. A new approach for a topographic feature-based characterization of digital elevation data[C]. Proceedings of ACMGIS04, Washington, USA: ACM Press, 2004: 73-81.
[86] Vivoni E R, Teles V, et al. Embedding landscape processes into triangulated terrain models[J]. International Journal of Geographical Information Science, 2005, 19(4): 429-457.
[87]殷媛,陈国军,吴威.地形分块绘制中的边界裂缝处理算法[J].计算机辅助设计与图形学学报, 2006, 18(10): 1557-1562.
[88]赵友兵,石教英,周骥,潘志庚.一种大规模地形的快速漫游算法[J].计算机辅助设计与图形学学报, 2002, 14(7): 624-628.
[89] Gerstner T. Multiresolution compression and visualization of global topographic data[J]. Geoinformatica, 2003, 7(1): 7-32.
[90]谭兵,徐青,周杨.大区域地形可视化技术的研究[J].中国图象图形学报, 2003, 8(5): 579-585.
[91]陈少强,朱铁稳,李琦,苗前军.大规模多分辨率地形模型简化生成方法[J].计算机辅助设计与图形学学报, 2005, 17(2): 273-278.
[92] Vo H T, Callahan S P, Lindstrom P, Pascucci V, Cláudio T S. Streaming simplification of tetrahedral meshes[J]. IEEE transactions on visualization and computer graphics, 2007, 13(1): 145-155.
[93] Bandou Y, Kamata S I. An address generator for n-dimensional pseudo-Hilbert scan in a hyper-rectangular parallelepiped region[C]. Proceedings of International Conference on Image Processing, 2000: 707-714.
[94] Shaffer E, Garland M. A multi-resolution representation for massive meshes[J]. IEEE Transactions on Visualization and Computer Graphics, 2005, 11(2): 139-148.
[95] Yoon S, Salomon B, Gayle R. Quick-VDR: Out-of-core view-dependent rendering of gigantic models[J]. IEEE Transactions on Visualization and Computer Graphics, 2005, 11(4): 369-382.
[96] Dalecki D, Lebied? J, Mieloszyk K, et al. Efficiency of interactive terrain visualization with a PC-cluster[J]. Parallel Processing and Applied Mathematics, 2008, LNCS4967: 391-399.
[97] Eppstein D, Gopi M. Single-strip triangulation of manifolds with arbitrary topology[C]. Proceedings of Symposium on Computational Geometry, 2004: 455-456.
[98] Chim J, Lau R W H, Si A, et al. Multi-resolution model transmission in distributed virtual environments[C]. Proceedings of ACM Symposium on Virtual Reality Software and Technology, 1998: 25-34.
[99]肖俊,庄越挺,吴飞.基于细节层次与最小生成树的三维地形识别与检索[J].软件学报, 2003, 14(11): 1955-1963.
[100]许存禄,陈雁秋,卢汉清.基于统计地形特征的纹理检索方法[J].计算机研究与发展, 2006, 43(4): 702-707.
[101]骆岩林,汪国昭.地形模拟的细分细化方法[J].计算机学报, 1999, 22(7): 746-751.
[102]李胜,刘学慧,王文成,吴恩华.层次可见性与层次细节地表模型相结合的快速绘制[J].计算机学报, 2002, 25(9): 945-952.
[103] Nikiel S, Goinski A. A recursive subdivision scheme for isosurface construction[J]. Computers & Graphics, 2005, 29: 155-164.
[104] Lee C H, Varshney A, Jacobs D, 2005. Mesh saliency[J]. ACM Transactions on Graphics (Proceedings of SIGGRAPH 2005), 2005, 24(3): 659-666.
[105]álvarez R, Noguera J V, Tortosa L, Zamora A. A mesh optimization algorithm based on neural networks[J]. Information Sciences, 2007, 177(23): 5347-5364.
[106] Zhang Y, Sun Z X, Li W H. Dynamic panorama using particle swarm optimization[C]. Proceedings of ICAT 16th International Conference on Artificial Reality and Telexistence Workshops, Hangzhou, China: IEEE Society Press, 2006: 676-685.
[107] Yang Q Y, Sun J G, Zhang J Y. A hybrid particle swarm optimization for binary CSPs[C]. Proceedings of International Conference on Intelligent Computing (ICIC2006), Springer Press, LNCS 4115, 2006: 39-49.
[108]杨轻云,孙吉贵,张居阳.最大度二元约束满足问题粒子群算法[J].计算机研究与发展, 2006, 43(3): 436-441.
[109] Yang Q Y, Sun J G, Zhang J Y. A Hybrid Discrete Particle Swarm Algorithm for Open-Shop Problems[C]. Proceedings of the 6th International Conference on Simulated Evolution And Learning (SEAL 2006), Hefei China: Springer Press, LNCS 4247, 2006:158-165.
[110] Yin P Y. A discrete particle swarm algorithm for optimal polygonal approximation of digital curves[J]. Journal of Visual Communication & Image Representation, 2004, 15(2): 241-260.
[111] Dozier G, Brown D, Hou H, Hurley J. Vulnerability analysis of immunity-based intrusion detection systems using genetic and evolutionary hackers[J]. Applied Soft Computing, 2007, 7(2): 547-553.
[112] Kennedy J, Eberhart R C. Particle swarm optimization[C]. Proceedings of the IEEE International Conference on Neural Networks, 1995: 1942-1948.
[113] Kennedy J, Eberhart R C. A discrete binary version of the particle swarm algorithm[C]. Proceedings of the IEEE International Conference on Systems, Man, and Cybernetics, 1997, 5(12-15): 4104-4108.
[114] Song M P, Chen R, An J B. Social conventions to promise learning convergence[C]. Proceedings of Fuzzy Systems and Knowledge Discovery, IEEE Press, 2007: 660-662.
[115] Cignoni P, Ganovelli F, Gobbetti E, et al. Planet-sized batched dynamic adaptive meshes (p-bdam) [C]. Proceedings of IEEE Visualization2003, Seattle, WA, USA:IEEE Computer Society Press,2003: 147-154.
[116] Holler W. Evaluation of LOD-techniques for GPU-based height field rendering[R/OL]. [2005-5-31] http://wwwcg.in.tum.de/Theses/Results/holler2005/downloads/ausarbeitung.pdf
[117] Vineet R, Kamat M, et al. Large-scale dynamic terrain in three-dimensional construction process visualizations[J]. Journal of Computing in Civil Engineering, 2005, 19(2): 160-171.
[118] Cignoni P, Puppo E, Scopigno R. Representation and visualization of terrain surfaces at variable resolution[J]. The Visual Computer, 1997, 13(5): 199-217.
[119] Pajarola R. Access to large scale terrain and image databases in geoinformation systems[D]. Zurich: Swiss Federal Institute of Technology, 1998.
[120]张立强,杨崇俊.多进制小波和二叉树实现大规模地形的实时漫游[J].计算机辅助设计与图形学学报, 2005, 17(3): 467-472.
[121] Defloriani L, Magillo P, Puppo E. Building and travers-ing a surface at variable resolution[C]. Proceedings of IEEE Visualization97, Los Alamitos: IEEE Press, 1997: 103-110.
[122] Zhang L Q, Yang C J, et al. Effective techniques for interactive rendering of global terrain surfaces[J]. IEEE Geoscience and Remote Sensing Letters, 2005, 2(2): 215-219.
[123] Rabinovich B, Gotsman C. Visualization of large terrains in resource-limited computing environments[C]. Proceedings of Yagel R, Hagen H, eds. IEEE Visualization97, Los Alamitos: IEEE Press, 1997: 95-102.
[124] Garland M, Heckbert P S. Surface simplification using quadric error metrics[C]. Proceedings of SIGGRAPH 1997, 1997: 209-216.
[125] Lau R W H, Green M, To D, Wong J. Real time continuous multi-resolution method for models of arbitrary topology[J]. Teleoperators and Virtual Environments, 1998, 7(1): 2-35.
[126] Gingold Y I, Zorin D. Controlled-topology filtering[J]. Computer-Aided Design, 2007, 39(8): 676-684.
[127] Danovaro E, Floriani L D, Magillo P, et al. Morphology-Driven simplification and multiresolution modeling of terrains[C]. Proceedings of ACMGIS 03, New Orleans, Louisiana, USA: ACM Press, 2003: 63-70.
[128] Gyulassy A, Natarajan V, Pascucci V, et al. A topological approach to simplification of three-Dimensional scalar functions[J]. IEEE Transactions on Visualization and Computer Graphics, 2006, 12(4): 474-484.
[129] Li Q Q, Wang Z, Yang B S. Multi-resolution representation of digital terrain models with terrain features preservation[J]. Science in China Series E-Technological Sciences, 2008, 52(13): 145-154.
[130] Jordan G. Adaptive smoothing of valleys in DEMs using TIN interpolation from ridgeline elevations: An application to morphotectonic aspect analysis[J]. Computers & Geosciences, 2007, 33(4): 573-585.
[131]全红艳,张田文,董宇欣.一种基于区域分割的几何模型简化方法[J].计算机学报, 2006, 29(10): 1835-1842.
[132] Hernández B, Rudomin I. Simple dynamic LOD for geometry images[C]. Proceedings of Fourth Int'l Conf. Computer Graphics and Interactive Techniques in Australasia and Southeast Asia (GRAPHITE '06), 2006: 157-163.
[133] Williams L. Pyramidal Parametrics[J]. ACM SIGGRAPH Computer Graphics, 1983, 17(3): 1-11.
[134] Tanner C C, Migdal C J, Jones M T. The clipmap: a virtual mipmap[C].Proceedings of SIGGRAPH, 1998: 151-159.
[135] Hwa L M, Duchaineau M A, Joy K I. Real-time optimal adaptation for planetary geometry and texture: 4-8 tile hierarchies[J]. IEEE Transactions on Visualization and Computer Graphics, 2005, 11(4): 355-368.
[136] Hua W, Zhang H S, Lu Y Q, et al. Huge texture mapping for real-time visualization of large-scale terrain[C]. Proceedings of VRST04. Hong Kong:ACM Press, 2004: 154-157.
[137]郭力真,费广正,王文成.结合纹理特征的模型简化误差度量算子[J].计算机学报, 2005, 28(6): 1054-1061.
[138]杨刚,王文成,吴恩华.基于边界图的纹理合成方法[J].计算机研究与发展, 2005, 42(12): 2118-2125.
[139]熊昌镇,黄静,齐东旭.基于不规则块的纹理合成方法[J].计算机研究与发展, 2007, 44(4):701-706.
[140] D?llner J, Baumann K, Hinrichs K. Texturing techniques for terrain visualization[C]. Proceedings of IEEE Visualization, 2000: 227-234.
[141] Lai Y Y, Tai W K, Chang C C, Liu C D. Synthesizing transition textures on succession patterns[C]. Proceedings of the 3rd international conference on Computer graphics and interactive techniques. ACM Press, New York, USA, 2005: 273-276.
[142] Hardy A. Blend maps: enhanced terrain texturing[C]. Proceedings of SAICSIT 2006: 61-70.
[143] Wei L Y, Levoy M. Fast texture synthesis using tree-structured vector quantization[C]. Proceedings of SIGGRAPH 2000, 2000: 479-488.
[144] Ashikhmin M, Synthesizing natural textures[C]. Proceedings of symposium on Interactive 3D graphics, 2001: 217-226.
[145] Efros A A, Freeman W T. Image quilting for texture synthesis and transfer[C]. Proceedings of SIGGRAPH 2001, 2001: 341-346.
[146] Wu Q, Yu Y. Feature matching and deformation for texture synthesis[J]. ACM Transactions on Graphics, 2004, 23(3): 364-367.
[147] Zhang J, Zhou K, Velho L, Guo B, Shum H Y. Synthesis of progressively-variant textures on arbitrary surfaces[J]. ACM Transactions on Graphics, 2003, 3(22): 295-302.
[148] Shenas H H, Interrante V. Compositing color with texture for multi-variate visualization[C]. Proceedings of the 3rd international conference on Computer graphics and interactive techniques. ACM Press, New York, 2005: 443-446.
[149] Lefebvre S, Hoppe H. Parallel controllable texture synthesis[J]. ACM Transactions on Graphics, 2005, 3(2): 777-786.
[150] Chang Y C, Song G S, Hsu S K. Automatic extraction of ridge and valley axes using the profile recognition and polygon-breaking algorithm[J]. Computer & Geosciences, 1998, 24(1): 83-93.
[151] Chang Y C, Sinha G. A visual basic program for ridge axis picking on DEM data using the profile-recognition and polygon-breaking algorithm[J]. Computers & Geosciences, 2007, 33(2): 229-237.
[152] Zhou H, Sun J, Turk G, Terrain Synthesis from Digital Elevation Models[J]. IEEE Transactions on Visualization and Computer Graphics, 2007, 13(4): 834-848.
[153]陈国军,赵沁平.分区动态地形的一种时序模型[J].计算机研究与发展, 2006, 43(5): 908-913.
[2]陆艳青.海量地形数据实时绘制的技术研究[D].杭州:浙江大学博士学位论文, 2003.
[3] Bremer P T, Pascucci V, Edelsberunner H, et al. A topological hierarchy for functions on triangulated surfaces[J]. IEEE Transactions on Visualization and Computer Graphics, 2004, 10(4): 385-396.
[4] Ben-Moshe B, Katz M J, Mitchell J S B, et al. Visibility preserving terrain simplification an experimental study[J]. Computational Geometry, 2004, 28(2-3): 175-190.
[5]丁娅琳. Google Earth [OL]. [2006-6-29] http://www.digitalearth.cn/readCont.asp?contID=4462
[6] Intergovernmental Committee on Surveying and Mapping. ICSM Guidelines for Digital Elevation Data [OL]. [2008-8-12] http://www.icsm.gov.au/icsm/elevation/icsm-guidelinesdigitalelevationdatav1.pdf
[7] Global Land Cover Facility (GLCF). Shuttle Radar Topography Mission (SRTM) [OL].[2006-12-17] http://glcf.umiacs.umd.edu/data/srtm/
[8] Kim J K, Ra J B. A real-time terrain visualization algorithm using wavelet-based compression[J]. The Visual Computer, 2004, 20(2-3): 67-85.
[9] Brooks S S, Whalley J L. Multilayer hybrid visualizations to support 3D GIS[J]. Computers, Environment and Urban Systems, 2008, 32(4): 278-292.
[10] Gu J J, Cao Q X, Huang Y. Rapid traversability assessment in 2.5D Grid-based map on rough terrain[J]. International Journal of Advanced Robotic Systems, 2008, 5(4): 389-394.
[11] Cignoni P, Ganovelli F, Gobbetti E, et al. Interactive out-of-core visualization of very large landscapes on commodity graphics platform[C]. Proceedings of ICVS 2003, Berlin Heidelberg: Springer-Verlag Press, 2003: 21-29.
[12]马照亭,潘懋,胡金星,吴焕萍,王占刚.一种基于数据分块的海量地形快速漫游方法[J].北京大学学报:自然科学版, 2004, 44(4): 619-625.
[13] Platings M, Day A M. Compression of large-scale terrain data for real-time visualization using a tiled quad tree[J]. Computer Graphics Forum, 2004, 23(4): 741-759.
[14]戴晨光,张永生,邓雪清.一种用于实时可视化的海量地形数据组织与管理方法[J].系统仿真学报, 2005, 17(2): 406-409.
[15] Sumengen S, Balcisoy S. Real-time simulation of autonomous vehicles on planet-sized continuous LOD terrains[C/OL]. Proceedings of WSCG’2005, Plzen Czech Republic, 2005. http://wscg.zcu.cz/WSCG2005/Papers_2005/Poster/H03-full.pdf
[16]施松新,叶修梓,张三元,张引.基于分块的大规模地形实时渲染方法[J].浙江大学学报工学版, 2007, 41(12): 2002-2006.
[17] Pajarola R. Large scale terrain visualization using the restricted quadtree triangulation[C]. Proceedings of IEEE Visualization 98, North Carolina: IEEE Computer Society Press, 1998:19-26.
[18] Cignoni P, Montani C, Rocchini C, Scopign R. External memory management and simplification of huge meshes[J]. IEEE Transactions on Visualization and Computer Graphics, 2003, 9(4): 525-537.
[19] Danovaro E, Floriani L D, Puppo E, et al. Multi-resolution out-of-core modeling of terrain and geological data[C]. Proceedings of ACMGIS'05, Bremen Germany: ACM Press, 2005: 143-152.
[20]李胜,冀俊峰,刘学慧,吴恩华.超大规模地形场景的高性能漫游[J].软件学报, 2006, 17(3): 535-545.
[21] Lindstrom P, Silva C T. A memory insensitive technique for large model simplification[C]. Proceedings of IEEE Visualization 2001, IEEE Computer Society Press, 2001: 121-126.
[22] Pascucci V. Frank R J. Global static indexing for real-time exploration of very large regular grids[C]. Proceedings of Supercomputing 01, 2001: 45-52.
[23] Lindstrom P, Pascucci V. Terrain simplification simplified: a general framework for view-dependent out-of-core visualization[J]. IEEE Transactions on Visualization and Computer Graphics, 2002, 8(3): 239-254.
[24] Isenburg M, Lindstrom P, Gumhold S, Snoeyink J. Large mesh simplification using processing sequences[C]. Proceedings of Visualization 2003, IEEE Computer Society Press, 2003: 465-472.
[25]王海洋,蔡康颖,王文成,吴恩华.外存模型简化中数据读取及内存分配的优化[J].计算机辅助设计与图形学学报, 2005, 17(8): 1736-1743.
[26]赵友兵,潘志庚,石教英.视点相关的地形LOD模型的动态生成算法[J].软件学报, 1999, 10(z): 251-254.
[27] Lindstrom P. Out-of-core construction and visualization of multiresolution surfaces[C]. Proceedings of ACM SIGGRAPH 2003, ACM Press, California, 2003: 93-102.
[28]许妙忠.大规模地形实时绘制的算法研究[J].武汉大学学报信息科学版, 2005, 30(5): 392-395.
[29] Bao X H, Pajarola R, Shafae M. SMART:An efficient technique for massive terrain visualization from out-of-core[C]. Proceedings of VMV 2004, Stanford, USA, 2004: 16-18.
[30] Lauritsen T, Nielsen S L. Rendering very large, very detailed terrains[R]. Denmark, 2005.
[31]蒲浩,宋占峰.基于可见性预处理的地形模型视相关简化算法[J].武汉大学学报信息科学版, 2005, 30(7): 636-639.
[32]吴金钟,刘学慧,吴恩华.超量外存地表模型的实时绘制技术[J].计算机辅助设计与图形学学报, 2005, 17(10): 2196-2202.
[33]高宇,魏迎梅,吴玲达.大规模外存场景的交互绘制[J].计算机辅助设计与图形学学报, 2007, 19(6): 792-797.
[34] Cignoni P, Ganovelli F, Gobbetti E. BDAM-batched dynamic adaptive meshes for high performance terrain visualization[J]. Computer Graphics Forum, 2003, 22(3): 505-514.
[35] Heckbert P S, Garland M. Fast polygonal approximation of terrains and height fields[R]. Report CMU-CS-95-181, Carnegie Mellon University, 1995.
[36] Shin B S, Jung H S. Contour-Based terrain model reconstruction using distance[C]. Proceedings of Gervasi et al. (Eds.), ICCSA 2005, Berlin Heidelberg: Springer-Verlag Press, 2005: 1177-1186.
[37] Scheib V, Haber J, Ming C, et al. Efficient fitting and rendering of large scattered data sets using subdivision surfaces[J]. EUROGRAPHICS, 2002, 21(3): 353-362.
[38] Casta?o D, Kunoth A. Multilevel regularization of wavelet based fitting of scattered data[J]. Numerical Algorithms, 2005, 39(1-3): 81-96.
[39] Daehmen W, Gmelig Meyling R H J, Ursem J H M. Scattered data interpolation by bivariate c1-piecewise quadratic functions[J]. Approximation Theory and its Applications, 1990, 6(3): 6-29.
[40] Arge E, Daehlen M, Tveito A. Approximation of scattered data using smooth grid functions[J]. Journal of Computational and Applied Mathematics, 1995, 59(2): 191-205.
[41] Haber J, Zeilfelder F, Davydov O, Seidel H P. Smooth approximation and rendering of large scattered data sets[C]. Proceedings of the conference on Visualization01, San Diego, California: IEEE Computer Society Press, 2001: 341-348.
[42] Tobor I, Reuter P, Schlick C. Efficient reconstruction of large scattered geometric datasets using the partition of unity and radial basis functions[J]. Journal of WSCG, 2004, 12(1-3): 467-474.
[43] Coll N, Guerrieri M, Rivara M C , Sellarès J A. Accurate interpolation of terrain surfaces from over-sampled grid data[C]. Proceedings of the 17th International Meshing Roundtable, 2008: 351-368.
[44] Bertram M, Tricoche X, Hagen H. Adaptive smooth scattered-data approximation for large-scale terrain visualization[C]. Proceedings of the symposium on Data visualisation 2003, Eurographics Association, 2003: 177-184.
[45] Pouderoux J, Gonzato J C. Adaptive hierarchical RBF interpolationfor creating smooth digital elevation models[C]. Proceedings of ACMGIS04, Washington, Dc, USA: ACM Press, 2004: 232-240.
[46]陈刚,夏青,万刚.地形RSG模型的动态构网算法[J].测绘学报, 2002, 31(1): 44-48.
[47] Xu K, Zhou X, Lin X. Direct mesh: a multiresolution approach to terrain visualization[C]. Proceedings of ICDE, 2004: 766-777.
[48] Hoppe H. View-dependent refinement of progressive meshes[C]. Proceedings of SIGGRAPH97. Los Angeles: ACM Press, 1997: 189-198.
[49] Hoppe H. Smooth view-dependent level-of-detail control and its applications to terrain rendering[C]. Proceedings of IEEE Visualization98, North Carolina: IEEE Computer Society Press, 1998: 35-42.
[50] El-Sana J, Varshney A. Generalized view-dependent simplification[J]. Computer Graphics Forum, 1999, 18(3): 83-94.
[51] Lindstrom P, Model simplification using image and geometry-based metrics[D] Atlanta, USA: Georgia Institute of Technology, 2000.
[52] Garland M. Quadric-based polygonal surface simplification[D]. Pittsburgh: Carnegie Mellon University, 1999.
[53] Garland M, Zhou Y. Quadric-based simplification in any dimension[J]. ACM Transactions on Graphics, 2005, 24(2): 209-239.
[54] Amor M, Boo M. A new architecture for efficient hybrid representation of terrains[J]. Journal of Systems Architecture, 2007, 4(5): 1-16.
[55] Ben-Moshe B, Matthew J K, Zaslavsky I. Distance Preserving Terrain Simplification - An Experimental Study[C]. Proceedings of The Canadian Conference on Computational Geometry, 2007: 129-132.
[56] Lindstrom P, Koller D, Ribarsky W, et al. Real-Time, continuous level of detail rendering of height fields[J]. ACM Computer Graphics (SIGGRAPH’96), 1996, 30(3): 109-118.
[57] Duchaineau M, Wolinsky M. ROAMing terrain: real-time optimally adapting meshes[C]. Proceedings of the IEEE Visualization. Los Alamitos: IEEE Computer Society Press, 1997: 81-88.
[58] Ulrich T. Rendering massive terrains using chunked level of detail control[C/OL]. Proceedings of SIGGRAPH2002, San Antonio, Texas USA: ACM Press, 2002. http://tulrich.com/geekstuff/sig-notes.pdf
[59] Losasso F, Hoppe H. Geometry Clipmaps: Terrain rendering using nested regular grids[C]. Proceedings of SIGGRAPH 2004, Los Angeles: ACM Press, 2004: 769-786.
[60] Asirvatham A, Hoppe H. Terrain rendering using GPU-based geometry clipmaps[C]. Proceedings of Addison-Wesley, 2005: 27-45.
[61] Lindstrom P, Pascucci V. Visualization of large terrains made easy[C].Proceedings of IEEE Visualization 2001. San Diego, California, USA: IEEE, 2001: 363-370.
[62]王林旭,李思昆,潘晓辉.动态地形的实时可视化[J].计算机学报, 2003, 26(11): 1524-1529.
[63] Volkov V, Li L. Real-Time refinement and simplification of adaptive triangular meshes[C]. Proceedings of 14th IEEE Visualization Conference(VIS’03), 2003: 155-162.
[64] Suáreza J P, Plazab A. Four-triangles adaptive algorithms for RTIN terrain meshes[J]. Mathematical and Computer Modelling, 2009, 49(5-6): 1012-1020.
[65] Willem H, Boer D. Fast terrain rendering using geometrical MipMapping[C/OL]. 2000, http://www.connectii.net/emersion
[66]魏峰,王文成,吴恩华.结合可见性处理的顺序点模型树[J].计算机学报, 2005, 28(28): 950-958.
[67] Larsen B D, Christensen N J. Real-time terrain rendering using smooth hardware optimized level of detail[J]. Journal of WSCG, 2003, 11(1): 282-289.
[68] Yotam L, Neta S, Tal G, et al. A GPU persistent grid mapping for terrain rendering[J]. The Visual Computer, 2008, 24(2): 139-153.
[69] Levenberg J. Fast view-dependent level-of-detail rendering using cached geometry[C]. Proceedings of IEEE Visualization 2002, Los Alamitos: IEEE Computer Society Press, 2002: 259-265.
[70] Schneider J, Westermann R. GPU-Friendly high-quality terrain rendering[J]. Journal of WSCG, 2006, 14(1-3): 49-56.
[71] Yotam L, Zvi K, Jihad E S. Seamless patches for GPU-based terrain rendering[C]. Proceedings of WSCG2007, Plzen Czech Republic, 2007: 201-208.
[72] R?ttger S, Heidrich W, Slusallek P. Real-Time generation of continuous levels of detail for height fields[C]. Proceedings of Skala V, ed. Winter School in Computer Graphics(WSCG’98), Plzen: Science Press, 1998: 315-322.
[73] Smullen S, Smullen C W, et al. Interactive 3D terrain exploration and visualization[C]. Proceedings of the 43rd ACM Southeast Conference, Kennesaw, GA, USA: ACM Press, 2005: 148-152.
[74] Li B Y, Liao H S, Chang C H, et al. Visualization for HPC data-large terrain model[C]. Proceedings of the Seventh International Conference on High Performance Computing and Grid in Asia Pacific Region. Hsinchu, Taiwan: IEEE Computer Society Press, 2004, 20-22: 280-284.
[75] Balmelli L,Kovacevic J,Vetterli M. Quadtrees for Embedded Surface Visualization: Constraints and Efficient Data Structures[C]. Proceedings of ICIP99, Kobe, Japan: IEEE Press, 1999:487-491.
[76] Pajarola R. Overview of quadtree-based terrain triangulation and visualization[R]. Department of Information & Computer Science, University of California, Irvine, UCI-ICS-02-01, 2002.
[77] Clasen M, Hege H C. Terrain rendering using spherical clipmaps[C/OL]. Proceedings of IEEE-VGTC Symposium on Visualization, Lisbon, Portugal: Eurographics Press, 2006. http://www.zib.de/clasen/download/SphericalClipmaps_Electronic.pdf
[78]赵学胜,白建军,王志鹏.基于QTM的全球地形自适应可视化模型[J].测绘学报, 2007, 36(3): 316-320.
[79] Pajarola R, Antonijuan M, Lario R. QuadTIN: Quadtree based Triangulated Irregular Networks[C]. Proceedings of IEEE Visualization 2002, IEEE Computer Society Press, 2002: 395-402.
[80]王源,刘建永等.视点相关实时LoD地形模型动态构网算法[J].测绘学报, 2003, 32(1): 46-52.
[81] Pajarola R, Gobbetti E. Survey of semi-regular multiresolution models for interactive terrain rendering[J]. The Visual Computer, 2007, 23(8): 583-605.
[82]王璐锦,唐泽圣.基于分形维数的地表模型多分辨率动态绘制[J].软件学报, 2000, 11(9): 1181-1188.
[83]莫灿林,谭建荣,张树有.基于自适应神经网络的自由曲面分形生成[J].软件学报, 2001, 12(4): 592-598.
[84]莫灿林,谭建荣.基于整数维约束的分维形状映射生成方法[J].计算机学报, 2002, 25(3): 247-253.
[85] Saux E, Thibaud R, et al. A new approach for a topographic feature-based characterization of digital elevation data[C]. Proceedings of ACMGIS04, Washington, USA: ACM Press, 2004: 73-81.
[86] Vivoni E R, Teles V, et al. Embedding landscape processes into triangulated terrain models[J]. International Journal of Geographical Information Science, 2005, 19(4): 429-457.
[87]殷媛,陈国军,吴威.地形分块绘制中的边界裂缝处理算法[J].计算机辅助设计与图形学学报, 2006, 18(10): 1557-1562.
[88]赵友兵,石教英,周骥,潘志庚.一种大规模地形的快速漫游算法[J].计算机辅助设计与图形学学报, 2002, 14(7): 624-628.
[89] Gerstner T. Multiresolution compression and visualization of global topographic data[J]. Geoinformatica, 2003, 7(1): 7-32.
[90]谭兵,徐青,周杨.大区域地形可视化技术的研究[J].中国图象图形学报, 2003, 8(5): 579-585.
[91]陈少强,朱铁稳,李琦,苗前军.大规模多分辨率地形模型简化生成方法[J].计算机辅助设计与图形学学报, 2005, 17(2): 273-278.
[92] Vo H T, Callahan S P, Lindstrom P, Pascucci V, Cláudio T S. Streaming simplification of tetrahedral meshes[J]. IEEE transactions on visualization and computer graphics, 2007, 13(1): 145-155.
[93] Bandou Y, Kamata S I. An address generator for n-dimensional pseudo-Hilbert scan in a hyper-rectangular parallelepiped region[C]. Proceedings of International Conference on Image Processing, 2000: 707-714.
[94] Shaffer E, Garland M. A multi-resolution representation for massive meshes[J]. IEEE Transactions on Visualization and Computer Graphics, 2005, 11(2): 139-148.
[95] Yoon S, Salomon B, Gayle R. Quick-VDR: Out-of-core view-dependent rendering of gigantic models[J]. IEEE Transactions on Visualization and Computer Graphics, 2005, 11(4): 369-382.
[96] Dalecki D, Lebied? J, Mieloszyk K, et al. Efficiency of interactive terrain visualization with a PC-cluster[J]. Parallel Processing and Applied Mathematics, 2008, LNCS4967: 391-399.
[97] Eppstein D, Gopi M. Single-strip triangulation of manifolds with arbitrary topology[C]. Proceedings of Symposium on Computational Geometry, 2004: 455-456.
[98] Chim J, Lau R W H, Si A, et al. Multi-resolution model transmission in distributed virtual environments[C]. Proceedings of ACM Symposium on Virtual Reality Software and Technology, 1998: 25-34.
[99]肖俊,庄越挺,吴飞.基于细节层次与最小生成树的三维地形识别与检索[J].软件学报, 2003, 14(11): 1955-1963.
[100]许存禄,陈雁秋,卢汉清.基于统计地形特征的纹理检索方法[J].计算机研究与发展, 2006, 43(4): 702-707.
[101]骆岩林,汪国昭.地形模拟的细分细化方法[J].计算机学报, 1999, 22(7): 746-751.
[102]李胜,刘学慧,王文成,吴恩华.层次可见性与层次细节地表模型相结合的快速绘制[J].计算机学报, 2002, 25(9): 945-952.
[103] Nikiel S, Goinski A. A recursive subdivision scheme for isosurface construction[J]. Computers & Graphics, 2005, 29: 155-164.
[104] Lee C H, Varshney A, Jacobs D, 2005. Mesh saliency[J]. ACM Transactions on Graphics (Proceedings of SIGGRAPH 2005), 2005, 24(3): 659-666.
[105]álvarez R, Noguera J V, Tortosa L, Zamora A. A mesh optimization algorithm based on neural networks[J]. Information Sciences, 2007, 177(23): 5347-5364.
[106] Zhang Y, Sun Z X, Li W H. Dynamic panorama using particle swarm optimization[C]. Proceedings of ICAT 16th International Conference on Artificial Reality and Telexistence Workshops, Hangzhou, China: IEEE Society Press, 2006: 676-685.
[107] Yang Q Y, Sun J G, Zhang J Y. A hybrid particle swarm optimization for binary CSPs[C]. Proceedings of International Conference on Intelligent Computing (ICIC2006), Springer Press, LNCS 4115, 2006: 39-49.
[108]杨轻云,孙吉贵,张居阳.最大度二元约束满足问题粒子群算法[J].计算机研究与发展, 2006, 43(3): 436-441.
[109] Yang Q Y, Sun J G, Zhang J Y. A Hybrid Discrete Particle Swarm Algorithm for Open-Shop Problems[C]. Proceedings of the 6th International Conference on Simulated Evolution And Learning (SEAL 2006), Hefei China: Springer Press, LNCS 4247, 2006:158-165.
[110] Yin P Y. A discrete particle swarm algorithm for optimal polygonal approximation of digital curves[J]. Journal of Visual Communication & Image Representation, 2004, 15(2): 241-260.
[111] Dozier G, Brown D, Hou H, Hurley J. Vulnerability analysis of immunity-based intrusion detection systems using genetic and evolutionary hackers[J]. Applied Soft Computing, 2007, 7(2): 547-553.
[112] Kennedy J, Eberhart R C. Particle swarm optimization[C]. Proceedings of the IEEE International Conference on Neural Networks, 1995: 1942-1948.
[113] Kennedy J, Eberhart R C. A discrete binary version of the particle swarm algorithm[C]. Proceedings of the IEEE International Conference on Systems, Man, and Cybernetics, 1997, 5(12-15): 4104-4108.
[114] Song M P, Chen R, An J B. Social conventions to promise learning convergence[C]. Proceedings of Fuzzy Systems and Knowledge Discovery, IEEE Press, 2007: 660-662.
[115] Cignoni P, Ganovelli F, Gobbetti E, et al. Planet-sized batched dynamic adaptive meshes (p-bdam) [C]. Proceedings of IEEE Visualization2003, Seattle, WA, USA:IEEE Computer Society Press,2003: 147-154.
[116] Holler W. Evaluation of LOD-techniques for GPU-based height field rendering[R/OL]. [2005-5-31] http://wwwcg.in.tum.de/Theses/Results/holler2005/downloads/ausarbeitung.pdf
[117] Vineet R, Kamat M, et al. Large-scale dynamic terrain in three-dimensional construction process visualizations[J]. Journal of Computing in Civil Engineering, 2005, 19(2): 160-171.
[118] Cignoni P, Puppo E, Scopigno R. Representation and visualization of terrain surfaces at variable resolution[J]. The Visual Computer, 1997, 13(5): 199-217.
[119] Pajarola R. Access to large scale terrain and image databases in geoinformation systems[D]. Zurich: Swiss Federal Institute of Technology, 1998.
[120]张立强,杨崇俊.多进制小波和二叉树实现大规模地形的实时漫游[J].计算机辅助设计与图形学学报, 2005, 17(3): 467-472.
[121] Defloriani L, Magillo P, Puppo E. Building and travers-ing a surface at variable resolution[C]. Proceedings of IEEE Visualization97, Los Alamitos: IEEE Press, 1997: 103-110.
[122] Zhang L Q, Yang C J, et al. Effective techniques for interactive rendering of global terrain surfaces[J]. IEEE Geoscience and Remote Sensing Letters, 2005, 2(2): 215-219.
[123] Rabinovich B, Gotsman C. Visualization of large terrains in resource-limited computing environments[C]. Proceedings of Yagel R, Hagen H, eds. IEEE Visualization97, Los Alamitos: IEEE Press, 1997: 95-102.
[124] Garland M, Heckbert P S. Surface simplification using quadric error metrics[C]. Proceedings of SIGGRAPH 1997, 1997: 209-216.
[125] Lau R W H, Green M, To D, Wong J. Real time continuous multi-resolution method for models of arbitrary topology[J]. Teleoperators and Virtual Environments, 1998, 7(1): 2-35.
[126] Gingold Y I, Zorin D. Controlled-topology filtering[J]. Computer-Aided Design, 2007, 39(8): 676-684.
[127] Danovaro E, Floriani L D, Magillo P, et al. Morphology-Driven simplification and multiresolution modeling of terrains[C]. Proceedings of ACMGIS 03, New Orleans, Louisiana, USA: ACM Press, 2003: 63-70.
[128] Gyulassy A, Natarajan V, Pascucci V, et al. A topological approach to simplification of three-Dimensional scalar functions[J]. IEEE Transactions on Visualization and Computer Graphics, 2006, 12(4): 474-484.
[129] Li Q Q, Wang Z, Yang B S. Multi-resolution representation of digital terrain models with terrain features preservation[J]. Science in China Series E-Technological Sciences, 2008, 52(13): 145-154.
[130] Jordan G. Adaptive smoothing of valleys in DEMs using TIN interpolation from ridgeline elevations: An application to morphotectonic aspect analysis[J]. Computers & Geosciences, 2007, 33(4): 573-585.
[131]全红艳,张田文,董宇欣.一种基于区域分割的几何模型简化方法[J].计算机学报, 2006, 29(10): 1835-1842.
[132] Hernández B, Rudomin I. Simple dynamic LOD for geometry images[C]. Proceedings of Fourth Int'l Conf. Computer Graphics and Interactive Techniques in Australasia and Southeast Asia (GRAPHITE '06), 2006: 157-163.
[133] Williams L. Pyramidal Parametrics[J]. ACM SIGGRAPH Computer Graphics, 1983, 17(3): 1-11.
[134] Tanner C C, Migdal C J, Jones M T. The clipmap: a virtual mipmap[C].Proceedings of SIGGRAPH, 1998: 151-159.
[135] Hwa L M, Duchaineau M A, Joy K I. Real-time optimal adaptation for planetary geometry and texture: 4-8 tile hierarchies[J]. IEEE Transactions on Visualization and Computer Graphics, 2005, 11(4): 355-368.
[136] Hua W, Zhang H S, Lu Y Q, et al. Huge texture mapping for real-time visualization of large-scale terrain[C]. Proceedings of VRST04. Hong Kong:ACM Press, 2004: 154-157.
[137]郭力真,费广正,王文成.结合纹理特征的模型简化误差度量算子[J].计算机学报, 2005, 28(6): 1054-1061.
[138]杨刚,王文成,吴恩华.基于边界图的纹理合成方法[J].计算机研究与发展, 2005, 42(12): 2118-2125.
[139]熊昌镇,黄静,齐东旭.基于不规则块的纹理合成方法[J].计算机研究与发展, 2007, 44(4):701-706.
[140] D?llner J, Baumann K, Hinrichs K. Texturing techniques for terrain visualization[C]. Proceedings of IEEE Visualization, 2000: 227-234.
[141] Lai Y Y, Tai W K, Chang C C, Liu C D. Synthesizing transition textures on succession patterns[C]. Proceedings of the 3rd international conference on Computer graphics and interactive techniques. ACM Press, New York, USA, 2005: 273-276.
[142] Hardy A. Blend maps: enhanced terrain texturing[C]. Proceedings of SAICSIT 2006: 61-70.
[143] Wei L Y, Levoy M. Fast texture synthesis using tree-structured vector quantization[C]. Proceedings of SIGGRAPH 2000, 2000: 479-488.
[144] Ashikhmin M, Synthesizing natural textures[C]. Proceedings of symposium on Interactive 3D graphics, 2001: 217-226.
[145] Efros A A, Freeman W T. Image quilting for texture synthesis and transfer[C]. Proceedings of SIGGRAPH 2001, 2001: 341-346.
[146] Wu Q, Yu Y. Feature matching and deformation for texture synthesis[J]. ACM Transactions on Graphics, 2004, 23(3): 364-367.
[147] Zhang J, Zhou K, Velho L, Guo B, Shum H Y. Synthesis of progressively-variant textures on arbitrary surfaces[J]. ACM Transactions on Graphics, 2003, 3(22): 295-302.
[148] Shenas H H, Interrante V. Compositing color with texture for multi-variate visualization[C]. Proceedings of the 3rd international conference on Computer graphics and interactive techniques. ACM Press, New York, 2005: 443-446.
[149] Lefebvre S, Hoppe H. Parallel controllable texture synthesis[J]. ACM Transactions on Graphics, 2005, 3(2): 777-786.
[150] Chang Y C, Song G S, Hsu S K. Automatic extraction of ridge and valley axes using the profile recognition and polygon-breaking algorithm[J]. Computer & Geosciences, 1998, 24(1): 83-93.
[151] Chang Y C, Sinha G. A visual basic program for ridge axis picking on DEM data using the profile-recognition and polygon-breaking algorithm[J]. Computers & Geosciences, 2007, 33(2): 229-237.
[152] Zhou H, Sun J, Turk G, Terrain Synthesis from Digital Elevation Models[J]. IEEE Transactions on Visualization and Computer Graphics, 2007, 13(4): 834-848.
[153]陈国军,赵沁平.分区动态地形的一种时序模型[J].计算机研究与发展, 2006, 43(5): 908-913.