A 44-element mesh of Schneiders' pyramid: bounding the difficulty of hex-meshing problems

06/04/2018
by   Kilian Verhetsel, et al.
0

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.

READ FULL TEXT
research
06/04/2018

A 66-element mesh of Schneiders' pyramid: bounding the difficulty of hex-meshing problems

This paper shows that constraint programming techniques can successfully...
research
01/28/2023

Surface and hypersurface meshing techniques for space-time finite element methods

A general method is introduced for constructing two-dimensional (2D) sur...
research
11/09/2022

Up to 58 Tets/Hex to untangle Hex meshes

The request for high-quality solutions continually grows in a world wher...
research
04/25/2019

Finding Hexahedrizations for Small Quadrangulations of the Sphere

This paper tackles the challenging problem of constrained hexahedral mes...
research
09/15/2021

Temporal Parameter-free Deep Skinning of Animated Meshes

In computer graphics, animation compression is essential for efficient s...
research
12/21/2019

Anisotropic Mesh Filtering by Homogeneous MLS Fitting

In this paper we present a novel geometric filter, a homogeneous moving ...
research
11/07/2016

Error-Bounded and Feature Preserving Surface Remeshing with Minimal Angle Improvement

The typical goal of surface remeshing consists in finding a mesh that is...

Please sign up or login with your details

Forgot password? Click here to reset