| 空间二叉树在外形不规则颗粒三维建模中的应用 |
| |
| 引用本文： | 龙浩.空间二叉树在外形不规则颗粒三维建模中的应用[J].武汉大学学报(工学版),2012,45(2):208-211. |
| |
| 作者姓名： | 龙浩 |
| |
| 作者单位： | 武汉大学土木建筑工程学院,湖北武汉,430072 |
| |
| 基金项目： | 基金项目:国家自然科学基金项目，湖北省自然科学基金重点项目 |
| |
| 摘 要： | 基于一种用球体单元填充颗粒内部空间建立模型的方法,其球体单元的形成依据颗粒表面和内部节点信息.在计算颗粒表面和内部网格节点之间最短距离时,把二叉树优化算法引入到了用VC++编写的程序中.同时利用该算法实现了某一真实颗粒的三维建模,通过对比原有算法的计算效率,该算法能够在保证颗粒建模精度的前提下,提高计算效率约70倍,可以在很大程度上节约颗粒模型特别是大规模颗粒模型生成的时间.
|
| 关 键 词： | 空间二叉树算法 外形不规则颗粒 三维建模 最短距离 |
Application of binary tree to the 3D modeling of irregular particle |
| |
| LONG Hao.Application of binary tree to the 3D modeling of irregular particle[J].Engineering Journal of Wuhan University,2012,45(2):208-211. |
| |
| Authors: | LONG Hao |
| |
| Affiliation: | LONG Hao (School of Civil and Architectural Engineering,Wuhan University,Wuhan 430072,China) |
| |
| Abstract: | Particle is modeled by means of filling granular inner space with basic sphere clump,based on the surface and inner information.A binary tree optimization algorithm program was developed for auto-modeling using Visual C++ to calculate the minimum distance between the inner nodes and surface nodes.Besides,this paper applied the binary tree optimization algorithm to modeling a real granula,and improved the efficiency of the modeling about seventy times compared to the original algorithm,which proves that the binary tree algorithm can save time of the large-scale calculation of particles greatly and has no influence on the precision of the modeling. |
| |
| Keywords: | binary tree algorithm irregular particle 3D modeling minimum distance |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
