Efficiently hex-meshing things with topology

DOI10.1145/2462356.2462403zbMATH Open1305.68230OpenAlexW2059426568MaRDI QIDQ5174458FDOQ5174458

Authors: Jeff Erickson 

Publication date: 17 February 2015

Published in: Proceedings of the twenty-ninth annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2462356.2462403

Recommendations

• Efficiently hex-meshing things with topology
• Shelling hexahedral complexes for mesh generation
• A characterization of the quadrilateral meshes of a surface which admit a compatible hexahedral mesh of the enclosed volume
• Linear complexity hexahedral mesh generation
• Tetrahedral decompositions of hexahedral meshes

zbMATH Keywords

computational topologyhomologyhexahedral mesh generation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cited In (2)

• Efficiently hex-meshing things with topology
• Tetrahedral decompositions of hexahedral meshes

This page was built for publication: Efficiently hex-meshing things with topology

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5174458)