A 44-element mesh of Schneiders' pyramid: bounding the difficulty of hex-meshing problems
Kilian Verhetsel, Jeanne Pellerin, Jean-fran\c{c}ois Remacle

TL;DR
This paper demonstrates the use of constraint programming to determine bounds on the complexity of hex-meshing Schneiders' pyramid, establishing minimal and improved mesh configurations through exhaustive and local optimization techniques.
Contribution
It introduces a method for bounding hex-mesh complexity and constructs the smallest known meshes for Schneiders' pyramid and the octagonal spindle using a general purpose algorithm.
Findings
Schneiders' pyramid has no hexahedral mesh with fewer than 18 interior vertices and 17 hexahedra.
A valid 44-hexahedron mesh for Schneiders' pyramid is constructed.
The smallest known mesh for the octagonal spindle has 40 hexahedra and 42 interior vertices.
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…
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.
