Alternative is PCP-Tree
Zatloukal, Johnson, Ladner (1999)
Organize a tree using principal components partitioning.
- Partition the data perpendicular to the line that minimizes the sum of the distances of the points to the line. Eigenvector computation required.
About is easy to construct as the k-d tree.
In NNS processing per node in the PCP tree is more expensive than in the k-d tree, but fewer codewords are searched.