A 44-element mesh of Schneiders’ pyramid: Bounding the difficulty of hex-meshing problems
(2019) Computer-Aided Design — Vol. 116 (2019) (2019)
Files
document3.pdf
Open Access - Adobe PDF
- 946.64 KB
Details
- Authors
- Abstract
- This paper shows that constraint programming techniques can successfully be used to solve challenging hex-meshing problems. Schneiders’ pyramid is a square-based pyramid whose facets are subdivided into three or four quadrangles by adding vertices at edge midpoints and facet centroids. In this paper, we prove that Schneiders’ pyramid has no hexahedral meshes with fewer than 18 interior vertices and 17 hexahedra, and introduce a valid mesh with 44 hexahedra. We also construct the smallest known mesh of the octagonal spindle, with 40 hexahedra and 42 interior vertices. These results were obtained through a general purpose algorithm that computes the hexahedral meshes conformal to a given quadrilateral surface boundary. The lower bound for Schneiders’ pyramid is obtained by exhaustively listing the hexahedral meshes with up to 17 interior vertices and which have the same boundary as the pyramid. Our 44-element mesh is obtained by modifying a prior solution with 88 hexahedra. The number of elements was reduced using an algorithm which locally simplifies groups of hexahedra. Given the boundary of such a group, our algorithm is used to find a mesh of its interior that has fewer elements than the initial subdivision. The resulting mesh is untangled to obtain a valid hexahedral mesh. © 2019 Elsevier Ltd
- Affiliations
Citations
Verhetsel, K., Pellerin, J., & Remacle, J.-F. (2019). A 44-element mesh of Schneiders’ pyramid: Bounding the difficulty of hex-meshing problems. Computer-Aided Design, 116 (2019). https://doi.org/10.1016/j.cad.2019.102735 (Original work published 2019)