【摘要】 利用Marching Cube算法重建的网格数据通常存在三角面片数量庞大的特点,必须对其进行一定程度的简化才能够方便地使用。对于海量断层网格数据可以将其分成连续的若干段,然后将各段在不同的计算节点上进行简化操作以达到并行的效果,但是这样会丢失各段连接处的拓扑信息,因而不利于后续的网格操作。采取了一种新的网格数据存储格式,并基于此提出了相应的合并算法。结果表明该算法能够很好地保持各段之间的拓扑关系,从而实现了断层网格数据的分布式并行简化。更多还原

【Abstract】 The reconstruction result using Marching Cube method must be simplified because it usually has a large number of triangles.The triangles of segment datasets can be concurrently simplified through dividing the mesh into some continuous parts and then sending the parts to different computing nodes to perform simplification operation.This procedure,however,will lose the topological information of the mesh at the joint between two continuous parts which is necessary for subsequent mesh operations.In this paper,we design a new file format to store the mesh data and develop some algorithms based on this format.The result shows that it can keep the topological information very well and consequently,provides the basic data for distributed parallel simplification of segment mesh data.更多还原