The Hashed-Octree approach is developed as an improvement to the standard octree data structure made suitable for parallel processing. This variant of the octree data structure attempts to parallelize the hierarchical method through adaptive domain decomposition, dynamic load-balancing across processors, and parallel interaction computation.
openframeworks astrophysics n-body-simulator morton-order interactive-visualizations orbital-mechanics octree-partitioning approximation-algorithms barnes-hut-algorithm spatial-decomposition cpp-programming hashnode center-of-mass octree-algorithms cartesian-coordinates universal-gravitation scene-navigation
-
Updated
Jul 30, 2025 - C