首页> 外文会议>International Conference on Computational Intelligence and Security >Particle Sorting Algorithm Based on Stretching Tensor
【24h】

Particle Sorting Algorithm Based on Stretching Tensor

机译:基于拉伸张量的粒子分选算法

获取原文

摘要

In this paper, we come up with particle sorting algorithm which is based on stretching tensor to address this critical phenomenon that we call it "super elastic deformation". Firstly, we should build a cloth mesh geometry model by mass-spring model, secondly, we compute the stretching tensor value of the particle in the simulation process, and then sort the values descending, lastly, we picked the particles of larger value of the tensile tensor, then fix the particle position by using Provot method. The result shows the one we proposed can effectively avoid cloth shock issue compared with the existing algorithms, and improve the computation efficiency without affecting the simulation result.
机译:在本文中,我们提出了粒子分拣算法,该算法基于拉伸张量来解决我们称之为“超弹性变形”的临界现象。首先,我们应该通过质量弹簧模型构建布料网格几何模型,其次,我们计算仿真过程中粒子的拉伸张量值,然后对下降的值进行分类,最后,我们选择了更大值的粒子拉伸张量,然后使用普通方法固定颗粒位置。结果表明,与现有算法相比,我们提出的人可以有效地避免布冲击问题,并在不影响模拟结果的情况下提高计算效率。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号