A pointer-based octree that subdivides space for fast spatial searches.
Constructs a new octree.
The root node. See Octant or CubicOctant.
Protected
The root octant.
The children of this node.
The upper bounds of the node.
The lower bounds of this node.
Returns an iterator that traverses the octree and returns all leaf nodes.
An iterator.
Recursively collects nodes that intersect with the specified region.
A region.
The nodes.
Fetches all nodes of a specific depth level.
The depth level.
Calculates the center of this node.
A vector to store the result in.
A vector that describes the center of this node.
Calculates the current depth of this octree.
The depth.
Calculates the size of this node.
A vector that describes the size of this node.
Finds nodes that intersect with the given ray. The intersecting nodes are sorted by distance, closest first.
A raycaster.
The intersecting nodes.
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.
Generated using TypeDoc
A pointer-based octree that subdivides space for fast spatial searches.