Theory of linear and integer programming
Theory of linear and integer programming
Generation of structured hexahedral meshes in volumes with holes
Finite Elements in Analysis and Design
Using a computational domain and a three-stage node location procedure for multi-sweeping algorithms
Advances in Engineering Software
Design-driven quadrangulation of closed 3D curves
ACM Transactions on Graphics (TOG) - Proceedings of ACM SIGGRAPH Asia 2012
Hexahedral mesh generation for geometry with multi-featured constraints
ICIC'13 Proceedings of the 9th international conference on Intelligent Computing Theories
| Hi-index | 0.00 |
The submapping method is one of the most widely used techniques to generate structured quadrilateral meshes. This method splits the geometry into pieces logically equivalent to a quadrilateral. Then, it meshes each piece keeping the mesh compatibility between them by solving an integer linear problem. The main limitation of submapping algorithms is that it can only be applied to geometries in which the angle between two consecutive edges is, approximately, an integer multiple of @p/2. In addition, special procedures are required in order to apply it to multiply connected domains. This article presents two original modifications to mitigate these shortcomings. Finally, it presents several numerical examples that show the applicability of the developed algorithms.