A 44-element mesh of Schneiders' pyramid

DOI10.1007/978-3-030-13992-6_5zbMATH Open1435.68355OpenAlexW2953416048MaRDI QIDQ3296604FDOQ3296604

Authors Kilian Verhetsel, Jeanne Pellerin, J.-F. Remacle 

Publication date 30 June 2020

Published in Lecture Notes in Computational Science and Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-13992-6_5

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Computational aspects related to convexity (52B55)

Recommendations

• Efficiently hex-meshing things with topology
• Hexahedral mesh generation by successive dual cycle elimination
• Shelling hexahedral complexes for mesh generation
• Hexahedral mesh generation by medial surface subdivision: Part I. Solids with convex edges
• Linear complexity hexahedral mesh generation

Cites work

• A characterization of the quadrilateral meshes of a surface which admit a compatible hexahedral mesh of the enclosed volume
• Construction Techniques for Cubical Complexes, Odd Cubical 4-Polytopes, and Prescribed Dual Manifolds
• Efficiently hex-meshing things with topology
• Embarrassingly parallel search in constraint programming
• Handbook of constraint programming.
• Linear complexity hexahedral mesh generation
• Principles and Practice of Constraint Programming – CP 2004
• Recent Advances in Constraints
• Robust untangling of curvilinear meshes

This page was built for publication: A 44-element mesh of Schneiders' pyramid

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