			Home About us Contact

Hexahedral Meshes (hexahedral + mesh)

Distribution by Scientific Domains

Engineering	100%

Selected Abstracts

Hexahedral Mesh Matching: Converting non-conforming hexahedral-to-hexahedral interfaces into conforming interfaces

INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN ENGINEERING, Issue 12 2010
Matthew L. Staten
Abstract This paper presents a new method, called Mesh Matching, for handling non-conforming hexahedral-to-hexahedral interfaces for finite element analysis. Mesh Matching modifies the hexahedral element topology on one or both sides of the interface until there is a one-to-one pairing of finite element nodes, edges and quadrilaterals on the interface surfaces, allowing mesh entities to be merged into a single conforming mesh. Element topology is modified using hexahedral dual operations, including pillowing, sheet extraction, dicing and column collapsing. The primary motivation for this research is to simplify the generation of unstructured all-hexahedral finite element meshes. Mesh Matching relaxes global constraint propagation which currently hinders hexahedral meshing of large assemblies, and limits its extension to parallel processing. As a secondary benefit, by providing conforming mesh interfaces, Mesh Matching provides an alternative to artificial constraints such as tied contacts and multi-point constraints. The quality of the resultant conforming hexahedral mesh is high and the increase in number of elements is moderate. Copyright © 2009 John Wiley & Sons, Ltd. [source]

A 3D incompressible Navier,Stokes velocity,vorticity weak form finite element algorithm

INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN FLUIDS, Issue 2 2002
K. L. Wong
Abstract The velocity,vorticity formulation is selected to develop a time-accurate CFD finite element algorithm for the incompressible Navier,Stokes equations in three dimensions. The finite element implementation uses equal order trilinear finite elements on a non-staggered hexahedral mesh. A second order vorticity kinematic boundary condition is derived for the no slip wall boundary condition which also enforces the incompressibility constraint. A biconjugate gradient stabilized (BiCGSTAB) sparse iterative solver is utilized to solve the fully coupled system of equations as a Newton algorithm. The solver yields an efficient parallel solution algorithm on distributed-memory machines, such as the IBM SP2. Three dimensional laminar flow solutions for a square channel, a lid-driven cavity, and a thermal cavity are established and compared with available benchmark solutions. Copyright © 2002 John Wiley & Sons, Ltd. [source]

Surface smoothing and quality improvement of quadrilateral/hexahedral meshes with geometric flow,

INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN BIOMEDICAL ENGINEERING, Issue 1 2009
Yongjie Zhang
Abstract This paper describes an approach to smooth the surface and improve the quality of quadrilateral/hexahedral meshes with feature preserved using geometric flow. For quadrilateral surface meshes, the surface diffusion flow is selected to remove noise by relocating vertices in the normal direction, and the aspect ratio is improved with feature preserved by adjusting vertex positions in the tangent direction. For hexahedral meshes, besides the surface vertex movement in the normal and tangent directions, interior vertices are relocated to improve the aspect ratio. Our method has the properties of noise removal, feature preservation and quality improvement of quadrilateral/hexahedral meshes, and it is especially suitable for biomolecular meshes because the surface diffusion flow preserves sphere accurately if the initial surface is close to a sphere. Several demonstration examples are provided from a wide variety of application domains. Some extracted meshes have been extensively used in finite element simulations. Copyright © 2007 John Wiley & Sons, Ltd. [source]

Octree-based reasonable-quality hexahedral mesh generation using a new set of refinement templates

INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN ENGINEERING, Issue 13 2009
Yasushi Ito
Abstract An octree-based mesh generation method is proposed to create reasonable-quality, geometry-adapted unstructured hexahedral meshes automatically from triangulated surface models without any sharp geometrical features. A new, easy-to-implement, easy-to-understand set of refinement templates is developed to perform local mesh refinement efficiently even for concave refinement domains without creating hanging nodes. A buffer layer is inserted on an octree core mesh to improve the mesh quality significantly. Laplacian-like smoothing, angle-based smoothing and local optimization-based untangling methods are used with certain restrictions to further improve the mesh quality. Several examples are shown to demonstrate the capability of our hexahedral mesh generation method for complex geometries. Copyright © 2008 John Wiley & Sons, Ltd. [source]

The generation of hexahedral meshes for assembly geometry: survey and progress,

INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN ENGINEERING, Issue 12 2001
Timothy J. Tautges
Abstract The finite element method is being used today to model component assemblies in a wide variety of application areas, including structural mechanics, fluid simulations, and others. Generating hexahedral meshes for these assemblies usually requires the use of geometry decomposition, with different meshing algorithms applied to different regions. While the primary motivation for this approach remains the lack of an automatic, reliable all-hexahedral meshing algorithm, requirements in mesh quality and mesh configuration for typical analyses are also factors. For these reasons, this approach is also sometimes required when producing other types of unstructured meshes. This paper will review progress to date in automating many parts of the hex meshing process, which has halved the time to produce all-hex meshes for large assemblies. Particular issues which have been exposed due to this progress will also be discussed, along with their applicability to the general unstructured meshing problem. Published in 2001 by John Wiley & Sons, Ltd. [source]