Constrained Triangulation: Application to Hex-Dominant Mesh Generation

نویسنده

  • Steven J. Owen
چکیده

Boundary-constrained triangulation has long been the domain of Delaunay mesh generation. Another application for constrained triangulation is introduced in this work. A new technique for hexahedral-dominant mesh generation is developed. With this method, known as Hex-Morphing (H-Morph), an initial tetrahedral mesh is provided. The quadrilateral faces of the hexahedra are treated as internal surfaces, which must be recovered. Local transformations are performed on the simplices so that the six quadrilateral faces of a hexahedron have been recovered from the mesh. All tetrahedra internal to the six faces can subsequently be eliminated and a hexahedra formed in their place. Examples and performance of the H-Morph algorithm are presented.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hex-dominant mesh generation using 3D constrained triangulation

A method for decomposing a volume with a prescribed quadrilateral surface mesh, into a hexahedral-dominated mesh is proposed. With this method, known as Hex-kforphing (HMorph), an initial tetrahedral mesh is provided. Tetrahedral are transformed and combined starting from the boundary and working towards the interior of the volume. The quadrilateral faces of the hexahedra are treated as interna...

متن کامل

Tensor-Guided Hex-Dominant Mesh Generation with Targeted All-Hex Regions

In this paper, we present a method for generating hex-dominant meshes with targeted all-hex regions over closed volumes. The method begins by generating a piecewise-continuous metric tensor field over the volume. This field specifies desired anisotropy and directionality during the subsequent meshing stages. Meshing begins with field-guided tiling of individual structured hexahedral fronts wher...

متن کامل

Quality guaranteed all-hex mesh generation by a constrained volume iterative fitting algorithm

The hexahedral mesh (hex mesh) is usually preferred to the tetrahedral mesh (tet mesh) in finite element methods for numerical simulation. In finite element analysis, a valid hex mesh requires that the scaled Jacobian value at each mesh vertex is larger than 0. However, the hex mesh produced by lots of prevailing hex mesh generation methods cannot be guaranteed to be a valid hex mesh. In this p...

متن کامل

Hex-Dominant Mesh Generation with Directionality Control via Packing Rectangular Solid Cells

A new computational method that creates a hex-dominant mesh of an arbitrary 3D geometric domain is presented. The proposed method generates a high-quality hexdominant mesh by: (1) controlling the directionality of the output hex-dominant mesh; and (2) avoiding ill-shaped elements induced by nodes located too closely to each other. The proposed method takes a 3D geometric domain as input and cre...

متن کامل

Polyhedral Mesh Generation

A new methodology to generate a hex-dominant mesh is presented. From a closed surface and an initial all-hex mesh that contains the closed surface, the proposed algorithm generates, by intersection, a new mostly-hex mesh that includes polyhedra located at the boundary of the geometrical domain. The polyhedra may be used as cells if the field simulation solver supports them or be decomposed into...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999