Binarized octree generation for Cartesian adaptive mesh refinement around immersed geometries
Jaber J. Hasbestan, Inanc Senocak

TL;DR
This paper introduces a binarized octree generation method that ensures exact Z-order curve compliance for adaptive mesh refinement around complex geometries, improving runtime performance with minimal memory overhead.
Contribution
The paper presents a novel binarized octree generation approach using red-black trees and Morton encoding, enhancing data locality and computational efficiency in AMR.
Findings
Outperforms linear octree generation in runtime performance
Maintains near-identical memory usage
Enables deeper mesh adaptation without hardware limitations
Abstract
We revisit the generation of balanced octrees for adaptive mesh refinement (AMR) of Cartesian domains with immersed complex geometries. In a recent short note [Hasbestan and Senocak, J. Comput. Phys. vol. 351:473-477 (2017)], we showed that the data-locality of the Z-order curve in hashed linear octree generation methods may not be perfect because of potential collisions in the hash table. Building on that observation, we propose a binarized octree generation method that complies with the Z-order curve exactly. Similar to a hashed linear octree generation method, we use Morton encoding to index the nodes of an octree, but use a red-black tree in place of the hash table. Red-black tree is a special kind of a binary tree, which we use for insertion and deletion of elements during mesh adaptation. By strictly working with the bitwise representation of the octree, we remove computer…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
