Open
Description
With SpatialTreeInterface, we could very easily write a wrapper, that has special dispatches for the depth first searches. It seems quite common that you do tree queries over a grid (though rasterization may be faster in many cases). Having the ability to not be rigid on the number of children but rather directly decompose to the set of all intersecting cells could be cool.
Maybe that needs a higher level API in SpatialTreeInterface though, that has a performant default implementation but can be overridden. e.g. eachmatchingchild(predicate, node1, node2).
This can also be used to enable arbitrary accelerations within the query nodes.
cc @meggart