Automatic mesh generation for electromagnetic simulation on complex industry products

Purpose This paper aims to develop a novel scheme for automatically generating high-quality tetrahedral meshes for electromagnetic simulations on complex industrial products, even in the presence of geometric defects. Design/methodology/approach This paper substantially revises and improves three techniques namely cut-and-fix, sphere-packing and small polyhedron reconnection (SPR) and integrates them into a novel scheme. The scheme involves three key steps: first, repairing models with geometric defects using an enhanced cut-and-fix technique; second, applying sphere-packing to place nodes that capture the feature sizes of the model and finally, performing a standard Delaunay triangulation of these nodes, followed by boundary recovery and mesh quality improvement using SPR. Findings The revised cut-and-fix method focuses on surface smoothness and effectively avoids the rough surfaces generated during the global tetrahedron optimization process. The revised sphere-packing method has the ability for meshing size adaptation and is suitable for electromagnetic simulations. It also helps to integrate cut-and-fix, sphere-packing and SPR skillfully into a novel meshing scheme. Originality/value Numerical examples demonstrate the effectiveness and robustness of the proposed method for meshing various types of electromagnetic simulation models, highlighting its excellent performance.

Authors

Publication Details

Journal
Engineering Computations
Published
2025-06-18
DOI
https://doi.org/10.1108/ec-03-2025-0192
Primary Topic
Computational Geometry and Mesh Generation
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Automatic mesh generation for electromagnetic simulation on complex industry products

Shaojing Li, Chuanming Ju, JianFei Liu
Engineering Computations
Computational Geometry and Mesh Generation
article

Automatic mesh generation for electromagnetic simulation on complex industry products

Shaojing Li, Chuanming Ju, JianFei Liu
article en

Abstract

Purpose This paper aims to develop a novel scheme for automatically generating high-quality tetrahedral meshes for electromagnetic simulations on complex industrial products, even in the presence of geometric defects. Design/methodology/approach This paper substantially revises and improves three techniques namely cut-and-fix, sphere-packing and small polyhedron reconnection (SPR) and integrates them into a novel scheme. The scheme involves three key steps: first, repairing models with geometric defects using an enhanced cut-and-fix technique; second, applying sphere-packing to place nodes that capture the feature sizes of the model and finally, performing a standard Delaunay triangulation of these nodes, followed by boundary recovery and mesh quality improvement using SPR. Findings The revised cut-and-fix method focuses on surface smoothness and effectively avoids the rough surfaces generated during the global tetrahedron optimization process. The revised sphere-packing method has the ability for meshing size adaptation and is suitable for electromagnetic simulations. It also helps to integrate cut-and-fix, sphere-packing and SPR skillfully into a novel meshing scheme. Originality/value Numerical examples demonstrate the effectiveness and robustness of the proposed method for meshing various types of electromagnetic simulation models, highlighting its excellent performance.

Engineering Computations
Industry, innovation and infrastructure
Openalex Percentile: Top 75%
Computational Geometry and Mesh Generation
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.