Regularity analysis and verification of Coons volume mappings
Yingying Yu, Yashu Liu, Jiaxuan Li, Xin Li, Ye Ji, Chungang Zhu

TL;DR
This paper presents a systematic framework for analyzing and verifying the regularity of Coons volume mappings, ensuring their suitability for stable and high-quality volumetric modeling in computational design.
Contribution
It introduces a general sufficient condition and a Bézier coefficient-based criterion for regularity verification, along with an efficient algorithm applicable to multi-patch B-spline volumes.
Findings
Verification algorithm completes in milliseconds
Regularity relates to geometric similarity of boundary surfaces
Method validated through numerical experiments
Abstract
The Coons volume provides a classical approach for constructing three-dimensional parametric mappings via boundary surface interpolation and is widely employed in volumetric mesh generation, computer-aided geometric design, and isogeometric analysis. However, due to curvature variations and continuity limitations of the boundary surfaces, the Jacobian determinant of a Coons volume may locally vanish or become negative, resulting in a non-regular mapping. This undermines mesh quality and compromises the stability of subsequent numerical computations. Ensuring the regularity of Coons volumes is therefore critical for robust parametric modeling. This paper develops a systematic framework for analyzing and verifying the regularity of Coons volumes. We first derive a general sufficient condition applicable to arbitrary boundary parameterizations, independent of specific analytical forms. For…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Numerical Analysis Techniques · 3D Shape Modeling and Analysis · Computational Geometry and Mesh Generation
