carrier image

AHF: Array-Based Half-Facet Data Structure for Mixed-Dimensional and Non-manifold Meshes

Dyedov, Vladimir, Navamita Ray, Daniel Einstein, Xiangmin Jiao, and Timothy J. Tautges

22nd International Meshing Roundtable, Springer-Verlag, pp.445-464, October 13-16 2013


22nd International Meshing Roundtable
Orlando, FL
October 13-16,2013

Dept. of Applied Math. & Statistics, Stony Brook University, Stony Brook, NY 11744
Biological Sciences Division, Pacific Northwest National Laboratory, Richland, WA 99352
Math. & Computer Science Division, Argonne National Laboratory, Argonne, IL 60439

We present an Array-based Half-Facet mesh data structure, or AHF, for efficient mesh query and modification operations. The AHF extends the compact array-based half-edge and half-face data structures (T.J. Alumbaugh and X. Jiao, Compact array-based mesh data structures, IMR, 2005) to support mixeddimensional and non-manifold meshes. The design goals of our data structure include generality to support such meshes, efficiency of neighborhood queries and mesh modification, compactness of memory footprint, and facilitation of interoperability of mesh-based application codes. To accomplish these goals, our data structure uses sibling half-facets as a core abstraction, coupled with other explicit and implicit representations of entities. A unique feature of our data structure is a comprehensive implementation in MATLAB, which allows rapid prototyping, debugging, testing, and deployment of meshing algorithms and other mesh-based numerical methods. We have also developed C++ implementation built on top of MOAB (T.J. Tautges, R. Meyers, and K. Merkley, MOAB: A Mesh-Oriented Database, Sandia National Laboratories, 2004). We present some comparisons of the memory requirements and computational costs, and also demonstrate its effectiveness with a few sample applications.

Download Full Paper (PDF Format)

Contact author(s) or publisher for availability and copyright information on above referenced article