{"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.