首页> 外文期刊>International Journal for Numerical Methods in Engineering >Contributions to the generalization of advancing front particle packing algorithms
【24h】

Contributions to the generalization of advancing front particle packing algorithms

机译:有助于先进的前粒子填充算法的推广

获取原文
获取原文并翻译 | 示例
获取外文期刊封面目录资料

摘要

The generation of a set of particles with high initial volume fraction is a major problem in the context of discrete element simulations. Advancing front algorithms provide an effective means to generate dense packings when spherical particles are assumed. The objective of this paper is to extend an advancing front algorithm to a wider class of particles with generic size and shape. In order to get a dense packing, each new particle is placed in contact with other two (or three in 3D) particles of the advancing front. The contact problem is solved analytically using wrapping intersection technique. The results presented herein will be useful in the application of these algorithms to a wide variety of practical problems. Examples of geometric models for applications to biomechanics and cutting tools are presented. Copyright (c) 2015 John Wiley & Sons, Ltd.
机译:在离散元素模拟的背景下,具有高初始体积分数的一组粒子的生成是一个主要问题。当假定球形粒子时,先进的前端算法提供了一种生成密集堆积的有效方法。本文的目的是将一种先进的前端算法扩展到具有通用大小和形状的更广泛的粒子类。为了获得密集的堆积,每个新粒子都与前进的前沿的其他两个(或3D中的3D)粒子接触。使用包裹相交技术可以解决接触问题。本文介绍的结果将有助于将这些算法应用于各种实际问题。介绍了应用于生物力学和切削工具的几何模型的示例。版权所有(c)2015 John Wiley&Sons,Ltd.

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号