3 ms·
Isn't this kd-trees with arbitrarily oriented (not axis-aligned) hyperplanes?
by Lichtso 3y ago
Isn't this kd-trees with arbitrarily oriented (not axis-aligned) hyperplanes?
- esafak 3y agoThe hyperplanes are randomized to ensure the hyperplanes are probabilistically independent and to deal with high dimensionality, so the data are less likely to be clustered in the same bucket. https://en.wikipedia.org/wiki/Random_projection https://en.wikipedia.org/wiki/Random_projection
- a_e_k 3y agoIt's a binary space partitioning (BSP) [0]. A kd-tree is a special case of a BSP with axis-aligned hyperplanes. [0] https://en.wikipedia.org/wiki/Binary_space_partitioning https://en.wikipedia.org/wiki/Binary_space_partitioning