| MC算法生成数据的分组网格化处理 |
| |
| 引用本文： | 朱经纬,王乘,蒙培生. MC算法生成数据的分组网格化处理[J]. 华中科技大学学报(自然科学版), 2007, 35(7): 12-14 |
| |
| 作者姓名： | 朱经纬 王乘 蒙培生 |
| |
| 作者单位： | 华中科技大学,土木工程与力学学院,湖北,武汉,430074;华中科技大学,水电与数字化工程学院,湖北,武汉,430074 |
| |
| 摘 要： | 对MC算法生成的数据进行后续处理,首先采用排序归并算法,归并顶点数据.根据相邻三角形共有顶点的特性,确定三角形之间的连接关系.根据属于同一个子等值面的三角形相互连接的特性,采用种子算法,将属于不同子等值面数据进行分组.采用顶点表与三角形表的数据结构存放子等值面的数据,实现MC算法生成数据的分组与网格化.
|
| 关 键 词： | 移动立方体算法 快速排序 数据归并 种子算法 |
| 文章编号： | 1671-4512（2007）07-0012-03 |
| 修稿时间： | 2006-07-03 |
Grouped and meshed data from marching cubes algorithm |
| |
| Zhu Jingwei,Wang Cheng,Meng Peisheng. Grouped and meshed data from marching cubes algorithm[J]. JOURNAL OF HUAZHONG UNIVERSITY OF SCIENCE AND TECHNOLOGY.NATURE SCIENCE, 2007, 35(7): 12-14 |
| |
| Authors: | Zhu Jingwei Wang Cheng Meng Peisheng |
| |
| Affiliation: | 1 College of Civil Engineering and Mechanics; 2 College of Hydropower and Information Engineering, Huazhong University of Science and Technology, Wuhan 430074, China |
| |
| Abstract: | The follow-up treatment was done to the data generated by the marching cubes algorithm. First, the quick sort and merger algorithm was used to merge vertexes data, so one space vertex will only has one vertex data to store. According to the character of the vertices shared by the triangles which are connecting with each other, the mutual connective relationships of the triangles are made certain. According to the character of triangles which are in the same child isosurface connect with each other, the seed algorithm is used to group the data belong to different child isosurfaces. Finally, the vertex table and triangle table are used to store the data of the same child isosurface, grouping and meshing the data of marching cubes algorithm are achieved. |
| |
| Keywords: | marching cubes algorithm quick sort data merger seea algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
