The type of the data.
Constructs a new point octree.
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.
Protected
rootThe root octant.
Counts the points in the given octant.
An octant. Defaults to the root octant.
The amount of points.
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.
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.
Retrieves the data of the specified point.
A position.
The data that belongs to the given point, or null if it doesn't exist.
Finds the points that intersect with the given ray.
The raycaster.
The intersecting points.
Removes a point from the tree.
The point.
The data entry of the removed point or null if it didn't exist.
Inserts a point into the octree.
If the point exists in the tree already, the data entry will be replaced.
The point.
Data that belongs to the point.
Whether the operation was successful.
Generated using TypeDoc
An octree that manages points.