VP- tree
22,99 €
inkl. MwSt.

Versandfertig in 6-10 Tagen
payback
11 °P sammeln
  • Broschiertes Buch

High Quality Content by WIKIPEDIA articles! A vantage point tree, or vp-tree is a BSP tree that segregates data in a metric space by choosing a position in the space (the "vantage point") and dividing the data points into two partitions: those that are nearer to the vantage point than a threshold, and those that are not. By repeatedly applying this procedure to partition the data into smaller and smaller sets, a tree data structure is created where neighbors in the tree are likely to be neighbors in the space.This iterative partitioning process is similar to that of a kd-tree, but uses…mehr

Andere Kunden interessierten sich auch für
Produktbeschreibung
High Quality Content by WIKIPEDIA articles! A vantage point tree, or vp-tree is a BSP tree that segregates data in a metric space by choosing a position in the space (the "vantage point") and dividing the data points into two partitions: those that are nearer to the vantage point than a threshold, and those that are not. By repeatedly applying this procedure to partition the data into smaller and smaller sets, a tree data structure is created where neighbors in the tree are likely to be neighbors in the space.This iterative partitioning process is similar to that of a kd-tree, but uses circular (or spherical, hyperspherical, etc) rather than rectilinear partitions. In 2D Euclidean space, this can be visualized as a series of circles segregating the data.