Algorithms and Data Structures for Handling a Fully Flexible Refinement Approach in Mesh Generation
Hitschfeld, N.
Proceedings, 4th International Meshing Roundtable, Sandia National Laboratories, pp.265-276, October 1995
This paper presents new algorithms and data structures required for the generation of grids based on mixed element trees and using flexible refinement approach. Mixed elements trees is an extension of modified octrees that uses well-shaped primitives such as cuboids, prisms, pyramids and tetrahedra as internal nodes. A flexible refinement approach fits the object geometry and fulfills the required mesh density by partitioning the elements at an optional point at each refinement step. This allows the fitting of more general 3-D object geometries and the reduction of grid points in comparison with previous grid generators but it requires more complex algorithms and data structures in its implementation.
Download Full Paper (Postscript Format)
Contact author(s) or publisher for availability and copyright information on above referenced article