论文部分内容阅读
基于一种用球体单元填充颗粒内部空间建立模型的方法,其球体单元的形成依据颗粒表面和内部节点信息.在计算颗粒表面和内部网格节点之间最短距离时,把二叉树优化算法引入到了用VC++编写的程序中.同时利用该算法实现了某一真实颗粒的三维建模,通过对比原有算法的计算效率,该算法能够在保证颗粒建模精度的前提下,提高计算效率约70倍,可以在很大程度上节约颗粒模型特别是大规模颗粒模型生成的时间.
Based on a method of modeling the interior space of a particle filled with spheres, the spheres of the spheres are formed based on the information of the particle surface and the interior nodes.In the calculation of the shortest distance between the particle surface and the interior mesh nodes, the binary tree optimization algorithm is introduced VC ++ program.At the same time, we use the algorithm to realize the 3D modeling of a real particle.Comparing the efficiency of the original algorithm, this algorithm can improve the computational efficiency about 70 times under the premise of ensuring the particle modeling accuracy, It is possible to save a great deal of time for the generation of granular models, especially large-scale particle models.