Extracting Hexahedral Mesh Structures from Balanced Linear Octrees

Tiankai Tu, & David O'Hallaron

Published September 2004, SCEC Contribution #891

Generating large 3D unstructured meshes with over 1 billion elements has been a challenging task. Fortunately, for a large class of applications with relatively simple geometries, unstructured octree-based hexahedral meshes provide a good compromise between adaptivity and simplicity. This paper presents our recent work on how to extract hexahedral mesh structures from a class of database structures known as balanced linear octrees. The proposed technique is not memory bound and is capable of extracting mesh structures with billions of elements and nodes, provided there is enough disk space to store the mesh. In practice, our new algorithm runs about 11 times faster than a conventional database search-based algorithm and uses only 10% of the storage space.

Key Words
balanced linear octree, unstructured hexahedral mesh, mesh database, two-level bucket sort, dangling and anchored nodes

Tu, T., & O'Hallaron, D. (2004, 9). Extracting Hexahedral Mesh Structures from Balanced Linear Octrees. Poster Presentation at 13th International Meshing Roundtable. http://www.imr.sandia.gov/papers/imr13/tu.pdf