2506 Quadrilateral mesh without self-intersection for further hexahedral mesh generation

2002 ◽  
Vol 2002.5 (0) ◽  
pp. 181-182
Author(s):  
Olga EGOROVA ◽  
Junichi SHINODA ◽  
Haozhi QU ◽  
Ichiro HAGIWARA
Keyword(s):  
Mesh Generation ◽  
Hexahedral Mesh ◽  
Quadrilateral Mesh ◽  
Hexahedral Mesh Generation

Characteristic Topology Method for Quadrilateral Mesh Without Self-Intersection of Dual Cycles

2002 ◽  
Author(s):  
Junichi Shinoda ◽  
Olga Egorova ◽  
Haozhi Qu ◽  
Ichiro Hagiwara
Keyword(s):  
Initial Data ◽  
Mesh Generation ◽  
Dual Graph ◽  
Surface Mesh ◽  
Hexahedral Mesh ◽  
Quadrilateral Mesh ◽  
Hexahedral Mesh Generation ◽  
Dual Cycle ◽  
The Given ◽  
Polygonal Model

The Dual Cycle Elimination method was proposed by Mu¨ller-Hannemann for hexahedral mesh generation. The method begins with a surface quadrilateral mesh whose dual cycles have no self-intersections and, after the elimination of dual cycles, a hexahedral mesh is generated while tracing back the reverse order of eliminations and supplementing hexahedrons inside the object step by step. This paper presents the Characteristic Topology Method as a means to prescribe a quadrilateral surface mesh that can be initial data for further hexahedral mesh generation. The goal of this method is to stress the topology of the given surface and thus use construction of the loops within the algorithm. The surface is given in a nodal polygonal model and then decomposed into a triangle-quadrilateral model. Templates are used to determine the loops. Then due to some rules every loop is implemented by special additional Dual Cycles. The total mesh is the dual graph to the graph of dual cycles. The problem of self-intersections that may appear comes from Mu¨ller-Hannemann’s approach stated above and that is also implemented in this work as a sketch.

An Automatic Hexahedral Mesh Generation to Control Shape of Elements

2007 ◽  
Vol 43 (4) ◽  
pp. 1505-1508 ◽  
Author(s):  
Hirotomo Fujimori ◽  
So Noguchi ◽  
Hajime Igarashi ◽  
Hideo Yamashita
Keyword(s):  
Mesh Generation ◽  
Hexahedral Mesh ◽  
Hexahedral Mesh Generation

scholarly journals Hexahedral Mesh Generation using the Embedded Voronoi Graph

1999 ◽  
Vol 15 (3) ◽  
pp. 248-262 ◽  
Author(s):  
A. Sheffer ◽  
M. Etzion ◽  
A. Rappoport ◽  
M. Bercovier
Keyword(s):  
Mesh Generation ◽  
Hexahedral Mesh ◽  
Hexahedral Mesh Generation ◽  
Voronoi Graph

OCTREE-BASED HEXAHEDRAL MESH GENERATION

2000 ◽  
Vol 10 (04) ◽  
pp. 383-398 ◽  
Author(s):  
ROBERT SCHNEIDERS
Keyword(s):  
Mesh Generation ◽  
Hexahedral Mesh ◽  
Element Mesh ◽  
Hexahedral Mesh Generation ◽  
Hexahedral Element

An octree-based algorithm for the generation of hexahedral element meshes is presented. The algorithm works in three steps: (i) The geometry to be meshed is approximated by an octree structure. (ii) An unstructured hexahedral element mesh is derived from the octree. (iii) The mesh is adapted to the boundary of the geometry. We focus on step (ii) and describe an algorithm that constructs a hex mesh for a given octree structure.

Automatic Hexahedral Mesh Generation with Feature Line Extraction

2007 ◽  
pp. 453-467 ◽  
Author(s):  
Masayuki Hariya ◽  
Ichiro Nishigaki ◽  
Ichiro Kataoka ◽  
Yoshimitsu Hiro
Keyword(s):  
Mesh Generation ◽  
Hexahedral Mesh ◽  
Line Extraction ◽  
Feature Line ◽  
Hexahedral Mesh Generation
Sign in / Sign up

Export Citation Format

Share Document