The type of the data.
Constructs a new point octree.
The type of the data.
The lower bounds of the tree.
The upper bounds of the tree.
An octant boundary bias. The octree is considered "loose" with a bias greater than 0.
The maximum amount of distinct points per leaf octant.
The maximum tree depth level, starting at 0.
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.
Counts the points in the given octant.
An octant. Defaults to the root octant.
The amount of points.
Recursively collects nodes that intersect with the specified region.
A region.
The nodes.
Finds the closest point to the given one.
A point.
An upper limit for the distance between the points.
Whether a point that is exactly at the given position should be skipped.
The nearest point, or null if there is none.
Fetches all nodes of a specific depth level.
The depth level.
The nodes.
Finds points within a specific radius around a given point.
A position.
A radius.
Whether a point that is exactly at the given position should be skipped.
A list of points.
Returns the octree bias.
The bias.
Calculates the current depth of this octree.
The depth.
Finds nodes that intersect with the given ray. The intersecting nodes are sorted by distance, closest first.
A raycaster.
The intersecting nodes.
Returns the maximum tree depth.
The maximum tree depth.
Returns the maximum amount of points per leaf octant.
The maximum amount of points per leaf octant.
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.
Finds the points that intersect with the given ray.
The raycaster.
The intersecting points.
An octree that manages points.