Soft-Cell Tessellations for Finite Element Mesh Generation: Convergence and Accuracy Analysis

We investigate the application of soft-cell tessellations—a recently discovered class of curved-boundary space-filling shapes—to finite element mesh generation. Using Gmsh and scikit-fem, we compare the solution accuracy for Poisson equation benchmarks on curved domains. The results demonstrate that soft-cell meshes achieve optimal O(h2) convergence rates in L2, matching conventional elements. More significantly, we identify a fundamental limitation: coarse polygon boundaries introduce systematic boundary condition (BC) error (∼3%) that does not decrease with mesh refinement. We prove analytically that the BC error scales as O(1/n2) for n-point polygon boundaries, explaining why doubling boundary points reduces the error by 4×. Fine spline boundaries reduce this error by 96%, with the interior solution error reduced by 97.5%. For complex organic shapes, the improvement reaches 56–80%. We establish a connection between the soft-cell softness measure σ and FEM accuracy: a higher softness yields a lower BC error. Comparison with Isogeometric Analysis reveals that while IGA achieves exact geometry (10−16 error), fine spline FEM boundaries reduce the geometric error by 5–6 orders of magnitude versus coarse polygons. These results establish that the boundary representation quality fundamentally limits the FEM accuracy on curved domains, making soft-cell representations particularly valuable.

Authors

Institutions

Publication Details

Journal
Mathematics
Published
2026-02-25
DOI
https://doi.org/10.3390/math14050759
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

Soft-Cell Tessellations for Finite Element Mesh Generation: Convergence and Accuracy Analysis

Vladimir Čeperić
Mathematics
Computational Geometry and Mesh Generation
article

Soft-Cell Tessellations for Finite Element Mesh Generation: Convergence and Accuracy Analysis

Vladimir Čeperić
article en

Abstract

We investigate the application of soft-cell tessellations—a recently discovered class of curved-boundary space-filling shapes—to finite element mesh generation. Using Gmsh and scikit-fem, we compare the solution accuracy for Poisson equation benchmarks on curved domains. The results demonstrate that soft-cell meshes achieve optimal O(h2) convergence rates in L2, matching conventional elements. More significantly, we identify a fundamental limitation: coarse polygon boundaries introduce systematic boundary condition (BC) error (∼3%) that does not decrease with mesh refinement. We prove analytically that the BC error scales as O(1/n2) for n-point polygon boundaries, explaining why doubling boundary points reduces the error by 4×. Fine spline boundaries reduce this error by 96%, with the interior solution error reduced by 97.5%. For complex organic shapes, the improvement reaches 56–80%. We establish a connection between the soft-cell softness measure σ and FEM accuracy: a higher softness yields a lower BC error. Comparison with Isogeometric Analysis reveals that while IGA achieves exact geometry (10−16 error), fine spline FEM boundaries reduce the geometric error by 5–6 orders of magnitude versus coarse polygons. These results establish that the boundary representation quality fundamentally limits the FEM accuracy on curved domains, making soft-cell representations particularly valuable.

MathematicsVol. 14(5)
University of Zagreb (HR)
Openalex Percentile: Top 46%
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.