Balance Refinement of Massive Linear Octrees
Tiankai Tu, David R. O’Hallaron · 2004
This paper presents a solution to the problem of balance refinement of massive linear octrees. We combine existing database techniques (B-tree, bulk loading, and range queries) with new algorithms (balance by parts, prioritized ripple propagation) and data structures (the cache octree) into a unified framework that provides new capabilities for large scientific applications.