三维仿真场景优化理论与算法研究
|
摘要
大数据量场景的实时仿真既是进行数字地球应用技术研究的主要内容之一，也是地理信息系统向三维立体分析纵深发展所需解决的重要命题之一。随着三维场景数据量的日益增大以及专为图形渲染设计的GPU的普及，在不明显降低图形质量和复杂程度的前提下，研究并采用一些可以应用在通用计算机平台上的高效数据处理方法与图形绘制算法，以提高图形绘制速度，解决大数据量仿真场景在速度、质量及场景复杂度之间越来越突出的矛盾，正成为有重要意义的研究方向。
本论文主要依托于国家科技攻关项目“奥运环境遥感动态监测”和中国科学院知识创新科技奥运项目“奥运主场馆区工程环境高分辨率遥感监测与虚拟仿真研究”，进行了大数据量场景中模型的自动简化、视点相关的有选择性实时细化以及GPU支持下的优化处理等相关理论与算法等方面研究，完成了奥林匹克公园仿真系统三维场景网络发布与浏览的设计与开发等工作，实现了面向互联网的三维场景显示、模型操作和属性数据查询等功能。
本文研究工作与创新之处主要体现在：
1) 研制出三维模型自动简化预处理模块，能有效降低人工简化编辑大数据量三维场景的作业强度。在二次误差度量算法的基础上，考虑边界约束条件和法向量限制，扩展了算法的应用范围。此种方法在尽量保持模型外观前提下，达到减少模型三角形数量，从而生成场景中不同细节层次模型的目标。同时能根据网络上发布三维场景的要求，缩减原始模型的文件尺寸到合适的大小。从三维成像效果上看，与普通二次型度量简化方法相比，改进算法得到的结果在外观显示上与原始模型能保持更高的相似性，有较好的显示质量。
2) 实现了视觉相关的实时有选择性细化算法，进一步提高了场景渲染速度。应用递进网格表示方法高效的存储了网格信息，支持多细节层次场景的自动生成和光滑过渡，能获得快速可视化效果。为进一步加速渲染，实现了视点相关的有选择性格网，能显著提高目标区域细节，同时减少对最终图像贡献少或没有贡献区域的细节，有效降低了图形流水线的渲染负担。使用界定面概念为引入的递进
Massive data scene real-time simulation is not only the one of main researches for digital earth application techniques, but also the important problem to be resolved for geographical information system developing towards the 3D analysis phase. With the quantity of 3D scene data increasing and popularization of graphics processing unit specially designed for graph rendering, if not obviously decreasing the graph quantity and complex of 3D scene, the research that some effective data processing and graph rendering methods can be applied on general computers to speed up rendering and solve the conflict among the speed, quality and complex of massive data scene is becoming an important direction.
Supported by National Key Technologies R&D Program Olympic Games Dedicated Projects "Research of dynamic monitor for Beijing Olympic Green Environment" and the Chinese Academy of Sciences Knowledge Innovation Program Science and Technology for Olympic item - research of high-resolution remote sensing monitoring and 3D simulation for the Beijing Olympic area, the related theory and methods are discussed and applied in this dissertation including the automatic simplification for models in massive data 3D scene, the viewpoint relevant selective real-time refinement and optimally processing assisted by GPU. The design and development for internet release and web browsing of virtual Beijing Olympic Park system are accomplished. The functions such as the display of 3D scene, operating models and attribute information query are realized at last.
The main works and innovations of this dissertation are as follows:
a) The preprocessing module of automatic simplification for 3D models is accomplished. Based on the primary quadric error metric arithmetic, combined with boundary constrained condition and normal restriction, the primary arithmetic is modified and the application scope is extended. The new arithmetic can preserve the appearance of original model and decrease the quantity of triangles of models to build the level of detail for 3D scene, and keep down the file size to an appropriate one for internet release of 3D scene. From the point of 3D scene imaging, comparing to the primary arithmetic, the result obtained from the improved arithmetic can preserve higher similarity with original models and has better display quality.
b) The viewpoint relevant selective real-time refinement arithmetic is realized. The progressive mesh method is applied to effectively storage the mesh information and support the automatic building of multi LOD and smooth transition and the quick visualization effect can be obtained. In order to speed up the graph rendering, the viewpoint relevant selective mesh is implemented, which can obviously enhance the detail of target area and reduce the detail of some areas for less or no contribution to the ultimate imaging and effectively lessen the rendering burden of graph pipeline. The boundary piece concept is used to provide the theory base for the progressive mesh selective refinement scheme. All possible selective mesh sets are listed and visualized, which result in not introducing additional vertex split and edge collapse
本论文主要依托于国家科技攻关项目“奥运环境遥感动态监测”和中国科学院知识创新科技奥运项目“奥运主场馆区工程环境高分辨率遥感监测与虚拟仿真研究”，进行了大数据量场景中模型的自动简化、视点相关的有选择性实时细化以及GPU支持下的优化处理等相关理论与算法等方面研究，完成了奥林匹克公园仿真系统三维场景网络发布与浏览的设计与开发等工作，实现了面向互联网的三维场景显示、模型操作和属性数据查询等功能。
本文研究工作与创新之处主要体现在：
1) 研制出三维模型自动简化预处理模块，能有效降低人工简化编辑大数据量三维场景的作业强度。在二次误差度量算法的基础上，考虑边界约束条件和法向量限制，扩展了算法的应用范围。此种方法在尽量保持模型外观前提下，达到减少模型三角形数量，从而生成场景中不同细节层次模型的目标。同时能根据网络上发布三维场景的要求，缩减原始模型的文件尺寸到合适的大小。从三维成像效果上看，与普通二次型度量简化方法相比，改进算法得到的结果在外观显示上与原始模型能保持更高的相似性，有较好的显示质量。
2) 实现了视觉相关的实时有选择性细化算法，进一步提高了场景渲染速度。应用递进网格表示方法高效的存储了网格信息，支持多细节层次场景的自动生成和光滑过渡，能获得快速可视化效果。为进一步加速渲染，实现了视点相关的有选择性格网，能显著提高目标区域细节，同时减少对最终图像贡献少或没有贡献区域的细节，有效降低了图形流水线的渲染负担。使用界定面概念为引入的递进
Massive data scene real-time simulation is not only the one of main researches for digital earth application techniques, but also the important problem to be resolved for geographical information system developing towards the 3D analysis phase. With the quantity of 3D scene data increasing and popularization of graphics processing unit specially designed for graph rendering, if not obviously decreasing the graph quantity and complex of 3D scene, the research that some effective data processing and graph rendering methods can be applied on general computers to speed up rendering and solve the conflict among the speed, quality and complex of massive data scene is becoming an important direction.
Supported by National Key Technologies R&D Program Olympic Games Dedicated Projects "Research of dynamic monitor for Beijing Olympic Green Environment" and the Chinese Academy of Sciences Knowledge Innovation Program Science and Technology for Olympic item - research of high-resolution remote sensing monitoring and 3D simulation for the Beijing Olympic area, the related theory and methods are discussed and applied in this dissertation including the automatic simplification for models in massive data 3D scene, the viewpoint relevant selective real-time refinement and optimally processing assisted by GPU. The design and development for internet release and web browsing of virtual Beijing Olympic Park system are accomplished. The functions such as the display of 3D scene, operating models and attribute information query are realized at last.
The main works and innovations of this dissertation are as follows:
a) The preprocessing module of automatic simplification for 3D models is accomplished. Based on the primary quadric error metric arithmetic, combined with boundary constrained condition and normal restriction, the primary arithmetic is modified and the application scope is extended. The new arithmetic can preserve the appearance of original model and decrease the quantity of triangles of models to build the level of detail for 3D scene, and keep down the file size to an appropriate one for internet release of 3D scene. From the point of 3D scene imaging, comparing to the primary arithmetic, the result obtained from the improved arithmetic can preserve higher similarity with original models and has better display quality.
b) The viewpoint relevant selective real-time refinement arithmetic is realized. The progressive mesh method is applied to effectively storage the mesh information and support the automatic building of multi LOD and smooth transition and the quick visualization effect can be obtained. In order to speed up the graph rendering, the viewpoint relevant selective mesh is implemented, which can obviously enhance the detail of target area and reduce the detail of some areas for less or no contribution to the ultimate imaging and effectively lessen the rendering burden of graph pipeline. The boundary piece concept is used to provide the theory base for the progressive mesh selective refinement scheme. All possible selective mesh sets are listed and visualized, which result in not introducing additional vertex split and edge collapse
引文
[1] 陈述彭，郭华东，“数字地球”与对地观测，地理学报，Vol．55，No．1，2000
[2] 承继成，林晖，周成虎等，数字地球导论，北京：科学出版社，2000，pp．9-10
[3] 鲍虎军，虚拟现实技术概述，中国丛础科学，No．03：26—32，2003
[4] 苏建明，张续红，胡庆夕，展望虚拟现实技术，计算机仿真，Vol．21，No．1：18-21，2004
[5] 孙立峰，钟力，李云浩，胡晓峰，虚拟实景空间的实时漫游，中国图像图形学报(A版)，Vol．4，No．6：507～513，1999
[6] 孙红梅，分布式虚拟场景实时绘制技术的研究与实现，博士论文，中国科学院计算技术研究所，2001
[7] 周昆，数字几何处理：理论与应用，博士论文，浙江大学，2002
[8] 何晖光，田捷，张晓鹏，赵明昌，李光明，网格模型化简综述，软件学报，Vol．13，No．12：2215-2224，2002
[9] 吴恩华，王文成，刘学慧，李胜，层次可见性与层次细节地表模型相结合的快速绘制，计算机学报，Vol．25，No．9，2002
[10] 王宏武，汪国平，董士海，一个与视点相关的动态多分辨率地形模型，计算机辅助设计与图形学学报，Vol．12，No．08：575-579，2000
[11] 周昆，潘志庚，石教英，多细节层次模型间的平滑过渡，计算机辅助设计与图形学学报，Vol．27，No．2：463-467，2000
[12] 潘志庚，张明敏，汪国兴，一种新的连续多分辨率模型自动生成算法，系统仿真学报，Vol．14，No．8：990-991，2002
[13] 潘志庚，周骥，石教英，赵友兵，一种大规模地形的快速漫游算法，计算机辅助设计与图形学学报，Vol．14，No．7：624-628，2002
[14] 李胜，大规模室外地形场景加速绘制技术研究，博士论文，中国科学院软件研究所，2004
[15] 刁常宇，鲁东明，面向internet的虚拟现实建模和渲染技术，中国图像图形学报(A版)，第8卷特刊，384～388，2003
[16] 王璐锦，唐泽圣，唐龙，基于三角形二叉树的地表模型动态简化算法，清华大学学报(自然科学版)，Vol．42，No．1：92-95，2002
[17] 邢伟，孙延奎，唐泽圣，与视点相关的多分辨率地表模型简化算法，清华大学学报(自然科??学版)，Vol．44，No．1：29-32，2004
[18] 许妙忠，李德仁，基于点删除的地形TIN连续LOD模型的建立和实时动态显示，武汉大学学报(信息科学版)，Vol．28，No．03：321-325，2003
[19] 余明，左小清，李清泉，一种基于TIN的视相关动态多分辨率地形模型，武汉大学学报(信息科学版)，Vol．29，No．12：1106-1110，2004
[20] 陈斌，董士海，方裕，一个输出恒定的三维地形多分辨率简化算法，高技术通讯，Vol．14，No．9：15-19，2004
[21] 李清泉，朱欣焰，龚健雅，陈静，海量地形数据的Web发布与交互浏览，武汉大学学报(信息科学版)，Vol．29，No．3：264-267，2004
[22] 谭兵，徐青，周杨，大区域地形可视化技术的研究，中国图象图形学报(A辑)，Vol．8，No．5：578-585，2003
[23] 谭兵，徐青，周杨，用约束四叉树实现地形的实时多分辨率绘制，计算机辅助设计与图形学学报，Vol．15，No．3：270-276，2003
[24] 周杨，姬渊，蓝朝桢，徐青，基于三角形折叠的连续多分辨率LOD算法，测绘学院学报，Vol．21，No．4：279-285，2004
[25] 马照亭，潘懋，胡金星，吴焕萍，王古刚，一种基于数据分块的海量地形快速漫游方法，北京大学学报(自然科学版)，Vol．40，No．4：619-625，2004
[26] 戴晨光，邓雪清，张永生，海量地形数据实时可视化算法，计算机辅助设计与图形学学报，Vol．16．No．11：1603-1607，2004
[27] 张立强，童小华，杨崇俊，刘冬林，Internet环境下海量地形数据发布和三维显示，同济大学学报(自然科学版)，Vol．32，No．12：1670-1676，2004
[28] 张立强，杨崇俊，多进制小波和二叉树实现大规模地形的实时漫游，计算机辅助设计与图形学学报，Vol．17，No．3：468-472，2005
[29] 吴恩华，图形处理器用于通用计算的技术、现状及其挑战，软件学报，Vol．15，No．10：1493-1504，2004
[30] 吴恩华，柳有权，基于图形处理器(GPU)的通用计算，计算机辅助设计与图形学学报，Vol．16，No．5：601-612，2004
[31] 胡金星，马照亭，吴焕萍，潘懋，基于格网划分的海量地形数据三维可视化，计算机辅助设计与图形学学报，Vol．16，No．8：1164-1168，2004
[32] 刘占平，王宏武，汪国平，董士海，面向数字地球的虚拟现实系统关键技术研究，中国图象??图形学报 (A辑) , Vol.7, No.2, 2002
[33] David P. Luebke. A Developer's Survey of Polygonal Simplification Algorithms. IEEE Computer Graphics and Applications, 21(3), 24-35,2001
[34] W. Schroeder, J. Zarge, and W. Lorenson. Decimation of Triangle Meshes. Computer Graphics (Proc. SIGGRAPH 92), ACM Press, New York, vol.26, 65-70, 1992
[35] J. Rossignac and P. Borrel. Multi-Resolution 3D Approximations for Rendering Complex Scenes. Geometric Modeling in Computer Graphics, Springer-Verlag, Berlin, 455-465,1993
[36] H. Hoppe. Progressive Meshes. Computer Graphics (Proc. SIGGRAPH 96), ACM Press, New York, vol. 30, 99-108, 1996
[37] H Hoppe, DeRose, Duchamp T, McDonald J, Stuetzle W. Mesh optimization. In: Proceedings of the Computer Graphics, Annual Conference Series, ACM Press, Anaheim, 19-26, 1993
[38] M. Garland, Y. Zhou. Quadric-based Simplification in any Dimension. ACM Transactions on Graphics, 24(2), 209-239,2005
[39] M. Garland, P. Heckbert. Simplifying Surfaces with Color and Texture using Quadric Error Metrics. Proc. IEEE Visualization 98, IEEE CS Press, Los Alamitos, Calif., 263-270,1998
[40] M. Garland, P. Heckbert. Simplification Using Quadric Error Metrics. Computer Graphics (Proc. SIGGRAPH 97), ACM Press, New York, vol. 30, 209-216, 1997
[41] D. Cohen-Or, YL Chrysanthou, CT Silva, and F. Durand. Survey of visibility for walkthrough applications. IEEE Trans. Vis. Comput. Graphics, vol.9(3), 412-431, 2003
[42] Lindstrom P. Out-of-Core simplification of large polygonal models. In: Proceedings of the Computer Graphics, Annual Conference Series, ACM Press, New Orleans, 259-262, 2000
[43] Low KL, Tan TS. Model simplification using vertex clustering. In: Proceedings of the 1997 Symposium on ACM Symposium on Interactive 3D Graphics, 75-81,1997
[44] M. Garland. Multiresolution Modeling: Survey&Future Opportunities Eurographics '99, State of the Art Report (STAR), 1999
[45] Gross MH, Staadt OG, Gatti R. Efficient triangular surface approximations using wavelets and quadtree data structures. IEEE Transactions on Visualization and Computer Graphics, 2(2), 130-144,1996
[46] J. Cohen, M. Olano, and D. Manocha. Appearance Preserving Simplification. In: Proceedings of the SIGGRAPH'98,115—122,1998
[47] P. Lindstrom, G Turk. Image-Driven Simplification. ACM Transactions on Graphics, 19(3), 204-241 ,2000
[48] Hoppe, H. New quadric metric for simplification meshes with appearance attributes. In: IEEE Visualization 1999, 59-66, 1999
[49] Lindstrom, P., Turk, G Fast and memory efficient polygonal simplification. In: Proceedings of the IEEE Visualixation'98, 279-284,1998
[50] Hamann, B. A data reduction scheme for triangulated surface. Computer Aided Geometric Design, 11(2), 197-214, 1994
[51] Lounsbery, M., DeRose, T. Multiresolution analysis for surfaces of arbitrary topological type. Technique Report, Washington: University of Washington, 1994
[52] Lounsbery, M., DeRose, T, Warren, J. Multiresolution analysis for surfaces of arbitrary topological type. ACM Transactions on Graphics, 16(1), 34-73, 1997
[53]Kun Zhou, Hujun Bao, Jiaoying Shi. 3D surface filtering using spherical harmonics.Computer-Aided Design,36, 363-375 , 2004
[54]Luebke, D. Hierarchical structures for dynamic polygonal simplification, Technical Report, TR96-006, Department of Computer Science, University of North Carolin at Chape Hill, 1996
[55] Peter Lindstrom, David Koller. Real-time Continuous level of detail rendering of height fields. In: Proceedings of the SIGGRAPH'96, 8, 109-118, 1996
[56] Mark Duchaineau. ROAMing Terrain: Real-time Optimally Adapting Meshes. In: Proceedings of the Conference on Visualization, 10, 81-88, 1997
[57]CEBTAIN, A., Popovic, J., Duchamp, T, Salesin, D., Stuetzle, W., Derose, T. Interactive multiresolution surface viewing. Computer Graphics (SIGGRAPH '96 Proceedings), 91-98, 1996
[58]Eck, M., Derose, T., Duchamp, T., Hoppe, H., Lounsbery, M., Stuetzle, W. Multiresolution analysis of arbitrary meshes. Computer Graphics (SIGGRAPH '95 Proceedings), 173-182, 1995
[59] Paul S. Heckbert and Michael Garland. Multiresolution modeling for fast rendering. In Proc. Graphics Interface '94, Banff, Canada, Canadian Inf. Proc. Soc, 43-50, 1994
[60] J. Xia, J. El-Sana, and A. Varshney. Adaptive real-time level of detail based rendering for polygonal models. IEEE Trans. on Visualization and Computer Graphics, 3(2), 171-183,1997
[61] Julie C. Xia and Amitabh Varshney. Dynamic view-dependent simplification for polygonal models. In Proc. Visualization'96, IEEE Comput, Soc. Press, 327-334,1996
[62] Hoppe, H. View-Dependent refinement of progressive meshes. In: Proceedings of the Computer Graphics, SIGGRAPH'97, 189-198 ,1997
[63] J. Kim and S. Lee. Truly selective refinement of progressive meshes. In: Proceedings of Graphics Interface 2001, Ottawa, Canada, 101-110, 2001
[64] Jihad El-Sana and Amitabh Varshney. Generalized viewdependent simplification. Computer Graphics Forum (Proceedings of Eurographics '99), 18(3), 83-94, 1999
[65] Tran Gieng, Bernd Hamann, Kenneth I. Joy, Greg L. Schussman, and Issac J. Trotts.Constructing hierarchies for triangle meshes. IEEE Trans. Visualization and Computer Graphics, 4(2), 145-161, 1998
[66] Igor Guskov, Wim Sweldens, and Peter Schroder. Multiresolution signal processing for meshes. ACM Computer Graphics (Proc. of SIGGRAPH '99), 325-334, 1999
[67] Hugues Hoppe. Smooth view-dependent level-of-detail control and its application to terrain rendering. In: Proceedings of Visulaization '98, IEEE Computer Society Press, 35-42, 1998
[68] Leif Kobbelt, Swen Campagna, Jens Vorsatz, and Hans Peter Seidel. Interactive multi-resolution modeling on arbitrary meshes. ACM Computer Graphics (Proc. of SIGGRAPH '98), 105-114, 1998
[69] Renato Pajarola and Jarek Rossignac. Compressed progressive meshes. IEEE Trans. on Visualization and Computer Graphics, 6(1), 79-93, 2000
[70] William J. Schroeder. A topology modifying progressive decimation algorithm. In: Proceedings of Visulaization '97, IEEE Computer Society Press, 205-212, 1997
[71] Denis Zorin, Peter Schr¨oder, and Wim Sweldens. Interactive multiresolution mesh editing. ACM Computer Graphics (Proc. of SIGGRAPH '97), 259-268, 1997
[72] J. Kim and S. Lee, Transitive mesh space of a progressive mesh. IEEE Trans. Visualization and Computer Graphics, 9(4), 463-480, 2003
[73] P.Heckbert and M.Garland, Survey of Polygonal Surface Simplification Algorithms, CMU-Technical Report 1997, Course Notes SIGGRAPH 1997.
[74] P. Lindstrom, GTurk. Evaluation of Memoryless Simplification. IEEE Transactions on Visualization and Computer Graphics, 5(2), 98-115, 1999
[75] M. Botsch, S. Steinberg, S. Bischo and L. Kobbelt. Openmesh-a generic and efficient polygon mesh data structure. In Proceedings of the OpenSG Symposium, 2002
[76] H. Hoppe. Efficient implementation of progressive meshes. Computers & Graphics, 22(1):27-36, 1998
[77] P. Lindstrom and V. Pascucci. Terrain simplication simplied: A general framework for view-dependent out-of-core visualization. IEEE Transactions on Visualization and Computer Graphics, 8(3):239-254, 2002
[78] D. Luebke and C. Erikson. View-dependent simplication of arbitrary polygonal environments. In ACM Computer Graphics Proceedings, Annual Conference Series, (SIGGRAPH '97), 199-207, 1997
[79] D. Luebke, M. Reddy, J. Cohen, A. Varshney, B. Watson, and R. Huebner. Level of Detail for 3D Graphics. Morgan-Kaufmann, Inc., 2003
[80] R. Pajarola. Fastmesh: Efficient view-dependent meshing. In: Proceedings Pacific Graphics 2001, IEEE Computer Society, 22-30, 2001
[81] Cignoni, P., Montani, C, Scopigno, R. A comparison of mesh simplification algorithms. Computers and Graphics, 22(1), 37-54, 1998
[82] Cignoni, P., Rocchini, C, Scopigno, R. Metro: Measuring error on simplified surfaces. Computer Graphics Forum, 17(2), 167-174 (1998)
[83] Puppo, E., Scopigno, R. Simplification, LOD and multiresolution— principles and applications. Eurographics '97 Tutorial Notes (1997)
[84] Surazhsky, V, Gotsman, C. Explicit surface remeshing. In: Proceedings of Eurographics Symposium on Geometry Processing, 17-28, 2003
[85] Ciampalini, A., P. Cignoni, C. Montani, and R. Scopigno. Multiresolution decimation based on global error The Visual Computer, 13 (5), 228-246, 1997
[86] Lindstrom, P and V Pascucci. Visualization of Large Terrains Made Easy. In: Proceedings of Visualization 2001, 363-370 and 574, 2001
[87] Lindstrom, Peter. Out-of-Core Construction and Visualization of Multiresolution Surfaces. In: Proceedings of 2003 Symposium on Interactive 3D Graphics, 93-102, 2003
[88] Isenburg, M., P. Lindstrom, S. Gumhold, and J. Snoeyink. Large Mesh Simplification using Processing Sequences, IEEE Visualization 2003, 465-472, 2003
[89] BAR-YEHUDA, R., AND GOTSMAN, C. Time/space tradeoffs for polygon mesh rendering. ACM Transactions on Graphics, 15(2), 141- 152, 1996[90] Bogomjakov, A., Gotsman, C. Universal rendering sequences for transparent vertex caching of progressive meshes. In: Graphics Interface'01 Proceedings, 81-90, 2001
[91] Brodsky, D., Watson, B. Model simplification through refinement. In: Graphics Interface'00 Proceedings, 221-228, 2000
[92] Choudhury, P., Watson, B. Completely adaptive simplification of massive meshes. Tech. Rep. CS-02-09, Northwestern University, 2002
[93] Garland, M., Shaffer, E. A multiphase approach to efficient surface simplification. In: Visualization'02 Proceedings, 117-124, 2002
[94] Levoy, M., Pulli, K., Curless, B., Rusinkiewicz, S., Koller, D., Pereira, L., Ginzton, M., Anderson, S., Davis, J., Ginsberg, J., Shade, J., Fulf, D. The Digital Michelangelo Project.ln SIGGRAPH 2000 Proceedings, 131-144, 2000
[95] Lindstrom, P., Silva, C. A memory insensitive technique for large model simplification. In Visualization'01 Proceedings, 121-126,2001
[96] Shaffer, E., Garland, M. 2001. Efficient adaptive simplification of massive meshes. In Visualization'01 Proceedings, 127-134
[97] Silva, C, Chiang, Y., EL-Sana, J., Lindstrom, P. Out-of-core algorithms for scientific visualization and computer graphics. InVisualization'02 Course Notes, 2002
[98] S. Zelinka and M. Garland. Permission grids: practical, error-bounded simplification. ACM Transactions on Graphics, 21(2):207--229, 2002
[99] Amenta, N., Bern, M., Kamvysselis, M. A new Voronoi-based surface reconstruction algorithm.In: Proceedings of SIGGRAPH 98, 415-422, 1998
[100] Bajaj, C. Schikore, D. Error-bounded reduction of triangle meshes with multivariate data.SPIE 2656, 34-45, 1996
[101] Cohen, J.,Manocha, D., Olano, M. Simplifying polygonal models using successive mappings.In: Proceedings IEEE Visualization '97, 395-402, 1997
[102] EL-Sana, J. Varshney, A. Controlled simplification of genus for polygonal models. In: IEEE Visualization 97 Conference Proceedings. 403-410, 1997
[103] He, T., Hong, L., Varshney, A., Wang, S. Controlled topology simplification. IEEE Transactions on Visualization and Computer Graphics, 2(2), 171-184, 1996
[104] Isenburg, M., Lindstrom, P. Streaming meshes. Tech. Rep. UCRLCONF-201992, LLNL,2004
[105] Isenburg, M. and P. Lindstrom. Streaming Meshes. IEEE Visualization 2005, 231-238, 2005
[106] F. Bernardini, 1. Martin, J. Mittleman, H. Rushmeier, and G Taubin.Building a Digital Model of Michelangelo's Florentine Pieta. IEEE Computer Graphics and Applications, 22(1):59-67,2002
[107] P. Cignoni, C. Montani, C. Rocchini, and R. Scopigno. External Memory Management and Simplification of Huge Meshes. IEEE Transactions on Visualization and Computer Graphics, 9(4):525-537, 2003
[108] J. D(?)az, J. Petit, and M. Serna. A Survey of Graph Layout Problems. ACM Computing Surveys, 34(3):313-356, 2002
[109] J. Ho, K. Lee, and D. Kriegman. Compressing Large Polygonal Models.Visualization '01, 357-362,2001
[110] M. Isenburg and S. Gumhold. Out-of-Core Compression for Gigantic Polygon Meshes. SIGGRAPH 2003, 935-942,2003
[111] M. Isenburg, P. Lindstrom, and J. Snoeyink. Streaming Compression of Triangle Meshes. Tech. Rep. UCRL-TR-210481, LLNL, 2005
[112] Y. Koren, L. Carmel, and D. Harel. ACE: A Fast Multiscale Eigenvector Computation for Drawing Huge Graphs. IEEE Information Visualization'02, 137-144,2002
[113] J. Wu and L. Kobbelt. A Stream Algorithm for the Decimation of Massive Meshes. Graphics Interface '03, 185-192,2003
[114] Yoon, S.-E., P. Lindstrom, V. Pascucci, and D. Manocha. Cache-Oblivious Mesh Layouts. ACM Transactions on Graphics, Proceedings of SIGGRAPH 2005, 886-893, 2005
[115] Bartholdi, J., Goldsman, P. Multiresolution indexing of triangulated irregular networks. In: IEEE Transaction on Visualization and Computer Graphics,484-495, 2004
[116] Corr.E A, W. T, Klosowski, J. T, Silva, C. T. Visibility-based prefetching for interactive out-of-core rendering. In: Proceedings of PVG 2003 (6th IEEE Symposium on Parallel and Large-Data Visualization and Graphics), 1-8,2003
[117] Frigo, M., Leiserson, C, Prokop, H., Ramachandran, S. Cache oblivious algorithms. Symposium on Foundations of Computer Science, 285-297, 1999
[118] Gopi, M., Eppstein, D. Single-strip triangulation of manifolds with arbitrary topology. In EUROGRAPHICS, 371-379, 2004
[119] Gottschalk, S., Lin, M., Manocha, D. OBB-Tree: A hierarchical structure for rapid interference detection. In: Proceedings of ACM Siggraph'96, 171-180, 1996
[120] Hoppe, H. Optimization of mesh locality for transparent vertex caching. In: Proceedings of ACM SIGGRAPH, 269-276,1999
[121] Sen, S., Chatterjee, S., Dumir, N. Towards a theory of cache-efficient algorithms. Journal of the ACM 49, 828-858, 2002
[122] Velho, L., Gomes, J. D. Digital halftoning with space_lling curves. In: Computer Graphics (SIGGRAPH '91 Proceedings), T. W. Sederberg, Ed., 25, 81-90, 1991
[123] Vitter, J. External memory algorithms and data structures: Dealing with massive data. ACM Computing Surveys, 209-271, 2001
[124] Yoon, S.-E., Manocha, D. Cache-Oblivious Layouts of Bounding Volume Hierarchies. Tech. rep., University of North Carolina-Chapel Hill, 2005
[125] Yoon, S.-E., Salomom, B., Gayle, R., Mannocha, D. Quick-VDR: Interactive View-dependent Rendering of Massive Models. IEEE Visualization, 131-138, 2004
[126] Junho Kim, Seungyong Lee, and Leif Kobbelt. View-dependent mesh streaming with minimal latency. International Journal of Shape Modeling, 11(1), 63-89, 2005
[127] P. Alliez and M. Desbrun. Progressive encoding for lossless transmission of 3D meshes. ACM Computer Graphics (Proc. SIGGRAPH 2001), pages 198 - 205, 2001
[128] T. K. Dey, H. Edelsbrunner, S. Guha, and D. V. Nekhayev. Topology preserving edge contraction. Technical Report rgi-tech-98-018, Raindrop Geomagic, 1998
[129] L. D. Floriani, P. Magillo, F. Morando, and E. Puppo. Dynamic view-dependent multiresolution on a client-server architecture. Computer-Aided Design, 32(13):805 - 823, 2000
[130] I. Guskov and Z. J. Wood. Topological noise removal. In: Proceedings Graphics Interface 2001, 19-26,2001
[131] A. Khodakovsky, P. Schr "" oder, and W. Sweldens. Progressive geometry compression.ACM Computer Graphics (Proc. SIGGRAPH 2000), 271 - 278,2000
[132] U. Labsik, L. Kobbelt, R. Schneider, and H.-P. Seidel. Progressive transmission of subdivision surfaces. Computational Geometry Journal: Theory and Applications, 15(13):25 - 39,2000
[133] S. Rusinkiewicz and M. Levoy. Streaming QSplat: A viewer for networked visualization of large, dense models. In Proc. 2001 ACM Symposium on Interactive 3D Graphics, 63 - 68, 2001
[134] D. S. P. To, R. W. H. Lau, and M. Green. A method for progressive and selective transmission of multi-resolution models. In: Proceedings of ACM Symposium on Virtual Reality Software and Technology, 88 - 95,1999
[135] S. Yang, C.-S. Kim and C.-C. J. Kuo. A progressive view-dependent technique for interactive 3d mesh transmission. IEEE Trans. Circuits and Systems for Video Technology, 14(11):1249- 1264,2000
[136] El-Sana, J., Azanli, E., Varshney, A., Skip Strips: Maintaining triangle strips for viewdependent rendering. In Visualization '99 Proceedings, IEEE, 131-138, 1999
[137] Evans, F., Skiena, S. S., Varshney, A. Optimizing triangle strips for fast rendering. In Visualization'96 Proceedings, 319-326, 1996
[138] Karypis, G, and Kumar, V, METIS - a software package for partitioning unstructured graphs, partitioning meshes, and computing fill-reducing orderings of sparse matrices. Version 4, University of Minnesota. Available on WWW at URL http://glaros.dtc.umn.edu/gkhome/views/metis
[139] Mitra, T. and Chiueh, T., A breadth-first approach to efficient mesh traversal. In Proceedings of the 13th ACM SIGGRAPH/Eurographics Workshop on Graphics Hardware, 31—38, 1998
[140] U. Adamy, J. Giesen, and M. John. New techniques for topologically correct surface reconstrucion. In Proc. 11th IEEE Visualization Conference (VIS), 373-380,2000
[141] P. Alliez, D. Cohen-Steiner, O. Devillers, B. Levy, and M. Desbrun. Anisotropic polygonal remeshing. In: SIGGRAPH proceedings, 485-493, 2003
[142] P. Alliez, M. Meyer, and M. Desbrun. Interactive geometry remeshing. In SIGGRAPH proceedings, 347-354, 2002
[143] S. Campagna, L. Kobbelt, and H.-P. Seidel. Directed edges-A scalable representation for triangle meshes. Journal of Graphics Tools: JGT, 3(4): 1-12, 1998
[144] N. Dyn. Subdivision schemes in computer aided geometric design. In Advances in Numerical Analysis II, Wavelets, Subdivision and Radial Functions, 36-104, 1991
[145] N. Dyn, K. Hormann, S.-J. Kim and D. Levin. Optimizing 3d triangulations using discrete curvature analysis. In Innovations in Applied Mathematics. Vanderbilt University Press, 2001
[146] M. S. Floater. Parametrization and smooth approximation of surface triangulations. Comp. Aided Geom.Design, 14:231-250, 1997
[147] X. Gu, S. Gortler, and H. Hoppe. Geometry images. In SIGGRAPH Proceedings, 355-361,2002
[148] M. Isenburg and M. Snoeyink. Face fixer: Compressing polygon meshes with properties. In SIGGRAPH proceedings, 263-270, 2002
[149] A. W. F. Lee, W. Sweldens, P. Schr oder, L. Cowsar, and D. Dobkin. Maps: Multiresolution adaptive parameterization of surfaces. In SIGGRAPH 98 Proceedings, 95-104, 1998
[150] B. Levy, S. Petitjean, N. Ray, and J. Maillot. Least squares conformal maps for automatic texture atlas generation. In Siggraph 2002 Proceedings, 362-371, 2002
[151] Junfeng Ji, Enhua Wu, Sheng Li, and Xuehui Liu. Dynamic LOD on GPU. In Proceedings of Computer Graphics International 2005, 108-114 ,2005
[152] P. Sander, J. Snyder, S. Gortler, and H. Hoppe. Texture mapping progressive meshes. In SIGGRAPH 2001 proceedings, pages 409-416, 2001
[153] J. Bolz, I. Fanner, E. Grinspun, and P. Schroder. Sparse matrix solvers on the GPU: Conjugate gradients and multigrid. In Proceedings of SIGGRAPH 2003, 917-924, 2003
[154] Goodnight N, Woolley C, Luebke D, Humphreys G A multigrid solver for boundary value problems using programmable graphics hardware. In: Proc. of the Graphics Hardware 2003, 102-111,2003
[155] Kruger J, Westermann R. Linear algebra operators for GPU implementation of numerical algorithms. ACM Trans. on Graphics, 22(3):908~916, 2003
[156] Nabil Mustafa, Eleftheris Koutsofios, Shankar Krishnan, Suresh Venkatasubramanian. Heckbert. Hardware-Assisted View-Dependent Planar Map Simplification. In: Annual ACM Symposium on Computational Geometry.2001 .http://. www.research.att.com/areas/visualization/ papers_videos/papers/2001 mkkv.pdf
[2] 承继成，林晖，周成虎等，数字地球导论，北京：科学出版社，2000，pp．9-10
[3] 鲍虎军，虚拟现实技术概述，中国丛础科学，No．03：26—32，2003
[4] 苏建明，张续红，胡庆夕，展望虚拟现实技术，计算机仿真，Vol．21，No．1：18-21，2004
[5] 孙立峰，钟力，李云浩，胡晓峰，虚拟实景空间的实时漫游，中国图像图形学报(A版)，Vol．4，No．6：507～513，1999
[6] 孙红梅，分布式虚拟场景实时绘制技术的研究与实现，博士论文，中国科学院计算技术研究所，2001
[7] 周昆，数字几何处理：理论与应用，博士论文，浙江大学，2002
[8] 何晖光，田捷，张晓鹏，赵明昌，李光明，网格模型化简综述，软件学报，Vol．13，No．12：2215-2224，2002
[9] 吴恩华，王文成，刘学慧，李胜，层次可见性与层次细节地表模型相结合的快速绘制，计算机学报，Vol．25，No．9，2002
[10] 王宏武，汪国平，董士海，一个与视点相关的动态多分辨率地形模型，计算机辅助设计与图形学学报，Vol．12，No．08：575-579，2000
[11] 周昆，潘志庚，石教英，多细节层次模型间的平滑过渡，计算机辅助设计与图形学学报，Vol．27，No．2：463-467，2000
[12] 潘志庚，张明敏，汪国兴，一种新的连续多分辨率模型自动生成算法，系统仿真学报，Vol．14，No．8：990-991，2002
[13] 潘志庚，周骥，石教英，赵友兵，一种大规模地形的快速漫游算法，计算机辅助设计与图形学学报，Vol．14，No．7：624-628，2002
[14] 李胜，大规模室外地形场景加速绘制技术研究，博士论文，中国科学院软件研究所，2004
[15] 刁常宇，鲁东明，面向internet的虚拟现实建模和渲染技术，中国图像图形学报(A版)，第8卷特刊，384～388，2003
[16] 王璐锦，唐泽圣，唐龙，基于三角形二叉树的地表模型动态简化算法，清华大学学报(自然科学版)，Vol．42，No．1：92-95，2002
[17] 邢伟，孙延奎，唐泽圣，与视点相关的多分辨率地表模型简化算法，清华大学学报(自然科??学版)，Vol．44，No．1：29-32，2004
[18] 许妙忠，李德仁，基于点删除的地形TIN连续LOD模型的建立和实时动态显示，武汉大学学报(信息科学版)，Vol．28，No．03：321-325，2003
[19] 余明，左小清，李清泉，一种基于TIN的视相关动态多分辨率地形模型，武汉大学学报(信息科学版)，Vol．29，No．12：1106-1110，2004
[20] 陈斌，董士海，方裕，一个输出恒定的三维地形多分辨率简化算法，高技术通讯，Vol．14，No．9：15-19，2004
[21] 李清泉，朱欣焰，龚健雅，陈静，海量地形数据的Web发布与交互浏览，武汉大学学报(信息科学版)，Vol．29，No．3：264-267，2004
[22] 谭兵，徐青，周杨，大区域地形可视化技术的研究，中国图象图形学报(A辑)，Vol．8，No．5：578-585，2003
[23] 谭兵，徐青，周杨，用约束四叉树实现地形的实时多分辨率绘制，计算机辅助设计与图形学学报，Vol．15，No．3：270-276，2003
[24] 周杨，姬渊，蓝朝桢，徐青，基于三角形折叠的连续多分辨率LOD算法，测绘学院学报，Vol．21，No．4：279-285，2004
[25] 马照亭，潘懋，胡金星，吴焕萍，王古刚，一种基于数据分块的海量地形快速漫游方法，北京大学学报(自然科学版)，Vol．40，No．4：619-625，2004
[26] 戴晨光，邓雪清，张永生，海量地形数据实时可视化算法，计算机辅助设计与图形学学报，Vol．16．No．11：1603-1607，2004
[27] 张立强，童小华，杨崇俊，刘冬林，Internet环境下海量地形数据发布和三维显示，同济大学学报(自然科学版)，Vol．32，No．12：1670-1676，2004
[28] 张立强，杨崇俊，多进制小波和二叉树实现大规模地形的实时漫游，计算机辅助设计与图形学学报，Vol．17，No．3：468-472，2005
[29] 吴恩华，图形处理器用于通用计算的技术、现状及其挑战，软件学报，Vol．15，No．10：1493-1504，2004
[30] 吴恩华，柳有权，基于图形处理器(GPU)的通用计算，计算机辅助设计与图形学学报，Vol．16，No．5：601-612，2004
[31] 胡金星，马照亭，吴焕萍，潘懋，基于格网划分的海量地形数据三维可视化，计算机辅助设计与图形学学报，Vol．16，No．8：1164-1168，2004
[32] 刘占平，王宏武，汪国平，董士海，面向数字地球的虚拟现实系统关键技术研究，中国图象??图形学报 (A辑) , Vol.7, No.2, 2002
[33] David P. Luebke. A Developer's Survey of Polygonal Simplification Algorithms. IEEE Computer Graphics and Applications, 21(3), 24-35,2001
[34] W. Schroeder, J. Zarge, and W. Lorenson. Decimation of Triangle Meshes. Computer Graphics (Proc. SIGGRAPH 92), ACM Press, New York, vol.26, 65-70, 1992
[35] J. Rossignac and P. Borrel. Multi-Resolution 3D Approximations for Rendering Complex Scenes. Geometric Modeling in Computer Graphics, Springer-Verlag, Berlin, 455-465,1993
[36] H. Hoppe. Progressive Meshes. Computer Graphics (Proc. SIGGRAPH 96), ACM Press, New York, vol. 30, 99-108, 1996
[37] H Hoppe, DeRose, Duchamp T, McDonald J, Stuetzle W. Mesh optimization. In: Proceedings of the Computer Graphics, Annual Conference Series, ACM Press, Anaheim, 19-26, 1993
[38] M. Garland, Y. Zhou. Quadric-based Simplification in any Dimension. ACM Transactions on Graphics, 24(2), 209-239,2005
[39] M. Garland, P. Heckbert. Simplifying Surfaces with Color and Texture using Quadric Error Metrics. Proc. IEEE Visualization 98, IEEE CS Press, Los Alamitos, Calif., 263-270,1998
[40] M. Garland, P. Heckbert. Simplification Using Quadric Error Metrics. Computer Graphics (Proc. SIGGRAPH 97), ACM Press, New York, vol. 30, 209-216, 1997
[41] D. Cohen-Or, YL Chrysanthou, CT Silva, and F. Durand. Survey of visibility for walkthrough applications. IEEE Trans. Vis. Comput. Graphics, vol.9(3), 412-431, 2003
[42] Lindstrom P. Out-of-Core simplification of large polygonal models. In: Proceedings of the Computer Graphics, Annual Conference Series, ACM Press, New Orleans, 259-262, 2000
[43] Low KL, Tan TS. Model simplification using vertex clustering. In: Proceedings of the 1997 Symposium on ACM Symposium on Interactive 3D Graphics, 75-81,1997
[44] M. Garland. Multiresolution Modeling: Survey&Future Opportunities Eurographics '99, State of the Art Report (STAR), 1999
[45] Gross MH, Staadt OG, Gatti R. Efficient triangular surface approximations using wavelets and quadtree data structures. IEEE Transactions on Visualization and Computer Graphics, 2(2), 130-144,1996
[46] J. Cohen, M. Olano, and D. Manocha. Appearance Preserving Simplification. In: Proceedings of the SIGGRAPH'98,115—122,1998
[47] P. Lindstrom, G Turk. Image-Driven Simplification. ACM Transactions on Graphics, 19(3), 204-241 ,2000
[48] Hoppe, H. New quadric metric for simplification meshes with appearance attributes. In: IEEE Visualization 1999, 59-66, 1999
[49] Lindstrom, P., Turk, G Fast and memory efficient polygonal simplification. In: Proceedings of the IEEE Visualixation'98, 279-284,1998
[50] Hamann, B. A data reduction scheme for triangulated surface. Computer Aided Geometric Design, 11(2), 197-214, 1994
[51] Lounsbery, M., DeRose, T. Multiresolution analysis for surfaces of arbitrary topological type. Technique Report, Washington: University of Washington, 1994
[52] Lounsbery, M., DeRose, T, Warren, J. Multiresolution analysis for surfaces of arbitrary topological type. ACM Transactions on Graphics, 16(1), 34-73, 1997
[53]Kun Zhou, Hujun Bao, Jiaoying Shi. 3D surface filtering using spherical harmonics.Computer-Aided Design,36, 363-375 , 2004
[54]Luebke, D. Hierarchical structures for dynamic polygonal simplification, Technical Report, TR96-006, Department of Computer Science, University of North Carolin at Chape Hill, 1996
[55] Peter Lindstrom, David Koller. Real-time Continuous level of detail rendering of height fields. In: Proceedings of the SIGGRAPH'96, 8, 109-118, 1996
[56] Mark Duchaineau. ROAMing Terrain: Real-time Optimally Adapting Meshes. In: Proceedings of the Conference on Visualization, 10, 81-88, 1997
[57]CEBTAIN, A., Popovic, J., Duchamp, T, Salesin, D., Stuetzle, W., Derose, T. Interactive multiresolution surface viewing. Computer Graphics (SIGGRAPH '96 Proceedings), 91-98, 1996
[58]Eck, M., Derose, T., Duchamp, T., Hoppe, H., Lounsbery, M., Stuetzle, W. Multiresolution analysis of arbitrary meshes. Computer Graphics (SIGGRAPH '95 Proceedings), 173-182, 1995
[59] Paul S. Heckbert and Michael Garland. Multiresolution modeling for fast rendering. In Proc. Graphics Interface '94, Banff, Canada, Canadian Inf. Proc. Soc, 43-50, 1994
[60] J. Xia, J. El-Sana, and A. Varshney. Adaptive real-time level of detail based rendering for polygonal models. IEEE Trans. on Visualization and Computer Graphics, 3(2), 171-183,1997
[61] Julie C. Xia and Amitabh Varshney. Dynamic view-dependent simplification for polygonal models. In Proc. Visualization'96, IEEE Comput, Soc. Press, 327-334,1996
[62] Hoppe, H. View-Dependent refinement of progressive meshes. In: Proceedings of the Computer Graphics, SIGGRAPH'97, 189-198 ,1997
[63] J. Kim and S. Lee. Truly selective refinement of progressive meshes. In: Proceedings of Graphics Interface 2001, Ottawa, Canada, 101-110, 2001
[64] Jihad El-Sana and Amitabh Varshney. Generalized viewdependent simplification. Computer Graphics Forum (Proceedings of Eurographics '99), 18(3), 83-94, 1999
[65] Tran Gieng, Bernd Hamann, Kenneth I. Joy, Greg L. Schussman, and Issac J. Trotts.Constructing hierarchies for triangle meshes. IEEE Trans. Visualization and Computer Graphics, 4(2), 145-161, 1998
[66] Igor Guskov, Wim Sweldens, and Peter Schroder. Multiresolution signal processing for meshes. ACM Computer Graphics (Proc. of SIGGRAPH '99), 325-334, 1999
[67] Hugues Hoppe. Smooth view-dependent level-of-detail control and its application to terrain rendering. In: Proceedings of Visulaization '98, IEEE Computer Society Press, 35-42, 1998
[68] Leif Kobbelt, Swen Campagna, Jens Vorsatz, and Hans Peter Seidel. Interactive multi-resolution modeling on arbitrary meshes. ACM Computer Graphics (Proc. of SIGGRAPH '98), 105-114, 1998
[69] Renato Pajarola and Jarek Rossignac. Compressed progressive meshes. IEEE Trans. on Visualization and Computer Graphics, 6(1), 79-93, 2000
[70] William J. Schroeder. A topology modifying progressive decimation algorithm. In: Proceedings of Visulaization '97, IEEE Computer Society Press, 205-212, 1997
[71] Denis Zorin, Peter Schr¨oder, and Wim Sweldens. Interactive multiresolution mesh editing. ACM Computer Graphics (Proc. of SIGGRAPH '97), 259-268, 1997
[72] J. Kim and S. Lee, Transitive mesh space of a progressive mesh. IEEE Trans. Visualization and Computer Graphics, 9(4), 463-480, 2003
[73] P.Heckbert and M.Garland, Survey of Polygonal Surface Simplification Algorithms, CMU-Technical Report 1997, Course Notes SIGGRAPH 1997.
[74] P. Lindstrom, GTurk. Evaluation of Memoryless Simplification. IEEE Transactions on Visualization and Computer Graphics, 5(2), 98-115, 1999
[75] M. Botsch, S. Steinberg, S. Bischo and L. Kobbelt. Openmesh-a generic and efficient polygon mesh data structure. In Proceedings of the OpenSG Symposium, 2002
[76] H. Hoppe. Efficient implementation of progressive meshes. Computers & Graphics, 22(1):27-36, 1998
[77] P. Lindstrom and V. Pascucci. Terrain simplication simplied: A general framework for view-dependent out-of-core visualization. IEEE Transactions on Visualization and Computer Graphics, 8(3):239-254, 2002
[78] D. Luebke and C. Erikson. View-dependent simplication of arbitrary polygonal environments. In ACM Computer Graphics Proceedings, Annual Conference Series, (SIGGRAPH '97), 199-207, 1997
[79] D. Luebke, M. Reddy, J. Cohen, A. Varshney, B. Watson, and R. Huebner. Level of Detail for 3D Graphics. Morgan-Kaufmann, Inc., 2003
[80] R. Pajarola. Fastmesh: Efficient view-dependent meshing. In: Proceedings Pacific Graphics 2001, IEEE Computer Society, 22-30, 2001
[81] Cignoni, P., Montani, C, Scopigno, R. A comparison of mesh simplification algorithms. Computers and Graphics, 22(1), 37-54, 1998
[82] Cignoni, P., Rocchini, C, Scopigno, R. Metro: Measuring error on simplified surfaces. Computer Graphics Forum, 17(2), 167-174 (1998)
[83] Puppo, E., Scopigno, R. Simplification, LOD and multiresolution— principles and applications. Eurographics '97 Tutorial Notes (1997)
[84] Surazhsky, V, Gotsman, C. Explicit surface remeshing. In: Proceedings of Eurographics Symposium on Geometry Processing, 17-28, 2003
[85] Ciampalini, A., P. Cignoni, C. Montani, and R. Scopigno. Multiresolution decimation based on global error The Visual Computer, 13 (5), 228-246, 1997
[86] Lindstrom, P and V Pascucci. Visualization of Large Terrains Made Easy. In: Proceedings of Visualization 2001, 363-370 and 574, 2001
[87] Lindstrom, Peter. Out-of-Core Construction and Visualization of Multiresolution Surfaces. In: Proceedings of 2003 Symposium on Interactive 3D Graphics, 93-102, 2003
[88] Isenburg, M., P. Lindstrom, S. Gumhold, and J. Snoeyink. Large Mesh Simplification using Processing Sequences, IEEE Visualization 2003, 465-472, 2003
[89] BAR-YEHUDA, R., AND GOTSMAN, C. Time/space tradeoffs for polygon mesh rendering. ACM Transactions on Graphics, 15(2), 141- 152, 1996[90] Bogomjakov, A., Gotsman, C. Universal rendering sequences for transparent vertex caching of progressive meshes. In: Graphics Interface'01 Proceedings, 81-90, 2001
[91] Brodsky, D., Watson, B. Model simplification through refinement. In: Graphics Interface'00 Proceedings, 221-228, 2000
[92] Choudhury, P., Watson, B. Completely adaptive simplification of massive meshes. Tech. Rep. CS-02-09, Northwestern University, 2002
[93] Garland, M., Shaffer, E. A multiphase approach to efficient surface simplification. In: Visualization'02 Proceedings, 117-124, 2002
[94] Levoy, M., Pulli, K., Curless, B., Rusinkiewicz, S., Koller, D., Pereira, L., Ginzton, M., Anderson, S., Davis, J., Ginsberg, J., Shade, J., Fulf, D. The Digital Michelangelo Project.ln SIGGRAPH 2000 Proceedings, 131-144, 2000
[95] Lindstrom, P., Silva, C. A memory insensitive technique for large model simplification. In Visualization'01 Proceedings, 121-126,2001
[96] Shaffer, E., Garland, M. 2001. Efficient adaptive simplification of massive meshes. In Visualization'01 Proceedings, 127-134
[97] Silva, C, Chiang, Y., EL-Sana, J., Lindstrom, P. Out-of-core algorithms for scientific visualization and computer graphics. InVisualization'02 Course Notes, 2002
[98] S. Zelinka and M. Garland. Permission grids: practical, error-bounded simplification. ACM Transactions on Graphics, 21(2):207--229, 2002
[99] Amenta, N., Bern, M., Kamvysselis, M. A new Voronoi-based surface reconstruction algorithm.In: Proceedings of SIGGRAPH 98, 415-422, 1998
[100] Bajaj, C. Schikore, D. Error-bounded reduction of triangle meshes with multivariate data.SPIE 2656, 34-45, 1996
[101] Cohen, J.,Manocha, D., Olano, M. Simplifying polygonal models using successive mappings.In: Proceedings IEEE Visualization '97, 395-402, 1997
[102] EL-Sana, J. Varshney, A. Controlled simplification of genus for polygonal models. In: IEEE Visualization 97 Conference Proceedings. 403-410, 1997
[103] He, T., Hong, L., Varshney, A., Wang, S. Controlled topology simplification. IEEE Transactions on Visualization and Computer Graphics, 2(2), 171-184, 1996
[104] Isenburg, M., Lindstrom, P. Streaming meshes. Tech. Rep. UCRLCONF-201992, LLNL,2004
[105] Isenburg, M. and P. Lindstrom. Streaming Meshes. IEEE Visualization 2005, 231-238, 2005
[106] F. Bernardini, 1. Martin, J. Mittleman, H. Rushmeier, and G Taubin.Building a Digital Model of Michelangelo's Florentine Pieta. IEEE Computer Graphics and Applications, 22(1):59-67,2002
[107] P. Cignoni, C. Montani, C. Rocchini, and R. Scopigno. External Memory Management and Simplification of Huge Meshes. IEEE Transactions on Visualization and Computer Graphics, 9(4):525-537, 2003
[108] J. D(?)az, J. Petit, and M. Serna. A Survey of Graph Layout Problems. ACM Computing Surveys, 34(3):313-356, 2002
[109] J. Ho, K. Lee, and D. Kriegman. Compressing Large Polygonal Models.Visualization '01, 357-362,2001
[110] M. Isenburg and S. Gumhold. Out-of-Core Compression for Gigantic Polygon Meshes. SIGGRAPH 2003, 935-942,2003
[111] M. Isenburg, P. Lindstrom, and J. Snoeyink. Streaming Compression of Triangle Meshes. Tech. Rep. UCRL-TR-210481, LLNL, 2005
[112] Y. Koren, L. Carmel, and D. Harel. ACE: A Fast Multiscale Eigenvector Computation for Drawing Huge Graphs. IEEE Information Visualization'02, 137-144,2002
[113] J. Wu and L. Kobbelt. A Stream Algorithm for the Decimation of Massive Meshes. Graphics Interface '03, 185-192,2003
[114] Yoon, S.-E., P. Lindstrom, V. Pascucci, and D. Manocha. Cache-Oblivious Mesh Layouts. ACM Transactions on Graphics, Proceedings of SIGGRAPH 2005, 886-893, 2005
[115] Bartholdi, J., Goldsman, P. Multiresolution indexing of triangulated irregular networks. In: IEEE Transaction on Visualization and Computer Graphics,484-495, 2004
[116] Corr.E A, W. T, Klosowski, J. T, Silva, C. T. Visibility-based prefetching for interactive out-of-core rendering. In: Proceedings of PVG 2003 (6th IEEE Symposium on Parallel and Large-Data Visualization and Graphics), 1-8,2003
[117] Frigo, M., Leiserson, C, Prokop, H., Ramachandran, S. Cache oblivious algorithms. Symposium on Foundations of Computer Science, 285-297, 1999
[118] Gopi, M., Eppstein, D. Single-strip triangulation of manifolds with arbitrary topology. In EUROGRAPHICS, 371-379, 2004
[119] Gottschalk, S., Lin, M., Manocha, D. OBB-Tree: A hierarchical structure for rapid interference detection. In: Proceedings of ACM Siggraph'96, 171-180, 1996
[120] Hoppe, H. Optimization of mesh locality for transparent vertex caching. In: Proceedings of ACM SIGGRAPH, 269-276,1999
[121] Sen, S., Chatterjee, S., Dumir, N. Towards a theory of cache-efficient algorithms. Journal of the ACM 49, 828-858, 2002
[122] Velho, L., Gomes, J. D. Digital halftoning with space_lling curves. In: Computer Graphics (SIGGRAPH '91 Proceedings), T. W. Sederberg, Ed., 25, 81-90, 1991
[123] Vitter, J. External memory algorithms and data structures: Dealing with massive data. ACM Computing Surveys, 209-271, 2001
[124] Yoon, S.-E., Manocha, D. Cache-Oblivious Layouts of Bounding Volume Hierarchies. Tech. rep., University of North Carolina-Chapel Hill, 2005
[125] Yoon, S.-E., Salomom, B., Gayle, R., Mannocha, D. Quick-VDR: Interactive View-dependent Rendering of Massive Models. IEEE Visualization, 131-138, 2004
[126] Junho Kim, Seungyong Lee, and Leif Kobbelt. View-dependent mesh streaming with minimal latency. International Journal of Shape Modeling, 11(1), 63-89, 2005
[127] P. Alliez and M. Desbrun. Progressive encoding for lossless transmission of 3D meshes. ACM Computer Graphics (Proc. SIGGRAPH 2001), pages 198 - 205, 2001
[128] T. K. Dey, H. Edelsbrunner, S. Guha, and D. V. Nekhayev. Topology preserving edge contraction. Technical Report rgi-tech-98-018, Raindrop Geomagic, 1998
[129] L. D. Floriani, P. Magillo, F. Morando, and E. Puppo. Dynamic view-dependent multiresolution on a client-server architecture. Computer-Aided Design, 32(13):805 - 823, 2000
[130] I. Guskov and Z. J. Wood. Topological noise removal. In: Proceedings Graphics Interface 2001, 19-26,2001
[131] A. Khodakovsky, P. Schr "" oder, and W. Sweldens. Progressive geometry compression.ACM Computer Graphics (Proc. SIGGRAPH 2000), 271 - 278,2000
[132] U. Labsik, L. Kobbelt, R. Schneider, and H.-P. Seidel. Progressive transmission of subdivision surfaces. Computational Geometry Journal: Theory and Applications, 15(13):25 - 39,2000
[133] S. Rusinkiewicz and M. Levoy. Streaming QSplat: A viewer for networked visualization of large, dense models. In Proc. 2001 ACM Symposium on Interactive 3D Graphics, 63 - 68, 2001
[134] D. S. P. To, R. W. H. Lau, and M. Green. A method for progressive and selective transmission of multi-resolution models. In: Proceedings of ACM Symposium on Virtual Reality Software and Technology, 88 - 95,1999
[135] S. Yang, C.-S. Kim and C.-C. J. Kuo. A progressive view-dependent technique for interactive 3d mesh transmission. IEEE Trans. Circuits and Systems for Video Technology, 14(11):1249- 1264,2000
[136] El-Sana, J., Azanli, E., Varshney, A., Skip Strips: Maintaining triangle strips for viewdependent rendering. In Visualization '99 Proceedings, IEEE, 131-138, 1999
[137] Evans, F., Skiena, S. S., Varshney, A. Optimizing triangle strips for fast rendering. In Visualization'96 Proceedings, 319-326, 1996
[138] Karypis, G, and Kumar, V, METIS - a software package for partitioning unstructured graphs, partitioning meshes, and computing fill-reducing orderings of sparse matrices. Version 4, University of Minnesota. Available on WWW at URL http://glaros.dtc.umn.edu/gkhome/views/metis
[139] Mitra, T. and Chiueh, T., A breadth-first approach to efficient mesh traversal. In Proceedings of the 13th ACM SIGGRAPH/Eurographics Workshop on Graphics Hardware, 31—38, 1998
[140] U. Adamy, J. Giesen, and M. John. New techniques for topologically correct surface reconstrucion. In Proc. 11th IEEE Visualization Conference (VIS), 373-380,2000
[141] P. Alliez, D. Cohen-Steiner, O. Devillers, B. Levy, and M. Desbrun. Anisotropic polygonal remeshing. In: SIGGRAPH proceedings, 485-493, 2003
[142] P. Alliez, M. Meyer, and M. Desbrun. Interactive geometry remeshing. In SIGGRAPH proceedings, 347-354, 2002
[143] S. Campagna, L. Kobbelt, and H.-P. Seidel. Directed edges-A scalable representation for triangle meshes. Journal of Graphics Tools: JGT, 3(4): 1-12, 1998
[144] N. Dyn. Subdivision schemes in computer aided geometric design. In Advances in Numerical Analysis II, Wavelets, Subdivision and Radial Functions, 36-104, 1991
[145] N. Dyn, K. Hormann, S.-J. Kim and D. Levin. Optimizing 3d triangulations using discrete curvature analysis. In Innovations in Applied Mathematics. Vanderbilt University Press, 2001
[146] M. S. Floater. Parametrization and smooth approximation of surface triangulations. Comp. Aided Geom.Design, 14:231-250, 1997
[147] X. Gu, S. Gortler, and H. Hoppe. Geometry images. In SIGGRAPH Proceedings, 355-361,2002
[148] M. Isenburg and M. Snoeyink. Face fixer: Compressing polygon meshes with properties. In SIGGRAPH proceedings, 263-270, 2002
[149] A. W. F. Lee, W. Sweldens, P. Schr oder, L. Cowsar, and D. Dobkin. Maps: Multiresolution adaptive parameterization of surfaces. In SIGGRAPH 98 Proceedings, 95-104, 1998
[150] B. Levy, S. Petitjean, N. Ray, and J. Maillot. Least squares conformal maps for automatic texture atlas generation. In Siggraph 2002 Proceedings, 362-371, 2002
[151] Junfeng Ji, Enhua Wu, Sheng Li, and Xuehui Liu. Dynamic LOD on GPU. In Proceedings of Computer Graphics International 2005, 108-114 ,2005
[152] P. Sander, J. Snyder, S. Gortler, and H. Hoppe. Texture mapping progressive meshes. In SIGGRAPH 2001 proceedings, pages 409-416, 2001
[153] J. Bolz, I. Fanner, E. Grinspun, and P. Schroder. Sparse matrix solvers on the GPU: Conjugate gradients and multigrid. In Proceedings of SIGGRAPH 2003, 917-924, 2003
[154] Goodnight N, Woolley C, Luebke D, Humphreys G A multigrid solver for boundary value problems using programmable graphics hardware. In: Proc. of the Graphics Hardware 2003, 102-111,2003
[155] Kruger J, Westermann R. Linear algebra operators for GPU implementation of numerical algorithms. ACM Trans. on Graphics, 22(3):908~916, 2003
[156] Nabil Mustafa, Eleftheris Koutsofios, Shankar Krishnan, Suresh Venkatasubramanian. Heckbert. Hardware-Assisted View-Dependent Planar Map Simplification. In: Annual ACM Symposium on Computational Geometry.2001 .http://. www.research.att.com/areas/visualization/ papers_videos/papers/2001 mkkv.pdf