纺织学报 ›› 2009, Vol. 30 ›› Issue (04): 129-134.

• 管理与信息化 • 上一篇    下一篇

三维服装表面模型的离散 Marching Cubes算法

黄敏;张剑   

  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2009-04-15 发布日期:2009-04-15

Discrete marching cubes algorithm for surface model of three-dimensional costume

HUANG Min;ZHANG Jian   

  • Received:1900-01-01 Revised:1900-01-01 Online:2009-04-15 Published:2009-04-15

摘要: 对三维服装表面模型的重构简化算法进行了研究。在三维表面模型和化简方面采用了离散 Marching Cubes(DiscMC)算法,将离散的思想应用到三角面片的化简中,耗时插值计算量被降至最低,使得原有系统在重构效率和效果上都有了极大的改善。位于同一平面且相邻的三角面片都进行合并,可以达到很高的简化比,算法效率很高,同时保持有限的精度损失,保持服装表面模型细微结构不会被 DiscMC 的简化过程所破坏,DiscMC 优于其他算法。另外,从算法描述实验知,DiscMC 仅限于原始体数据的密度值都在网格点上,并且简化是一次性的,不会反复进行简化,因此,非常适应于服装系统的三维表面模型简化。

Abstract: The paper carries out further researches about the algorithm of reconstructing and simplifying the surface model of three-dimensional costume, and adopts the Discrete Marching Cubes (DiscMc)algorithm to apply the discrete idea to simplifying the triangle interface, thus the interpolating value which is time-consuming is reduced to the lowest so that the rebuilding efficiency and effect of the former system are greatly improved. The triangle interfaces in the same plane and in the neighbour are incorporated, It gets an excellent ratio of simplification, high efficiency of the algorithm, keeps a restricted loss of precision and the microstructure of surface model of costumes without being destroyed in the simplifying process of DiscMC. It is very obvious that the DiscMC is advantageous over other simplifying algorithms. In addition, it is seen from the descriptive experiment about the algorithm that the DiscMC is only confined to the point whose density of raw data is on the grid and simplifying is conducted only one time rather than repeatedly, therefore, it is very suitable for simplifying the 3-D surface model of costumes.

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!