All-hexahedral element meshing: Generation of the dual mesh by recurrent subdivision (Q1573140): Difference between revisions

This paper deals with a method that, given a few topological constraints, produces a non-structured all-hexahedral mesh. It is also explained by means of a simple 2D example and then extended into 3D. The concept of duality throughout this paper is an \(N\)-dimensional extension of the graph theoretical duality between a graph and a map: to each \(n\)-dimensional element of the mesh, there is a corresponding (\(N\)-\(n\))-dimensional one of the dual and vice versa. Also many remarkable advances in the topic of all-hexahedral meshing are presented.