网格数据处理中的数据结构组织

Data Structure for Calculating Meshes

数据结构组织方式在算法的程序实现中占有重要地位。论文探讨了网格数据处理中的数据结构组织问题,分析了不同的数据组织在时间和空间方面的优缺点,提出了一种弹性的、有较强适应性的网格数据组织结构,并以不同实例验证了所提出的数据结构在时间上的即时有效性、存贮空间上的自适应性以及实现上的简单性。论文提出的网格数据组织结构可用于各类网格数据的计算。

The organization structure of data is very important in programming implementation of various algorithms.In this paper,the issue about how to organize data in computer memory during processing meshes is discussed,the time-space efficiency of different data organization for the issue is analyzed,and a adaptive strategy dealing with widely range of size of data meshes is presented.The flexibility and adjustability of this method is testified by several example models.The idea in the paper can be used in various calculation and processing of meshes.