Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Relaxed k-d tree
open-in-new
<p>A relaxed <i>K</i>-d tree or relaxed <i>K</i>-dimensional tree is a data structure which is a variant of <a href="/facts/K-d_tree/XuhcfKKq">K-d trees</a>. Like K-dimensional trees, a relaxed K-dimensional tree stores a set of n-multidimensional records, each one having a unique K-dimensional key <i>x=(x0,... ,xK−1)</i>. Unlike K-d trees, in a relaxed K-d tree, the discriminants in each node are arbitrary. Relaxed K-d trees were introduced in 1998. </p>