期刊文献+

采用两次局部映射法简化三角网格 被引量:3

Simplify Triangles with Two Local Mapping
下载PDF
导出
摘要 在计算可视化领域 ,通常采用三角网格来表示三维物体 ,但是 ,由于大量的三角网格会影响实时交互的效果 ,因而 ,三角网格的简化越来越引起人们的重视。为了有效地进行网格简化 ,在传统的边压缩方法的基础上 ,提出了一种采用两次局部映射的三角网格简化方法 ,即首先利用高斯球 ,将三角网格投影到二维平面上 ,然后在二维平面上简化后 ,再投影回三维空间 ,以达到简化目的。实践证明 ,该方法不仅误差小 ,简化效率高 ,而且不会产生自相交 ,同时具有运行稳定和适用性强等优点。 In the field of computer visualization, three-dimensional object is usually rendered by triangle meshes,but too many triangle meshes can affect the result of real-time operation, such as shifting, rotation and zooming, most of users can't bear the slowness. So how to simplify the triangle meshes is regarded more and more important. To simplify triangles effectively while not influence the vision effect, based on the traditional method of edge contraction, a new method is presented, which named Two Times of Local Mapping. First, it maps the three-dimensional triangle meshes from three-dimensional space to two-dimensional plane by using Gaussian sphere which can determine the direction of projection. Then on two-dimensional plane, using the traditional edge contraction method, a new contracted point is found in the kernel of a polygon. With the new point, the number of triangles is reduced greatly. After simplification, when mapping the simplified triangles back to three-dimensional space, the error is checked. Two kinds of error are defined to ensure the minimum error. It is proved that the given method is little-error, efficient and without self-intersected, and also it is stable and applicable.
出处 《中国图象图形学报(A辑)》 CSCD 北大核心 2004年第5期594-597,共4页 Journal of Image and Graphics
基金 国家自然科学基金项目(60271032)
关键词 局部映射法 三角网格 计算可视化 三维物体 边压缩 高斯球 二维平面 triangle mesh, edge contraction, mapping, gaussian sphere
  • 相关文献

参考文献6

  • 1唐泽圣.三维数据场可视化[M].北京:清华大学出版社,1996.196-212.
  • 2Schroeder William J, Zarge Jonathan A, Lorensen William E.Decimation of Triangle Meshes[JJ. Computer Graphics, 1992,26(2) : 65- 70.
  • 3Hoppe H. Progressive meshes[J]. Computer Graphics, 1996,30(2) : 99- 108.
  • 4Michael Garland, Heckbert Paul S. Surface simplification using quadric error metrics[J]. Computer Graphics, 1997,31(2) : 209-216.
  • 5Rossignac J, Borrel P. Geometric modeling in Computer Graphics, chapter multi-resolution 3D approximations for rendering complex scenes[M]. New York, USA: Springer-Verlag, 1992:455-465.
  • 6刘保权,周明全,耿国华.交互式动态体绘制及其加速算法[J].中国图象图形学报(A辑),2002,7(3):223-228. 被引量:6

共引文献9

同被引文献46

  • 1于行洲,冯洁,查红彬.位移蝶形细分面片的渐进传输[J].计算机辅助设计与图形学学报,2004,16(5):625-631. 被引量:5
  • 2张兴平,万晖,朱晓冬,周明全.基于体积误差的三角形收缩网格简化算法[J].计算机应用与软件,2005,22(5):21-22. 被引量:3
  • 3Atlan S, Garland M. Interactive multiresolution editing and display of large terrains [J]. Computer Graphics Forum, 2006, 25(2): 211-223
  • 4Clark J H. Hierarchical geometric models for visible surface algorithms [J]. Communications of the ACM, 1976, 19 (10): 547-554
  • 5Jr DeHaemer M J, Zyda MJ. Simplification of objects rendered by polygonal approximations [J]. Computers Graphics, 1991, 15(2): 175-184
  • 6Schroeder W J, Zarge J A, Lorensen W E. Decimation of triangle meshes[J]. Computer Graphics, 1992, 26(2): 65- 70
  • 7Hoppe H, DeRose T, Duchamp T, etal. Mesh optimization[C]//Computer Graphics Proceedings, Annual Conference Series, ACM SIGGRAPH, Anaheim, 1993:19-26
  • 8Hamann B. A data reduction scheme for triangulated surfaces [J], Computer Aided Geometric Design, 1994, 11 (2): 197-214
  • 9Soucy M, Godin G, Rioux M. A texture mapping approach for the compression of colored 3D triangulations [J], The Visual Computer, 1996, 12(10): 503-514
  • 10Garland M, Heckbert P S. Simplifying surfaces with color and texture using quadric error metrics [C] //Proceedings of the Conference on Visualization, Research Triangle Park, 1998, 263-269

引证文献3

二级引证文献9

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部