|
Abstract : |
Hexahedral elements can be subdivided anisotropically without mesh quality problems that are associated with tetrahedral meshes. Furthermore, hexahedral meshes yield more accurate solutions than their tetrahedral counterparts for the same number of edges. Our adaption procedure uses an edge data structure that facilitates efficient subdivision by allowing individual edges to be marked for refinement or coarsening. Pyramids and prisms are used as buffer elements between refined and unrefined hexahedra to eliminate hanging vertices. Preliminary results indicate that this new adaption procedure is a viable alternative to adaptive tetrahedral schemes., |
