About: K-d tree

An Entity of Type: Thing, from Named Graph: http://dbpedia.org, within Data Space: dbpedia-live.demo.openlinksw.com

Multidimensional search tree for points in k dimensional space

Property Value
dbo:description
  • multidimensional search tree for points in k dimensional space (en)
  • 一種用於搜尋多維空間當中的點的二元空間分割樹 (zh)
  • strom, používaný k indexaci prostorových dat (cs)
  • unbalancierte Baumstruktur in der Informatik (de)
  • moniulotteinen hakupuu pisteille k-ulotteisessa avaruudessa (fi)
  • نيك (arz)
dbo:thumbnail
dbo:wikiPageWikiLink
dbp:caption
  • A 3-dimensional k-d tree. The first split cuts the root cell into two subcells, each of which is then split into two subcells. Finally, four cells are split into two subcells. Since there is no more splitting, the final eight are called leaf cells. (en)
dbp:inventedBy
dbp:inventedYear
  • 1975 (xsd:integer)
dbp:name
  • k-d tree (en)
dbp:type
  • Multidimensional BST (en)
dbp:wikiPageUsesTemplate
dct:subject
gold:hypernym
rdfs:label
  • K-d tree (en)
  • K-d-Baum (de)
  • Árbol kd (es)
  • Kd木 (ja)
  • Arbre kd (fr)
  • K-d 트리 (ko)
  • Árvore k-d (pt)
  • Drzewo kd (pl)
  • K-вимірне дерево (uk)
  • K-d-дерево (ru)
  • K-d树 (zh)
owl:sameAs
prov:wasDerivedFrom
foaf:depiction
foaf:isPrimaryTopicOf
is dbo:wikiPageDisambiguates of
is dbo:wikiPageRedirects of
is dbo:wikiPageWikiLink of
is foaf:primaryTopic of
Powered by OpenLink Virtuoso    This material is Open Knowledge     W3C Semantic Web Technology     This material is Open Knowledge    Valid XHTML + RDFa
This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 4.0 International