Relaxed k-d tree
id:
relaxed-k-d-tree-297-15017922
title:
Relaxed k-d tree
text:
A relaxed K-d tree or relaxed K-dimensional tree is a data structure which is a variant of K-d trees. Like K-dimensional trees, a relaxed K-dimensional tree stores a set of n-multidimensional records, each one having a unique K-dimensional key x=(x0,... ,xK−1). 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.
brand slug:
wiki
category slug:
encyclopedia
description:
Multidimensional search tree for spatial coordinates.
original url:
https://en.wikipedia.org/wiki/Relaxed_k-d_tree
date created:
date modified:
2024-04-20T17:55:29Z
main entity:
{"identifier":"Q24882695","url":"https://www.wikidata.org/entity/Q24882695"}
image:
fields total:
13
integrity:
14