As noticed by a helpful reviewer, the Box-based implementation of QuadtreeNode relies on potentially inefficient usage of pointers. He suggested to instead use something such as Vec<(u64, u32)> to store the entire tree with a method based on sorted Z-order curves/Morton code.
As noticed by a helpful reviewer, the
Box-based implementation ofQuadtreeNoderelies on potentially inefficient usage of pointers. He suggested to instead use something such asVec<(u64, u32)>to store the entire tree with a method based on sorted Z-order curves/Morton code.