Class PointKDTree

Public

Represents a collection of GraphNodes.

It allows for fast lookups of the closest node to a point.

See

https://en.wikipedia.org/wiki/K-d_tree

Inner Types

CompareX
CompareY
CompareZ
Node

Public Methods

Add (...)

...

GetInRange (point, sqrRadius, buffer)

Add all nodes within a squared distance of the point to the buffer.

GetNearest (point, constraint, distanceSqr)

Closest node to the point which satisfies the constraint and is at most at the given distance.

GetNearestConnection (point, constraint, maximumSqrConnectionLength)

Closest node to the point which satisfies the constraint.

Rebuild (nodes, start, end)

Rebuild the tree starting with all nodes in the array between index start (inclusive) and end (exclusive)

Remove (...)

Public Static Variables

LeafArraySize
Public Static
LeafSize
Public Static

Private/Protected Members

Build (index, nodes, start, end)
CollectAndClear (index, buffer)
EnsureSize (index)
GetInRangeInternal (index, point, sqrRadius, buffer)
GetNearestConnectionInternal (index, point, constraint, best, bestSqrDist, distanceThresholdOffset)
GetNearestInternal (index, point, constraint, best, bestSqrDist)
MaxAllowedSize (numNodes, depth)
Rebalance (index)
Size (index)
arrayCache
Private Readonly
comparers
Private Static Readonly
largeList
Private Readonly
numNodes
Private
tree
Private