Metric tree
From Wikipedia, the free encyclopedia
A metric tree is any tree data structures specialized to index data in metric spaces. Metric trees exploit properties of metric spaces such as the triangle inequality to make accesses to the data more efficient. Examples include vp-trees, cover trees, m-trees and bk trees.
