DBpedia 2014 |

DBpedia 2014

Matches in DBpedia 2014 for { <http://dbpedia.org/resource/K-d_tree> ?p ?o. }

Showing items 1 to 68 of 68 with 100 items per page.

K-d_tree abstract "In computer science, a k-d tree (short for k-dimensional tree) is a space-partitioning data structure for organizing points in a k-dimensional space. k-d trees are a useful data structure for several applications, such as searches involving a multidimensional search key (e.g. range searches and nearest neighbor searches). k-d trees are a special case of binary space partitioning trees.".
K-d_tree thumbnail 3dtree.png?width=300.
K-d_tree wikiPageExternalLink kdtree.
K-d_tree wikiPageExternalLink nanoflann.
K-d_tree wikiPageExternalLink phdthesis.html.
K-d_tree wikiPageExternalLink kdtree.html.
K-d_tree wikiPageExternalLink into.
K-d_tree wikiPageExternalLink libkdtree.alioth.debian.org.
K-d_tree wikiPageExternalLink FLANN.
K-d_tree wikiPageExternalLink spatial.sourceforge.net.
K-d_tree wikiPageExternalLink moore-tutorial.pdf?branch=main&language=en.
K-d_tree wikiPageExternalLink ANN.
K-d_tree wikiPageExternalLink image-search.
K-d_tree wikiPageExternalLink Math::Vector::Real::kdTree.
K-d_tree wikiPageID "1676725".
K-d_tree wikiPageRevisionID "605610478".
K-d_tree deleteAvg "O".
K-d_tree deleteWorst "O".
K-d_tree hasPhotoCollection K-d_tree.
K-d_tree insertAvg "O".
K-d_tree insertWorst "O".
K-d_tree inventedBy Jon_Bentley.
K-d_tree inventedYear "1975".
K-d_tree name "KD-tree".
K-d_tree searchAvg "O".
K-d_tree searchWorst "O".
K-d_tree spaceAvg "O".
K-d_tree spaceWorst "O".
K-d_tree type "Multidimensional BST".
K-d_tree subject Category:Computer_graphics_data_structures.
K-d_tree subject Category:Data_types.
K-d_tree subject Category:Database_index_techniques.
K-d_tree subject Category:Geometric_data_structures.
K-d_tree subject Category:Trees_(data_structures).
K-d_tree type Ability105616246.
K-d_tree type Abstraction100002137.
K-d_tree type Arrangement105726596.
K-d_tree type Cognition100023271.
K-d_tree type ComputerGraphicsDataStructures.
K-d_tree type DataStructure105728493.
K-d_tree type DatabaseIndexTechniques.
K-d_tree type GeometricDataStructures.
K-d_tree type Know-how105616786.
K-d_tree type Method105660268.
K-d_tree type PsychologicalFeature100023100.
K-d_tree type Structure105726345.
K-d_tree type Technique105665146.
K-d_tree comment "In computer science, a k-d tree (short for k-dimensional tree) is a space-partitioning data structure for organizing points in a k-dimensional space. k-d trees are a useful data structure for several applications, such as searches involving a multidimensional search key (e.g. range searches and nearest neighbor searches). k-d trees are a special case of binary space partitioning trees.".
K-d_tree label "Arbre kd".
K-d_tree label "Drzewo kd".
K-d_tree label "K-d tree".
K-d_tree label "K-d-Baum".
K-d_tree label "K-d树".
K-d_tree label "K-мерное дерево".
K-d_tree label "Kd木".
K-d_tree label "Árbol kd".
K-d_tree sameAs K-d-Baum.
K-d_tree sameAs Árbol_kd.
K-d_tree sameAs Arbre_kd.
K-d_tree sameAs Kd木.
K-d_tree sameAs Drzewo_kd.
K-d_tree sameAs m.05mm6t.
K-d_tree sameAs Q309949.
K-d_tree sameAs Q309949.
K-d_tree sameAs K-d_tree.
K-d_tree wasDerivedFrom K-d_tree?oldid=605610478.
K-d_tree depiction 3dtree.png.
K-d_tree isPrimaryTopicOf K-d_tree.