期刊文献+

一种依概率值简化三角网格模型的新算法 被引量:2

A new Algorithm for Simplying Triangle Mesh Model Based on Probability
下载PDF
导出
摘要 利用网格模型简化技术,提出了一种基于概率值简化三角形网格模型的新算法。算法以到相关三角形平面距离最短的点为折叠后的新点,以可调加权控制函数作为折叠误差控制三角形的简化顺序,通过定义分段概率函数,采用连续折叠的方式,对处于不同误差范围内的三角形以不同概率进行连续折叠,使每次误差排序后被折叠的三角形数目由原来的1个增加为若干个,减少了排序次数,加快了简化速度。编程应用结果表明,本算法实现简单,简化速度比单次折叠简化速度提高10倍以上。 Using mesh model simplification, a new method of triangle collapse mesh simplification algorithm based on probability was proposed. In the algorithm, the point closest to relevant triangle is the new point after the triangle is collapsed. An adjustable weighted control function is used to control the order of simplification. By means of the subdivision probability function, the algorithm continuously collapses triangles with differential errors. In this way, after reordering triangles′ errors, the one collapsed triangle is increased to several ones. Accordingly the continuous collapse algorithm decreases the times of the sort and speeds up the simplification. The program results show that the method can be worked out easily, the simplification speed can be increased by over 10times compared with separate collapse algorithms.
出处 《中南大学学报(自然科学版)》 EI CAS CSCD 北大核心 2005年第1期123-127,共5页 Journal of Central South University:Science and Technology
基金 湖南省自然科学基金资助项目(02JJY3049)
关键词 三角形折叠 概率函数 网格模型 triangle collapse probability function mesh model
  • 相关文献

参考文献16

  • 1马小虎,潘志庚,石教英.基于三角形移去准则的多面体模型简化方法[J].计算机学报,1998,21(6):492-498. 被引量:34
  • 2周昆,潘志庚,石教英.基于三角形折叠的网格简化算法[J].计算机学报,1998,21(6):506-513. 被引量:86
  • 3蒋遂平,周明天,戴颖.基于法向的网格简化[J].计算机学报,1999,22(10):1074-1079. 被引量:17
  • 4SCHROEDER W J, ZARGE J A, LORENSEN W E. Decimation of Triangle Meshes[J]. Computer Graphics, 1992,26(2):65-70.
  • 5TURK G. Re-tiling Polygonal Surface[J]. Computer Graphics, 1992,26(2):55-64.
  • 6HOPPE H. Progressive Meshes[J]. Computer Graphics,1996,30(1):99-108.
  • 7GARLAND M, HECKBERT P S. Surface Simplification Using Quadric Error Metrics[J]. Computer Graphics,1997,31(3):209-216.
  • 8HAMANN B. A Data Reduction Scheme for Triangulated Surface[J]. Computer Aided Geometric Design, l994, 11(2):197-214.
  • 9ECK M, DEROSE T, DUCHAMP T, et al. Multiresolution Analysis of Arbitrary Meshes[J].Computer Graphics,1995,29(2):173-182.
  • 10COHEN J,VARSHNEY A, MANOCHA D, ed al. Simplification Envelopes[J].Computer Graphics,1996,30(2): 119-128.

二级参考文献23

  • 1潘志庚,马小虎,石教英.虚拟环境中多细节层次模型自动生成算法[J].软件学报,1996,7(9):526-531. 被引量:63
  • 2[1] Garland M, Heckbert P. Surface simplification using quadric error metrics[A]. Whitted T. Proceedings of SIGGRAPH 97, Computer Graphics Proceedings, Annual Conference Series[C]. Los Angeles: Addison Wesley,1997.209-216.
  • 3[2] Lindstrom P, Turk G. Fast and memory efficient polygonal simplification[A]. Ebert D, Hagen H, Rushmeier H. IEEE Visualization ′98[C]. North Carolina: IEEE,1998.279-286.
  • 4[3] Erikson C, Manocha D. GAPS: General and automatic polygonal simplification[A]. Hodgins J, Foley J. 1999 ACM Symposium on Interactive 3D Graphics[C]. Atlanta: ACM,1999.79-88.
  • 5[4] Hoppe H. New quadric metric for simplifying meshes with appearance attibutes[A]. Ebert D, Gross M, Hamann B. IEEE Visualization ′99[C]. San Francisco: IEEE,1999.59-66.
  • 6[5] Hoppe H. Progressive meshes[A]. Rushmeier H. Proceedings of SIGGRAPH 96, Computer Graphics Proceedings, Annual Conference Series[C]. New Orleans: Addison Wesley, 1996.99-108.
  • 7[6] Guéziec A. Locally toleranced surface simplification[J] . IEEE Transactions on Visualization and Computer Graphics, 1999,5(2):168-189.
  • 8[7] Heckbert P, Garland M. Optimal triangulation and quadric-based surface simplification[J].Journal of Computational Geometry: Theory and Applications, 1999,14(1-3):49-65.
  • 9[8] Klein R, Liebich G, Straβer W. Mesh reduction with error control[A]. Yagel R, Nielson G. IEEE Visualization ′96[C]. San Francisco: IEEE,1996.311-318.
  • 10[9] Markosian L, Cohen J, Crulli T, et al. Skin: a constructive approach to modeling free-form shapes[A]. Rockwood A. Proceedings of SIGGRAPH 99, Computer Graphics Proceedings, Annual Conference Series[C]. Los Angeles: Addison Wesley Longman, 1999.393-400.

共引文献123

同被引文献29

  • 1刘晓利,刘则毅,高鹏东,彭翔.基于尖特征度的边折叠简化算法[J].软件学报,2005,16(5):669-675. 被引量:55
  • 2蒲浩,宋占峰,詹振炎.基于约束Delaunay三角剖分的道路三维建模方法[J].华中科技大学学报(自然科学版),2005,33(6):111-113. 被引量:26
  • 3杜晓晖,尹宝才,孔德慧.一种边折叠三角网格简化算法[J].计算机工程,2007,33(12):12-15. 被引量:12
  • 4中华人民共和国国务院.国家中长期科学和技术发展规划纲要(2006-2020)[EB/OL].Http://gh.most.gov.cn/zcq/kjgh-default.jsp.2006-03-02.
  • 5Hoppe H. View-dependent refinement of progressive meshes[J]. Computer Graphics, 1997, 31(3): 189-198.
  • 6Hoppe H, Derose T, Dechamp T, et al. Mesh optimization[C]//Proceedings of the SIGGRAPH, San Diego, USA: ACM, 2003: 19-25.
  • 7Garland M. Multi resolution modeling: survey & future opportunities[C]//Proceedings of the Eurographics, Granada, Soain: Euroraohics Association. 1999: 49-65.
  • 8Andersson M, Gudmundsson J, Levcopoulos C. Restricted mesh simplification using edge contractions[J]. International Journal of Computational Geometry and Application, 2009, 19(3): 247-265.
  • 9Kaick Y M, Pedrini H. A comparative evaluation of metrics for fast mesh simplification[J]. Computer Graphics Forum, 2006, 25(2): 197-210.
  • 10Atlan S, Garland M. Interactive multiresolution editing and display of large terrains[J]. Computer Graphics Forum, 2006, 25(2): 211-223.

引证文献2

二级引证文献18

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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