The geometric properties of finite element mesh are of great importance. The refinement algorithm leads often to very irregular elements. The problem of optimization of 3D‐meshes is unsolved at this time. Only fragmentary methods are known. This paper presents a new concept of optimization algorithm and compares three different strategies for subdivision of tetrahedral elements.
© 2001-2025 Fundación Dialnet · Todos los derechos reservados