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.
Attributes | Values |
---|
rdfs:label
| - Arbre kd relaxé (fr)
- Relaxed k-d tree (en)
|
rdfs:comment
| - Un arbre kd relaxé ou arbre à k-dimension relaxé est une structure de données qui est une variante de l'arbre kd. Comment les arbres kd, un arbre kd relaxé stocke un ensemble de données à n-dimensions, chacune ayant une unique étiquette à K-dimensions x=(x0,... ,xK−1). Contrairement aux arbres kd, dans un arbre kd relaxé, le discriminant dans chaque nœud est arbitraire. Les arbres kd relaxés ont été introduits en 1998. (fr)
- 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. (en)
|
name
| |
dcterms:subject
| |
Wikipage page ID
| |
Wikipage revision ID
| |
Link from a Wikipage to another Wikipage
| |
sameAs
| |
space avg
| |
space worst
| |
dbp:wikiPageUsesTemplate
| |
type
| - Multidimensional BST (en)
|
has abstract
| - Un arbre kd relaxé ou arbre à k-dimension relaxé est une structure de données qui est une variante de l'arbre kd. Comment les arbres kd, un arbre kd relaxé stocke un ensemble de données à n-dimensions, chacune ayant une unique étiquette à K-dimensions x=(x0,... ,xK−1). Contrairement aux arbres kd, dans un arbre kd relaxé, le discriminant dans chaque nœud est arbitraire. Les arbres kd relaxés ont été introduits en 1998. (fr)
- 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. (en)
|
delete avg
| |
delete worst
| |
insert avg
| |
insert worst
| |
invented by
| - Amalia Duch, Vladimir Estivill-Castro and Conrado Martínez (en)
|
invented year
| |
search avg
| |
search worst
| |
prov:wasDerivedFrom
| |
page length (characters) of wiki page
| |
foaf:isPrimaryTopicOf
| |
is Link from a Wikipage to another Wikipage
of | |
is foaf:primaryTopic
of | |