Indexed Parallel Sphere Packing for Arbitrary Domains

Cuba Lajo Rubén Adrián, Loaiza Fernández Manuel Eduardo
{"title":"Indexed Parallel Sphere Packing for Arbitrary Domains","authors":"Cuba Lajo Rubén Adrián, Loaiza Fernández Manuel Eduardo","doi":"10.5121/csit.2022.120918","DOIUrl":null,"url":null,"abstract":"Particle packings are used to simulate granular matter, which has various uses in industry. The most outstanding characteristics of these are their density and their construction time, the density refers to the percentage of the space of the object filled with particles, this is also known as compaction or solid fraction. Particle packing seeks to be as dense as possible, work on any object, and have a low build time. Currently there are proposals that have significantly reduced the construction time of a packing and have also managed to increase the density of these, however, they have certain restrictions, such as working on a single type of object and being widely affected by the characteristics of the object. The objective of this work is to present the improvement of a parallel sphere packing for arbitrary domains. The packing to improve was directly affected in time by the number of triangles in the mesh of object. This enhancement focuses on creating a parallel data structure to reduce build time. The proposed method reduces execution time with a high number of triangles, but it takes up a significant amount of memory for the data structure. However, to obtain high densities, that is, densities between 60% and 70%, the sphere packing construction does not overwhelm the memory.","PeriodicalId":91205,"journal":{"name":"Artificial intelligence and applications (Commerce, Calif.)","volume":"61 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2022-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Artificial intelligence and applications (Commerce, Calif.)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5121/csit.2022.120918","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Particle packings are used to simulate granular matter, which has various uses in industry. The most outstanding characteristics of these are their density and their construction time, the density refers to the percentage of the space of the object filled with particles, this is also known as compaction or solid fraction. Particle packing seeks to be as dense as possible, work on any object, and have a low build time. Currently there are proposals that have significantly reduced the construction time of a packing and have also managed to increase the density of these, however, they have certain restrictions, such as working on a single type of object and being widely affected by the characteristics of the object. The objective of this work is to present the improvement of a parallel sphere packing for arbitrary domains. The packing to improve was directly affected in time by the number of triangles in the mesh of object. This enhancement focuses on creating a parallel data structure to reduce build time. The proposed method reduces execution time with a high number of triangles, but it takes up a significant amount of memory for the data structure. However, to obtain high densities, that is, densities between 60% and 70%, the sphere packing construction does not overwhelm the memory.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
任意域的索引平行球填充
颗粒填料用于模拟颗粒状物质,在工业上有各种用途。这些最突出的特点是它们的密度和它们的施工时间,密度是指物体填充颗粒的空间的百分比,这也被称为压实或固体分数。粒子包装寻求尽可能密集,适用于任何对象,并具有较低的构建时间。目前,有一些建议已经大大减少了包装的施工时间,并设法增加了这些密度,然而,它们有一定的限制,例如在单一类型的物体上工作,并且受到物体特性的广泛影响。本文的目的是提出一种改进的任意域的平行球填充方法。物体网格中三角形的数量直接影响改进的填充效果。此增强侧重于创建并行数据结构以减少构建时间。提出的方法减少了大量三角形的执行时间,但它占用了大量的数据结构内存。然而,为了获得高密度,即密度在60%到70%之间,球体填充结构不会压倒内存。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Methodology of Measurement Intellectualization based on Regularized Bayesian Approach in Uncertain Conditions Stochastic Dual Coordinate Ascent for Learning Sign Constrained Linear Predictors Data Smoothing Filling Method based on ScRNA-Seq Data Zero-Value Identification Batch-Stochastic Sub-Gradient Method for Solving Non-Smooth Convex Loss Function Problems Teaching Reading Skills More Effectively
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1