Hexahedral mesh generation by successive dual cycle elimination

DOI10.1007/s003660050022zbMath0958.65507OpenAlexW2173492485WikidataQ57013359 ScholiaQ57013359MaRDI QIDQ1809119

Matthias Müller-Hannemann

Publication date: 10 April 2001

Published in: Engineering with Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s003660050022

zbMATH Keywords

finite elementplanar graphscycle eliminationhexahedral mesh generationcombinatorial dualhex complexquadrilateral surface meshing

Mathematics Subject Classification ID

Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50)

Related Items

Local dual contributions: Representing dual surfaces for block meshing, How close is a quad mesh to a polycube?, Efficiently hex-meshing things with topology, The generation of hexahedral meshes for assembly geometry: survey and progress, 2D and 3D finite element meshing and remeshing, Quadrilateral surface meshes without self-intersecting dual cycles for hexahedral mesh generation