Linear complexity hexahedral mesh generation
From MaRDI portal
Recommendations
Cited in
(16)- Combinatorial groupoids, cubical complexes, and the Lovász Conjecture
- Quad mesh generation for \(k\)-sided faces and hex mesh generation for trivalent polyhedra
- Quadrilateral surface meshes without self-intersecting dual cycles for hexahedral mesh generation
- A class of network optimization methods for planar grid generation
- Refinable tri-variate \(C^1\) splines for box-complexes including irregular points and irregular edges
- Quadrilateral and hexahedral mesh generation based on surface foliation theory
- Harmonic hexahedral structured grid generation
- Surface cubications mod flips
- Shelling hexahedral complexes for mesh generation
- PERFORMANCE COMPARISON OF VARIOUS HEXAHEDRAL ELEMENT QUALITY METRICS VIA PARAMETRIC DISTORTION OF AN IDEAL ELEMENT
- A 44-element mesh of Schneiders' pyramid
- Construction Techniques for Cubical Complexes, Odd Cubical 4-Polytopes, and Prescribed Dual Manifolds
- Efficiently hex-meshing things with topology
- Efficiently hex-meshing things with topology
- How close is a quad mesh to a polycube?
- Tetrahedral decompositions of hexahedral meshes
This page was built for publication: Linear complexity hexahedral mesh generation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1286469)