Method to generate complex computational meshes efficiently
| Autor: | F. Landertshamer, H. Steffan |
|---|---|
| Rok vydání: | 1994 |
| Předmět: |
Computer science
Applied Mathematics General Engineering Volume mesh T-vertices Finite element method Mathematics::Numerical Analysis law.invention Computational science Computer Science::Graphics Computational Theory and Mathematics Mesh generation law Modeling and Simulation Image-based meshing Polygon mesh Cartesian coordinate system Static mesh Algorithm Software ComputingMethodologies_COMPUTERGRAPHICS |
| Zdroj: | Communications in Numerical Methods in Engineering. 10:373-384 |
| ISSN: | 1069-8299 |
| DOI: | 10.1002/cnm.1640100503 |
| Popis: | The paper demonstrates an approach to generate three-dimensional boundary-fitted computational meshes efficiently. One basic idea underlying the present study is that often similar geometries have to be meshed, and therefore an efficient mesh-adaption method, which allows adaptation of the topological mesh to the specific geometry, would be more efficient than generating all new meshes. On the other hand the mesh generation for Cartesian topologies has been shown to be a very simple task. It can be executed by connecting and removing brick elements to a basic cube. In connection with a so-called ‘Macro Command Language’, a high degree of automation can be reached when adapting topologically defined meshes to a surface. Furthermore, a high mesh quality has proved to be the key to good simulation results. During the mesh generation it is important to provide the possibility of modifiying the mesh quality and also the mesh density at any time of the meshing process. Using this generation method the meshing time is reduced—e.g. a computational mesh for a two-valve cylinder head can be generated within a few hours. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|