Graph Theory with Applications to Engineering and Computer Science (Prentice Hall Series in Automatic Computation)
Mesh Generation: Application to Finite Elements
Mesh Generation: Application to Finite Elements
Generation of structured meshes in multiply connected surfaces using submapping
Advances in Engineering Software
A new least-squares approximation of affine mappings for sweep algorithms
Engineering with Computers - Special Issue: 14th International Meshing Roundtable in 2005. Guest Editor: Byron W. Hanks
An automatic and general least-squares projection procedure for sweep meshing
Engineering with Computers - Special Issue: 15th International Meshing Roundtable in 2006. Guest Editors: Philippe P. Pébay and Alan M. Shih (pp. 339 - 406). Original Articles (pp. 407 - 448)
Boundary aligned smooth 3D cross-frame field
Proceedings of the 2011 SIGGRAPH Asia Conference
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 used techniques to generate structured hexahedral meshes. This method splits the geometry into pieces logically equivalent to an hexahedron. Then, it meshes each patch keeping the mesh compatibility between pieces by solving an integer linear problem. The quality of the final discretization is governed by the objective function that defines the linear problem. Thus, in this work we propose a new objective function that better distributes the number of intervals among the edges of the geometry. In addition, special procedures have to be developed in order to apply the submapping method to volumes with holes. This article also presents two original contributions to efficiently mesh geometries that contain holes. Finally, it presents several numerical examples that show the applicability of the developed algorithms.