Advancing front packing of polygons based on Minkowski sum

Peng Zhang, Qingjun Xian, Junqi Chen
{"title":"Advancing front packing of polygons based on Minkowski sum","authors":"Peng Zhang, Qingjun Xian, Junqi Chen","doi":"10.1109/ISTTCA53489.2021.9654625","DOIUrl":null,"url":null,"abstract":"It is an important research topic to study the mechanical properties of rockfill from a meso-level perspective using numerical methods. And the formation of initial set of rockfill particles, represented by polygons/polyhedrons, is a key step in numerical simulation. Advancing front algorithm is an efficient formation algorithm, the locus in it is designed to determine the position of a new particle. We found Minkowski sum and locus polygon can be transformed into other. There are a few of research on locus polygon, but a lot of researches on Minkowski sum, so Minkowski sum algorithms can be used to enrich advancing front algorithm. Therefore, advancing front packing algorithm for polygons based on Minkowski sum is proposed, which can obtain a random initial packing of polygons efficiently and can achieve a higher area fraction.","PeriodicalId":383266,"journal":{"name":"2021 4th International Symposium on Traffic Transportation and Civil Architecture (ISTTCA)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 4th International Symposium on Traffic Transportation and Civil Architecture (ISTTCA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISTTCA53489.2021.9654625","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

It is an important research topic to study the mechanical properties of rockfill from a meso-level perspective using numerical methods. And the formation of initial set of rockfill particles, represented by polygons/polyhedrons, is a key step in numerical simulation. Advancing front algorithm is an efficient formation algorithm, the locus in it is designed to determine the position of a new particle. We found Minkowski sum and locus polygon can be transformed into other. There are a few of research on locus polygon, but a lot of researches on Minkowski sum, so Minkowski sum algorithms can be used to enrich advancing front algorithm. Therefore, advancing front packing algorithm for polygons based on Minkowski sum is proposed, which can obtain a random initial packing of polygons efficiently and can achieve a higher area fraction.
基于闵可夫斯基和的多边形前填充算法
利用数值方法从细观角度研究堆石料的力学特性是一个重要的研究课题。以多边形/多面体为代表的堆石颗粒初始集的形成是数值模拟的关键步骤。前进前沿算法是一种高效的编队算法,它的轨迹用于确定新粒子的位置。我们发现闵可夫斯基和与轨迹多边形可以相互转化。目前对轨迹多边形的研究较少,而对闵可夫斯基和的研究较多,因此闵可夫斯基和算法可以用来丰富推进前沿算法。为此,提出了基于Minkowski和的多边形推进前填充算法,该算法可以有效地获得多边形的随机初始填充,并能获得较高的面积分数。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信