Struct BBTree Extends IDisposable

BBTree (

UnsafeSpan<int>	triangles	The triangles. Each triplet of 3 indices represents a node. The triangles are assumed to be in clockwise order.
UnsafeSpan<Int3>	vertices	The vertices of the triangles.

)

Build a BBTree from a list of triangles.

void Dispose ()

float DistanceSqrLowerBound (

float3	p
inProjectionParams	projection

)

void DrawGizmos (

CommandBuilder

draw

)

void DrawGizmos (

ref CommandBuilder	draw
int	boxi
int	depth

)

void QueryClosest (

float3	p	Point to search around
NNConstraint	constraint	Optionally set to constrain which nodes to return
inProjectionParams	projection	Projection parameters derived from the constraint
ref float	distanceSqr	The best squared distance for the previous solution. Will be updated with the best distance after this search. Supply positive infinity to start the search from scratch.
refNNInfo	previous	This search will start from the previous NNInfo and improve it if possible. Will be updated with the new result. Even if the search fails on this call, the solution will never be worse than previous.
GraphNode[]	nodes	The nodes what this BBTree was built from
UnsafeSpan<int>	triangles	The triangles that this BBTree was built from
UnsafeSpan<Int3>	vertices	The vertices that this BBTree was built from

)

Queries the tree for the closest node to p constrained by the NNConstraint trying to improve an existing solution.

Note that this function will only fill in the constrained node. If you want a node not constrained by any NNConstraint, do an additional search with constraint = NNConstraint.None

void Build (

refUnsafeSpan<int>	triangles
refUnsafeSpan<Int3>	vertices
outBBTree	bbTree

)

int BuildSubtree (

NativeArray<int>	permutation
NativeArray<IntRect>	nodeBounds
ref UnsafeList<int>	nodes
ref UnsafeList<BBTreeBox>	tree
int	from
int	to
bool	odd
int	depth

)

IntRect NodeBounds (

NativeArray<int>	permutation
NativeArray<IntRect>	nodeBounds
int	from
int	to

)

Calculates the bounding box in XZ space of all nodes between from (inclusive) and to (exclusive)

int SplitByX (

NativeArray<IntRect>	nodesBounds
NativeArray<int>	permutation
int	from
int	to
int	divider

)

int SplitByZ (

NativeArray<IntRect>	nodesBounds
NativeArray<int>	permutation
int	from
int	to
int	divider

)

IntRect Size

UnsafeList<int> nodePermutation

UnsafeList<BBTreeBox> tree

Holds all tree nodes.

const int MAX_TREE_HEIGHT = 26

const int MaximumLeafSize = 4

DistanceMetric