Given that in morton representation, the subset of a "set" is completely a subarray of its parent, so we can calculate the significance values all together, save it in a bitmask (or just a char array), and then just read the significant values from it!
I think this optimization will have a fairly big impact on the performance!
Given that in morton representation, the subset of a "set" is completely a subarray of its parent, so we can calculate the significance values all together, save it in a bitmask (or just a char array), and then just read the significant values from it!
I think this optimization will have a fairly big impact on the performance!