Lp Centroidal Voronoi Tessellation and its applications
ACM SIGGRAPH 2010 papers
Simulation of multistage excavation based on a 3D spectral-element method
Computers and Structures
Simplification of hexahedral mesh
ACM SIGGRAPH 2012 Posters
All-hex meshing using singularity-restricted field
ACM Transactions on Graphics (TOG) - Proceedings of ACM SIGGRAPH Asia 2012
Efficiently hex-meshing things with topology
Proceedings of the twenty-ninth annual symposium on Computational geometry
| Hi-index | 0.00 |
For finite element analyses within highly elastic and plastic structural domains, hexahedral meshes have historically offered some benefits over tetrahedral finite element meshes in terms of reduced error, smaller element counts, and improved reliability. However, hexahedral finite element mesh generation continues to be difficult to perform and automate, with hexahedral mesh generation taking several orders of magnitude longer than current tetrahedral mesh generators to complete. Thus, developing a better understanding of the underlying constraints that make hexahedral meshing difficult could result in dramatic reductions in the amount of time necessary to prepare a hexahedral finite element model for analysis. In this paper, we present a survey of constraints associated with hexahedral meshes (i.e., the conditions that must be satisfied to produce a hexahedral mesh). In presenting our formulation of these constraints, we will utilize the dual of a hexahedral mesh. We also discuss how incorporation of these constraints into existing hexahedral mesh generation algorithms could be utilized to extend the class of geometries to which these algorithms apply. We also describe a list of open problems in hexahedral mesh generation and give some context for future efforts in addressing these problems.