Hierarchical meshes for volume data
Citations Over TimeTop 10% of 2002 papers
Abstract
An algorithm for adaptive refinement of 3D meshes is presented. This algorithm can be applied for the generation of mesh hierarchies used for efficient volume visualization algorithms, e.g. iso-surface extraction or direct volume rendering, as well as for multilevel finite element computations. The aim was to construct an algorithm which generates as few congruence classes as possible. The main idea is to work with consistent partitions of the domain into tetrahedra and octahedra. The refinement consists of regular refinement rules which produce per element type one congruence class. In the case of local mesh refinement, for generating consistent subdivisions a temporary (virtual) closure is done based on suitable irregular refinement rules.
Related Papers
- → Error estimation and adaptive mesh generation in the 2D and 3D finite element method(1996)58 cited
- → A study on the streamer simulation using adaptive mesh generation and FEM-FCT(2001)33 cited
- An Adaptive Grid-Based All Hexahedral Meshing Algorithm Based on 2-Refinement(2010)
- → Mesh generation and mesh refinement procedures for the analysis of concrete shells(2002)10 cited
- → AUTOMATIC CARTESIAN GRID GENERATION FOR CFD ANALYSIS OF WIND ENVIRONMENT : Automatic generation of cost-effective grid using adaptive mesh refinement Part 2(2007)