{"title":"A feature-preserving parallel particle generation method for complex geometries","authors":"Xingyue Yang , Zhenxiang Nie , Yuxin Dai , Zhe Ji","doi":"10.1016/j.cpc.2025.109723","DOIUrl":null,"url":null,"abstract":"<div><div>In this paper, a Feature-preserving Particle Generation (FPPG) method for arbitrary complex geometry is proposed. Instead of basing on implicit geometries, such as level-set, FPPG employs an explicit geometric representation for the parallel and automatic generation of high-quality surface and volume particles, which enables the full preservation of geometric features, such as sharp edges, singularities and etc. Several new algorithms are proposed in this paper to achieve the aforementioned objectives. First, a particle mapping and feature line extraction algorithm is proposed to ensure the adequate representation of arbitrary complex geometry. An improved and efficient data structure is developed too to maximize the parallel efficiency and to optimize the memory footprint. Second, the physics-based particle relaxation procedure is tailored for the explicit geometric representation to achieve a uniform particle distribution. Third, in order to handle large-scale industrial models, the proposed FPPG method is entirely parallelized on shared memory systems and Boolean operations are allowed to tackle structures with multiple assemblies. Intensive numerical tests are carried out to demonstrate the capabilities of FPPG. The scalability tests show that a speedup of 10X is achieved through multi-threading parallelization with various models. Comparative studies with other particle generation methods show that FPPG achieves better performance in both runtime and accuracy. Last, two industrial cases of vehicle wading and gearbox oiling are studied to illustrate that FPPG is applicable to complex geometries.</div></div>","PeriodicalId":285,"journal":{"name":"Computer Physics Communications","volume":"315 ","pages":"Article 109723"},"PeriodicalIF":7.2000,"publicationDate":"2025-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Physics Communications","FirstCategoryId":"101","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0010465525002255","RegionNum":2,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0
Abstract
In this paper, a Feature-preserving Particle Generation (FPPG) method for arbitrary complex geometry is proposed. Instead of basing on implicit geometries, such as level-set, FPPG employs an explicit geometric representation for the parallel and automatic generation of high-quality surface and volume particles, which enables the full preservation of geometric features, such as sharp edges, singularities and etc. Several new algorithms are proposed in this paper to achieve the aforementioned objectives. First, a particle mapping and feature line extraction algorithm is proposed to ensure the adequate representation of arbitrary complex geometry. An improved and efficient data structure is developed too to maximize the parallel efficiency and to optimize the memory footprint. Second, the physics-based particle relaxation procedure is tailored for the explicit geometric representation to achieve a uniform particle distribution. Third, in order to handle large-scale industrial models, the proposed FPPG method is entirely parallelized on shared memory systems and Boolean operations are allowed to tackle structures with multiple assemblies. Intensive numerical tests are carried out to demonstrate the capabilities of FPPG. The scalability tests show that a speedup of 10X is achieved through multi-threading parallelization with various models. Comparative studies with other particle generation methods show that FPPG achieves better performance in both runtime and accuracy. Last, two industrial cases of vehicle wading and gearbox oiling are studied to illustrate that FPPG is applicable to complex geometries.
期刊介绍:
The focus of CPC is on contemporary computational methods and techniques and their implementation, the effectiveness of which will normally be evidenced by the author(s) within the context of a substantive problem in physics. Within this setting CPC publishes two types of paper.
Computer Programs in Physics (CPiP)
These papers describe significant computer programs to be archived in the CPC Program Library which is held in the Mendeley Data repository. The submitted software must be covered by an approved open source licence. Papers and associated computer programs that address a problem of contemporary interest in physics that cannot be solved by current software are particularly encouraged.
Computational Physics Papers (CP)
These are research papers in, but are not limited to, the following themes across computational physics and related disciplines.
mathematical and numerical methods and algorithms;
computational models including those associated with the design, control and analysis of experiments; and
algebraic computation.
Each will normally include software implementation and performance details. The software implementation should, ideally, be available via GitHub, Zenodo or an institutional repository.In addition, research papers on the impact of advanced computer architecture and special purpose computers on computing in the physical sciences and software topics related to, and of importance in, the physical sciences may be considered.