Modified BSP-tree algorithms {kd-tree} {k-dimensional tree} can use only hyperplanes perpendicular to space axes and use axis sequences, typically splitting at axis or polygon medians. If space has k axes, kd-tree has k cuts and tree branchings. kd-tree algorithms are better for searches using nearest neighbors, because they match space coordinate parameters and split hyperplanes go through points. Because hyperplanes are across axes, all regions have nodes or points.
Mathematical Sciences>Computer Science>Systems>Computer Vision>Algorithms>Depth
3-Computer Science-Systems-Computer Vision-Algorithms-Depth
Outline of Knowledge Database Home Page
Description of Outline of Knowledge Database
Date Modified: 2022.0224