Constructor

Insert a point into kd-tree @note external point-buffer is used to reduce kd-tree's memory footprint @param iPoint index of point in external point-bu

second duplicate

first duplicate

Triangle with no vertices and no neighbors

estimates of expansion value

Query kd-tree for a nearest neighbor point @note external point-buffer is used to reduce kd-tree's memory footprint @param point query point position

Children setter for convenience

vector like convenience functions

Remap removing super-triangle: subtract 3 from vertices

Initialize KD-tree with points

Box that doesn't contain any point

Vertex with zero coordinates

Check if node is a leaf (has no valid children)

Find nearest point using R-tree

Add point to KD-tree

source line

Since KD-tree bulk load builds a balanced tree the maximum length of a queue can be pre-calculated: it is calculated as size of a completely filled tr