The children of this node.
The upper bounds of the node.
The lower bounds of this node.
Recursively collects nodes that intersect with the specified region.
A region.
The nodes.
Fetches all nodes of a specific depth level.
The depth level.
The nodes.
Calculates the current depth of this octree.
The depth.
Returns an iterator that traverses the octree and returns leaf nodes.
When a cull region is provided, the iterator will only return leaves that intersect with that region.
A cull region.
An iterator.
A pointer-based octree that subdivides space for fast spatial searches.