摘要： 针对网格简化算法需要的显式和完整拓扑关系，筛选出有效的数据结构，结合MC(MT)算法计算过程的特点，设计六体素法算法。该算法能在MC(MT)算法抽取等值面的同时完成简化算法所需的数据结构，减少了简化算法前数据结构预处理所耗费的时间和空间。
关键词:
数据结构生成,
MC(MT)算法,
网格简化
Abstract: This paper propose a novel method based on the course of MC(MT) algorithm computation to rebuild an apparent and complete topological structure necessary for mesh simplification to reduce the time and memory of the data structure pretreatment. The method called as six-cube method, rebuilds the appropriate data structure while MC(MT) algorithm extracts the iso-surface.
Key words:
data structure building,
MC(MT) algorithm,
mesh simplification
中图分类号:
陶立欣;杨建生. 面向网格简化的数据结构快速生成方法[J]. 计算机工程, 2008, 34(5): 82-84.
TAO Li-xin; YANG Jian-sheng. Fast Generation of Data Structure for Mesh Simplification[J]. Computer Engineering, 2008, 34(5): 82-84.