Jump to content

Vantage-point tree

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by 216.249.144.14 (talk) at 22:54, 10 October 2005 (A bit above my head, but there should be an article on it). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

A vantage point tree, or vp-tree is a BSP tree that segregates data in a metric space by using decreasing metric values.

In 2D Euclidean space, this can be visualized as a series of circles segregating the data. It is particularly useful in dividing data in a non standard metric space into a BSP tree.

Paper describing a VP-Tree