DeepAI AI Chat
Log In Sign Up

Tetrahedralization of a Hexahedral Mesh

by   Aman Timalsina, et al.

Two important classes of three-dimensional elements in computational meshes are hexahedra and tetrahedra. While several efficient methods exist that convert a hexahedral element to a tetrahedral elements, the existing algorithm for tetrahedralization of a hexahedral complex is the marching tetrahedron algorithm which limits pre-selection of face divisions. We generalize a procedure for tetrahedralizing triangular prisms to tetrahedralizing cubes, and combine it with certain heuristics to design an algorithm that can triangulate any hexahedra.


page 1

page 2

page 3

page 4


Nonconforming finite elements for the Brinkman and -curlΔ curl problems on cubical meshes

We propose two families of nonconforming elements on cubical meshes: one...

Up to 58 Tets/Hex to untangle Hex meshes

The request for high-quality solutions continually grows in a world wher...

Virtual elements on agglomerated finite elements to increase the critical time step in elastodynamic simulations

In this paper, we use the first-order virtual element method (VEM) to in...

High order transition elements: The xNy-element concept – Part I: Statics

Advanced transition elements are of utmost importance in many applicatio...

An Optimized, Parallel Computation of the Ghost Layer for Adaptive Hybrid Forest Meshes

We discuss parallel algorithms to gather topological information about o...

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

This paper shows that constraint programming techniques can successfully...

VoroCrust: Voronoi Meshing Without Clipping

Polyhedral meshes are increasingly becoming an attractive option with pa...