44 citations · 60 across the 4 of their papers we have counts for
5 papers
Finding Hexahedrizations for Small Quadrangulations of the Sphere
Kilian Verhetsel, Jeanne Pellerin, Jean-François Remacle
This paper tackles the challenging problem of constrained hexahedral meshing. An algorithm is introduced to build combinatorial hexahedral meshes whose boundary facets exactly matc…
A 44-element mesh of Schneiders' pyramid: bounding the difficulty of hex-meshing problems
Kilian Verhetsel, Jeanne Pellerin, Jean-françois Remacle
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 face…
One machine, one minute, three billion tetrahedra
Célestin Marot, Jeanne Pellerin, Jean-François Remacle
This paper presents a new scalable parallelization scheme to generate the 3D Delaunay triangulation of a given set of points. Our first contribution is an efficient serial implemen…
There are 174 Subdivisions of the Hexahedron into Tetrahedra
Jeanne Pellerin, Kilian Verhetsel, Jean-Francois Remacle
This article answers an important theoretical question: How many different subdivisions of the hexahedron into tetrahedra are there? It is well known that the cube has five subdivi…
Identifying combinations of tetrahedra into hexahedra: a vertex based strategy
Jeanne Pellerin, Amaury Johnen, Kilian Verhetsel +1
Indirect hex-dominant meshing methods rely on the detection of adjacent tetrahedra an algorithm that performs this identification and builds the set of all possible combinations of…