[REQUEST] Primitives for bottom-up traversal of a Tree about openvdb HOT 2 CLOSED

@danrbailey Thank you very much for the prompt reply. From our development team, we appreciate it a lot 🙏

from openvdb.

Hi @YoshuaNava, the decision was made early in the design of VDB to not store bi-directional pointers. Although there are some small memory benefits, this is mainly because any topology-changing operation would otherwise require additional bookkeeping work that we want to avoid.

Instead, we provide bottom-up traversal using the NodeManager which also offers parallel access to the nodes at each level of the tree:

https://github.com/AcademySoftwareFoundation/openvdb/blob/master/openvdb/openvdb/tree/NodeManager.h#L435

With an example of doing this being the pruning tools:

https://github.com/AcademySoftwareFoundation/openvdb/blob/master/openvdb/openvdb/tools/Prune.h

In all cases where an algorithm has needed the access pattern you describe, we've been able to re-engineer it to use an alternative approach like that provided by foreachBottomUp().

from openvdb.