. . . . . "K-d\u6811"@zh . . "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) and creating point clouds. k-d trees are a special case of binary space partitioning trees."@en . . . . "K-d tree"@en . . . "Drzewo kd"@pl . "\uCEF4\uD4E8\uD130 \uACFC\uD559\uC5D0\uC11C k-d \uD2B8\uB9AC(\uC601\uC5B4: k-d tree, k-\uCC28\uC6D0(dimensional) \uD2B8\uB9AC)\uB294 k\uCC28\uC6D0 \uACF5\uAC04\uC758 \uC810\uB4E4\uC744 \uAD6C\uC870\uD654\uD558\uB294 \uC790\uB8CC \uAD6C\uC870\uC774\uB2E4. k-d \uD2B8\uB9AC\uB294 \uB2E4\uCC28\uC6D0 \uD0D0\uC0C9 \uD0A4\uC5D0 \uAD00\uB828\uB41C \uD0D0\uC0C9 \uAC19\uC740 \uC801\uC6A9\uBD84\uC57C\uC5D0 \uC720\uC6A9\uD55C \uC790\uB8CC\uAD6C\uC870\uC774\uB2E4(\uC608: \uACFC \uCD5C\uADFC\uC811 \uC774\uC6C3 \uD0D0\uC0C9). k-d \uD2B8\uB9AC\uB294 \uC774\uC9C4 \uACF5\uAC04 \uBD84\uD560 \uD2B8\uB9AC\uC758 \uD2B9\uC218\uD55C \uACBD\uC6B0\uC774\uB2E4."@ko . . . . . . "k-d-\u0434\u0435\u0440\u0435\u0432\u043E (\u0430\u043D\u0433\u043B. k-d tree, \u0441\u043E\u043A\u0440\u0430\u0449\u0435\u043D\u0438\u0435 \u043E\u0442 k-\u043C\u0435\u0440\u043D\u043E\u0435 \u0434\u0435\u0440\u0435\u0432\u043E) \u2014 \u044D\u0442\u043E \u0441\u0442\u0440\u0443\u043A\u0442\u0443\u0440\u0430 \u0434\u0430\u043D\u043D\u044B\u0445 \u0441 \u0440\u0430\u0437\u0431\u0438\u0435\u043D\u0438\u0435\u043C \u043F\u0440\u043E\u0441\u0442\u0440\u0430\u043D\u0441\u0442\u0432\u0430 \u0434\u043B\u044F \u0443\u043F\u043E\u0440\u044F\u0434\u043E\u0447\u0438\u0432\u0430\u043D\u0438\u044F \u0442\u043E\u0447\u0435\u043A \u0432 k-\u043C\u0435\u0440\u043D\u043E\u043C \u043F\u0440\u043E\u0441\u0442\u0440\u0430\u043D\u0441\u0442\u0432\u0435. k-d-\u0434\u0435\u0440\u0435\u0432\u044C\u044F \u0438\u0441\u043F\u043E\u043B\u044C\u0437\u0443\u044E\u0442\u0441\u044F \u0434\u043B\u044F \u043D\u0435\u043A\u043E\u0442\u043E\u0440\u044B\u0445 \u043F\u0440\u0438\u043B\u043E\u0436\u0435\u043D\u0438\u0439, \u0442\u0430\u043A\u0438\u0445 \u043A\u0430\u043A \u043F\u043E\u0438\u0441\u043A \u0432 \u043C\u043D\u043E\u0433\u043E\u043C\u0435\u0440\u043D\u043E\u043C \u043F\u0440\u043E\u0441\u0442\u0440\u0430\u043D\u0441\u0442\u0432\u0435 \u043A\u043B\u044E\u0447\u0435\u0439 (\u043F\u043E\u0438\u0441\u043A \u0434\u0438\u0430\u043F\u0430\u0437\u043E\u043D\u0430 \u0438 \u043F\u043E\u0438\u0441\u043A \u0431\u043B\u0438\u0436\u0430\u0439\u0448\u0435\u0433\u043E \u0441\u043E\u0441\u0435\u0434\u0430). k-d-\u0434\u0435\u0440\u0435\u0432\u044C\u044F \u2014 \u043E\u0441\u043E\u0431\u044B\u0439 \u0432\u0438\u0434 \u0434\u0432\u043E\u0438\u0447\u043D\u044B\u0445 \u0434\u0435\u0440\u0435\u0432\u044C\u0435\u0432 \u043F\u043E\u0438\u0441\u043A\u0430."@ru . . . . . "1676725"^^ . . "En ciencias de la computaci\u00F3n, un \u00C1rbol kd (abreviatura de \u00E1rbol k-dimensional) es una estructura de datos de particionado del espacio que organiza los puntos en un Espacio eucl\u00EDdeo de k dimensiones. Los \u00E1rboles kd son un caso especial de los \u00E1rboles BSP. Un \u00E1rbol kd emplea s\u00F3lo planos perpendiculares a uno de los ejes del sistema de coordenadas. Esto difiere de los \u00E1rboles BSP, donde los planos pueden ser arbitrarios. Adem\u00E1s, todos los nodos de un \u00E1rbol kd, desde el nodo ra\u00EDz hasta los nodos hoja, almacenan un punto. Mientras tanto, en los \u00E1rboles BSP son las hojas los \u00FAnicos nodos que contienen puntos (u otras primitivas geom\u00E9tricas). Como consecuencia, cada plano debe pasar a trav\u00E9s de uno de los puntos del \u00E1rbol kd. T\u00E9cnicamente, la letra k se refiere al n\u00FAmero de dimensiones. Un \u00E1rbol kd tridimensional podr\u00EDa ser llamado un \u00E1rbol 3d. Sin embargo se suele emplear la expresi\u00F3n \"\u00E1rbol kd tridimensional\". (Tambi\u00E9n es m\u00E1s descriptivo, ya que un \u00E1rbol tridimensional puede ser varias cosas, pero el t\u00E9rmino \u00E1rbol kd se refiere a un tipo en concreto de \u00E1rbol de particionado.) Las letras k y d se escriben en min\u00FAsculas, incluso al principio de una oraci\u00F3n. La k se escribe en cursiva, aunque son tambi\u00E9n comunes las formas \"\u00E1rbol KD\" y \"\u00E1rbol Kd\"."@es . "Ein -dimensionaler Baum oder -d-Baum ist ein balancierter Suchbaum zur Speicherung von Punkten aus dem . Er bietet \u00E4hnlich dem Bereichsbaum die M\u00F6glichkeit, orthogonale Bereichsanfragen durchzuf\u00FChren. Die Anfragekomplexit\u00E4t ist zwar h\u00F6her, daf\u00FCr liegt der Speicheraufwand in statt in (siehe Komplexit\u00E4tstheorie - Landau-Notation). k-d-B\u00E4ume sind Spezialf\u00E4lle von BSP-B\u00E4umen, deren teilende Hyperebenen entlang der Achsen des Koordinatensystems ausgerichtet sind. Er wurde von Jon Bentley eingef\u00FChrt."@de . . . . . . . . . . . . . . . . "\u00C1rbol kd"@es . "29150"^^ . . . "\u5728\u8BA1\u7B97\u673A\u79D1\u5B66\u91CC\uFF0Ck-d\u6811\uFF08k-\u7EF4\u6811\u7684\u7F29\u5199\uFF09\u662F\u5728k\u7EF4\u6B27\u51E0\u91CC\u5FB7\u7A7A\u95F4\u7EC4\u7EC7\u70B9\u7684\u6570\u636E\u7ED3\u6784\u3002k-d\u6811\u53EF\u4EE5\u4F7F\u7528\u5728\u591A\u79CD\u5E94\u7528\u573A\u5408\uFF0C\u5982\u591A\u7EF4\u952E\u503C\u641C\u7D22\uFF08\u4F8B\uFF1A\u8303\u56F4\u641C\u5BFB\u53CA\u6700\u90BB\u8FD1\u641C\u7D22\uFF09\u3002k-d\u6811\u662F\u7A7A\u95F4\u4E8C\u5206\u6811\uFF08binary space partitioning\uFF09\u7684\u4E00\u79CD\u7279\u6B8A\u60C5\u51B5\u3002"@zh . . . . "Arbre kd"@fr . . "K-d-Baum"@de . "Multidimensional BST"@en . . . . . . . . . . . . . . . . "kd\u6728\uFF08\u82F1: kd-tree, k-dimensional tree\uFF09\u306F\u3001k\u6B21\u5143\u306E\u30E6\u30FC\u30AF\u30EA\u30C3\u30C9\u7A7A\u9593\u306B\u3042\u308B\u70B9\u3092\u5206\u985E\u3059\u308B\u7A7A\u9593\u5206\u5272\u30C7\u30FC\u30BF\u69CB\u9020\u3067\u3042\u308B\u3002kd\u6728\u306F\u3001\u591A\u6B21\u5143\u63A2\u7D22\u9375\u3092\u4F7F\u3063\u305F\u63A2\u7D22\uFF08\u4F8B\u3048\u3070\u3001\u7BC4\u56F2\u63A2\u7D22\u3084\u6700\u8FD1\u508D\u63A2\u7D22\uFF09\u306A\u3069\u306E\u7528\u9014\u306B\u4F7F\u308F\u308C\u308B\u30C7\u30FC\u30BF\u69CB\u9020\u3067\u3042\u308B\u3002kd\u6728\u306FBSP\u6728\u306E\u7279\u6B8A\u30B1\u30FC\u30B9\u3067\u3042\u308B\u3002 kd\u6728\u306F\u3001\u5EA7\u6A19\u8EF8\u306E1\u3064\u306B\u5782\u76F4\u306A\u5E73\u9762\u3060\u3051\u3092\u4F7F\u3063\u3066\u5206\u5272\u3092\u884C\u3046\u3002BSP\u6728\u3067\u306F\u5206\u5272\u5E73\u9762\u306E\u89D2\u5EA6\u306F\u4EFB\u610F\u3067\u3042\u308B\u3002\u3055\u3089\u306B\u4E00\u822C\u7684\u306B\u306F\u3001kd\u6728\u306E\u6839\u30CE\u30FC\u30C9\u304B\u3089\u8449\u30CE\u30FC\u30C9\u307E\u3067\u306E\u5404\u30CE\u30FC\u30C9\u306B\u306F1\u3064\u306E\u70B9\u304C\u683C\u7D0D\u3055\u308C\u308B\u3002\u3053\u306E\u70B9\u3082BSP\u6728\u3068\u306F\u7570\u306A\u308A\u3001BSP\u6728\u3067\u306F\u8449\u30CE\u30FC\u30C9\u306E\u307F\u304C\u70B9\uFF08\u307E\u305F\u306F\u4ED6\u306E\u5E7E\u4F55\u5B66\u7684\u30D7\u30EA\u30DF\u30C6\u30A3\u30D6\uFF09\u3092\u542B\u3080\u3002\u3064\u307E\u308A\u3001kd\u6728\u306E\u5404\u5206\u5272\u5E73\u9762\u306F\u5FC5\u305A1\u3064\u306E\u70B9\u3092\u901A\u308B\u3002\u8449\u30CE\u30FC\u30C9\u306E\u307F\u304C\u30C7\u30FC\u30BF\u3092\u683C\u7D0D\u3059\u308B\u6D3E\u751F\u30C7\u30FC\u30BF\u69CB\u9020\u3092\u3068\u547C\u3076\u3002\u307E\u305F\u3001\u7279\u8A18\u3059\u3079\u304Dkd\u6728\u306E\u5225\u306E\u5B9A\u7FA9\u3068\u3057\u3066\u3001\u5404\u5206\u5272\u5E73\u9762\u304C1\u3064\u306E\u70B9\u3092\u901A\u308B\u3088\u3046\u6C7A\u5B9A\u3055\u308C\u308B\u3082\u306E\u306E\u3001\u70B9\u3092\u8449\u30CE\u30FC\u30C9\u3067\u306E\u307F\u8A18\u61B6\u3059\u308B\u3068\u3044\u3046\u5B9A\u7FA9\u3082\u3042\u308B\u3002"@ja . . . . . . . "K-d-\u0434\u0435\u0440\u0435\u0432\u043E"@ru . . "Un arbre k-d (ou k-d tree, pour k-dimensional tree) est une structure de donn\u00E9es de partition de l'espace permettant de stocker des points, et de faire des recherches (recherche par plage, plus proche voisin, etc.) plus rapidement qu'en parcourant lin\u00E9airement le tableau de points. Les arbres k-d sont des cas particuliers d'arbres BSP (binary space partition trees). Cette structure a \u00E9t\u00E9 propos\u00E9e par Jon Louis Bentley de l'Universit\u00E9 Stanford en 1975."@fr . . . . . . . "K-d \uD2B8\uB9AC"@ko . . . . . . "Ein -dimensionaler Baum oder -d-Baum ist ein balancierter Suchbaum zur Speicherung von Punkten aus dem . Er bietet \u00E4hnlich dem Bereichsbaum die M\u00F6glichkeit, orthogonale Bereichsanfragen durchzuf\u00FChren. Die Anfragekomplexit\u00E4t ist zwar h\u00F6her, daf\u00FCr liegt der Speicheraufwand in statt in (siehe Komplexit\u00E4tstheorie - Landau-Notation). k-d-B\u00E4ume sind Spezialf\u00E4lle von BSP-B\u00E4umen, deren teilende Hyperebenen entlang der Achsen des Koordinatensystems ausgerichtet sind. Er wurde von Jon Bentley eingef\u00FChrt."@de . "1115861309"^^ . . . . . "\uCEF4\uD4E8\uD130 \uACFC\uD559\uC5D0\uC11C k-d \uD2B8\uB9AC(\uC601\uC5B4: k-d tree, k-\uCC28\uC6D0(dimensional) \uD2B8\uB9AC)\uB294 k\uCC28\uC6D0 \uACF5\uAC04\uC758 \uC810\uB4E4\uC744 \uAD6C\uC870\uD654\uD558\uB294 \uC790\uB8CC \uAD6C\uC870\uC774\uB2E4. k-d \uD2B8\uB9AC\uB294 \uB2E4\uCC28\uC6D0 \uD0D0\uC0C9 \uD0A4\uC5D0 \uAD00\uB828\uB41C \uD0D0\uC0C9 \uAC19\uC740 \uC801\uC6A9\uBD84\uC57C\uC5D0 \uC720\uC6A9\uD55C \uC790\uB8CC\uAD6C\uC870\uC774\uB2E4(\uC608: \uACFC \uCD5C\uADFC\uC811 \uC774\uC6C3 \uD0D0\uC0C9). k-d \uD2B8\uB9AC\uB294 \uC774\uC9C4 \uACF5\uAC04 \uBD84\uD560 \uD2B8\uB9AC\uC758 \uD2B9\uC218\uD55C \uACBD\uC6B0\uC774\uB2E4."@ko . . . . . "K-\u0432\u0438\u043C\u0456\u0440\u043D\u0435 \u0434\u0435\u0440\u0435\u0432\u043E"@uk . . . . . . . . . . "\u0412 \u0456\u043D\u0444\u043E\u0440\u043C\u0430\u0442\u0438\u0446\u0456 k-d \u0434\u0435\u0440\u0435\u0432\u043E (\u0430\u043D\u0433\u043B. k-d tree, \u0441\u043A\u043E\u0440\u043E\u0447\u0435\u043D\u043D\u044F \u0432\u0456\u0434 k-\u0432\u0438\u043C\u0456\u0440\u043D\u0435 \u0434\u0435\u0440\u0435\u0432\u043E) \u2014 \u0446\u0435 \u0441\u0442\u0440\u0443\u043A\u0442\u0443\u0440\u0430 \u0434\u0430\u043D\u0438\u0445 \u0437 \u043F\u043E\u0434\u0456\u043B\u043E\u043C \u043F\u0440\u043E\u0441\u0442\u043E\u0440\u0443 \u0434\u043B\u044F \u0443\u043F\u043E\u0440\u044F\u0434\u043A\u0443\u0432\u0430\u043D\u043D\u044F \u0442\u043E\u0447\u043E\u043A \u0432 k-\u0432\u0438\u043C\u0456\u0440\u043D\u043E\u043C\u0443 \u043F\u0440\u043E\u0441\u0442\u043E\u0440\u0456. K-d \u0434\u0435\u0440\u0435\u0432\u0430 \u0432\u0438\u043A\u043E\u0440\u0438\u0441\u0442\u043E\u0432\u0443\u044E\u0442\u044C\u0441\u044F \u0434\u043B\u044F \u0434\u0435\u044F\u043A\u0438\u0445 \u0437\u0430\u0441\u0442\u043E\u0441\u0443\u0432\u0430\u043D\u044C, \u0442\u0430\u043A\u0438\u0445 \u044F\u043A \u043F\u043E\u0448\u0443\u043A \u0443 \u0431\u0430\u0433\u0430\u0442\u043E\u0432\u0438\u043C\u0456\u0440\u043D\u043E\u043C\u0443 \u043F\u0440\u043E\u0441\u0442\u043E\u0440\u0456 \u043A\u043B\u044E\u0447\u0456\u0432 ( \u0456 \u043F\u043E\u0448\u0443\u043A \u043D\u0430\u0439\u0431\u043B\u0438\u0436\u0447\u043E\u0433\u043E \u0441\u0443\u0441\u0456\u0434\u0430). K-d \u0434\u0435\u0440\u0435\u0432\u0430 \u2014 \u043E\u0441\u043E\u0431\u043B\u0438\u0432\u0438\u0439 \u0432\u0438\u0434 \u0434\u0435\u0440\u0435\u0432 \u0434\u0432\u0456\u0439\u043A\u043E\u0432\u043E\u0433\u043E \u043F\u043E\u0434\u0456\u043B\u0443 \u043F\u0440\u043E\u0441\u0442\u043E\u0440\u0443."@uk . . . "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) and creating point clouds. k-d trees are a special case of binary space partitioning trees."@en . "k-d-\u0434\u0435\u0440\u0435\u0432\u043E (\u0430\u043D\u0433\u043B. k-d tree, \u0441\u043E\u043A\u0440\u0430\u0449\u0435\u043D\u0438\u0435 \u043E\u0442 k-\u043C\u0435\u0440\u043D\u043E\u0435 \u0434\u0435\u0440\u0435\u0432\u043E) \u2014 \u044D\u0442\u043E \u0441\u0442\u0440\u0443\u043A\u0442\u0443\u0440\u0430 \u0434\u0430\u043D\u043D\u044B\u0445 \u0441 \u0440\u0430\u0437\u0431\u0438\u0435\u043D\u0438\u0435\u043C \u043F\u0440\u043E\u0441\u0442\u0440\u0430\u043D\u0441\u0442\u0432\u0430 \u0434\u043B\u044F \u0443\u043F\u043E\u0440\u044F\u0434\u043E\u0447\u0438\u0432\u0430\u043D\u0438\u044F \u0442\u043E\u0447\u0435\u043A \u0432 k-\u043C\u0435\u0440\u043D\u043E\u043C \u043F\u0440\u043E\u0441\u0442\u0440\u0430\u043D\u0441\u0442\u0432\u0435. k-d-\u0434\u0435\u0440\u0435\u0432\u044C\u044F \u0438\u0441\u043F\u043E\u043B\u044C\u0437\u0443\u044E\u0442\u0441\u044F \u0434\u043B\u044F \u043D\u0435\u043A\u043E\u0442\u043E\u0440\u044B\u0445 \u043F\u0440\u0438\u043B\u043E\u0436\u0435\u043D\u0438\u0439, \u0442\u0430\u043A\u0438\u0445 \u043A\u0430\u043A \u043F\u043E\u0438\u0441\u043A \u0432 \u043C\u043D\u043E\u0433\u043E\u043C\u0435\u0440\u043D\u043E\u043C \u043F\u0440\u043E\u0441\u0442\u0440\u0430\u043D\u0441\u0442\u0432\u0435 \u043A\u043B\u044E\u0447\u0435\u0439 (\u043F\u043E\u0438\u0441\u043A \u0434\u0438\u0430\u043F\u0430\u0437\u043E\u043D\u0430 \u0438 \u043F\u043E\u0438\u0441\u043A \u0431\u043B\u0438\u0436\u0430\u0439\u0448\u0435\u0433\u043E \u0441\u043E\u0441\u0435\u0434\u0430). k-d-\u0434\u0435\u0440\u0435\u0432\u044C\u044F \u2014 \u043E\u0441\u043E\u0431\u044B\u0439 \u0432\u0438\u0434 \u0434\u0432\u043E\u0438\u0447\u043D\u044B\u0445 \u0434\u0435\u0440\u0435\u0432\u044C\u0435\u0432 \u043F\u043E\u0438\u0441\u043A\u0430."@ru . . . . "\u00C1rvore k-d"@pt . "Em ci\u00EAncia da computa\u00E7\u00E3o, uma \u00E1rvore k-d (abrevia\u00E7\u00E3o para a \u00E1rvore k-dimensional) \u00E9 uma estrutura de dados de para a organiza\u00E7\u00E3o de pontos em um k-dimensional espa\u00E7o. \u00C1rvores k-d s\u00E3o estruturas \u00FAteis para uma s\u00E9rie de aplica\u00E7\u00F5es, tais como pesquisas envolvendo de chaves (e.g. e busca do vizinho mais pr\u00F3ximo). \u00C1rvores k-d s\u00E3o um caso especial de \u00E1rvores de particionamento bin\u00E1rio de espa\u00E7o."@pt . . . "Un arbre k-d (ou k-d tree, pour k-dimensional tree) est une structure de donn\u00E9es de partition de l'espace permettant de stocker des points, et de faire des recherches (recherche par plage, plus proche voisin, etc.) plus rapidement qu'en parcourant lin\u00E9airement le tableau de points. Les arbres k-d sont des cas particuliers d'arbres BSP (binary space partition trees). Cette structure a \u00E9t\u00E9 propos\u00E9e par Jon Louis Bentley de l'Universit\u00E9 Stanford en 1975."@fr . "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 . "En ciencias de la computaci\u00F3n, un \u00C1rbol kd (abreviatura de \u00E1rbol k-dimensional) es una estructura de datos de particionado del espacio que organiza los puntos en un Espacio eucl\u00EDdeo de k dimensiones. Los \u00E1rboles kd son un caso especial de los \u00E1rboles BSP."@es . . . . . "\u5728\u8BA1\u7B97\u673A\u79D1\u5B66\u91CC\uFF0Ck-d\u6811\uFF08k-\u7EF4\u6811\u7684\u7F29\u5199\uFF09\u662F\u5728k\u7EF4\u6B27\u51E0\u91CC\u5FB7\u7A7A\u95F4\u7EC4\u7EC7\u70B9\u7684\u6570\u636E\u7ED3\u6784\u3002k-d\u6811\u53EF\u4EE5\u4F7F\u7528\u5728\u591A\u79CD\u5E94\u7528\u573A\u5408\uFF0C\u5982\u591A\u7EF4\u952E\u503C\u641C\u7D22\uFF08\u4F8B\uFF1A\u8303\u56F4\u641C\u5BFB\u53CA\u6700\u90BB\u8FD1\u641C\u7D22\uFF09\u3002k-d\u6811\u662F\u7A7A\u95F4\u4E8C\u5206\u6811\uFF08binary space partitioning\uFF09\u7684\u4E00\u79CD\u7279\u6B8A\u60C5\u51B5\u3002"@zh . . . . . . "\u0412 \u0456\u043D\u0444\u043E\u0440\u043C\u0430\u0442\u0438\u0446\u0456 k-d \u0434\u0435\u0440\u0435\u0432\u043E (\u0430\u043D\u0433\u043B. k-d tree, \u0441\u043A\u043E\u0440\u043E\u0447\u0435\u043D\u043D\u044F \u0432\u0456\u0434 k-\u0432\u0438\u043C\u0456\u0440\u043D\u0435 \u0434\u0435\u0440\u0435\u0432\u043E) \u2014 \u0446\u0435 \u0441\u0442\u0440\u0443\u043A\u0442\u0443\u0440\u0430 \u0434\u0430\u043D\u0438\u0445 \u0437 \u043F\u043E\u0434\u0456\u043B\u043E\u043C \u043F\u0440\u043E\u0441\u0442\u043E\u0440\u0443 \u0434\u043B\u044F \u0443\u043F\u043E\u0440\u044F\u0434\u043A\u0443\u0432\u0430\u043D\u043D\u044F \u0442\u043E\u0447\u043E\u043A \u0432 k-\u0432\u0438\u043C\u0456\u0440\u043D\u043E\u043C\u0443 \u043F\u0440\u043E\u0441\u0442\u043E\u0440\u0456. K-d \u0434\u0435\u0440\u0435\u0432\u0430 \u0432\u0438\u043A\u043E\u0440\u0438\u0441\u0442\u043E\u0432\u0443\u044E\u0442\u044C\u0441\u044F \u0434\u043B\u044F \u0434\u0435\u044F\u043A\u0438\u0445 \u0437\u0430\u0441\u0442\u043E\u0441\u0443\u0432\u0430\u043D\u044C, \u0442\u0430\u043A\u0438\u0445 \u044F\u043A \u043F\u043E\u0448\u0443\u043A \u0443 \u0431\u0430\u0433\u0430\u0442\u043E\u0432\u0438\u043C\u0456\u0440\u043D\u043E\u043C\u0443 \u043F\u0440\u043E\u0441\u0442\u043E\u0440\u0456 \u043A\u043B\u044E\u0447\u0456\u0432 ( \u0456 \u043F\u043E\u0448\u0443\u043A \u043D\u0430\u0439\u0431\u043B\u0438\u0436\u0447\u043E\u0433\u043E \u0441\u0443\u0441\u0456\u0434\u0430). K-d \u0434\u0435\u0440\u0435\u0432\u0430 \u2014 \u043E\u0441\u043E\u0431\u043B\u0438\u0432\u0438\u0439 \u0432\u0438\u0434 \u0434\u0435\u0440\u0435\u0432 \u0434\u0432\u0456\u0439\u043A\u043E\u0432\u043E\u0433\u043E \u043F\u043E\u0434\u0456\u043B\u0443 \u043F\u0440\u043E\u0441\u0442\u043E\u0440\u0443."@uk . . "Em ci\u00EAncia da computa\u00E7\u00E3o, uma \u00E1rvore k-d (abrevia\u00E7\u00E3o para a \u00E1rvore k-dimensional) \u00E9 uma estrutura de dados de para a organiza\u00E7\u00E3o de pontos em um k-dimensional espa\u00E7o. \u00C1rvores k-d s\u00E3o estruturas \u00FAteis para uma s\u00E9rie de aplica\u00E7\u00F5es, tais como pesquisas envolvendo de chaves (e.g. e busca do vizinho mais pr\u00F3ximo). \u00C1rvores k-d s\u00E3o um caso especial de \u00E1rvores de particionamento bin\u00E1rio de espa\u00E7o."@pt . . . . "Drzewo kd (ang. k-dimensional tree, k-d tree, drzewo k-wymiarowe) \u2013 struktura danych, b\u0119d\u0105ca wariantem drzew binarnych, u\u017Cywana do . Drzewa kd s\u0105 przydatne do tworzenia struktur w niekt\u00F3rych zastosowaniach, takich jak lub znajdowanie punkt\u00F3w w prostok\u0105tnych obszarach. Czasowa z\u0142o\u017Cono\u015B\u0107 obliczeniowa tych zada\u0144 wynosi gdzie to ca\u0142kowita liczba punkt\u00F3w, \u2013 liczba znalezionych punkt\u00F3w."@pl . "kd\u6728\uFF08\u82F1: kd-tree, k-dimensional tree\uFF09\u306F\u3001k\u6B21\u5143\u306E\u30E6\u30FC\u30AF\u30EA\u30C3\u30C9\u7A7A\u9593\u306B\u3042\u308B\u70B9\u3092\u5206\u985E\u3059\u308B\u7A7A\u9593\u5206\u5272\u30C7\u30FC\u30BF\u69CB\u9020\u3067\u3042\u308B\u3002kd\u6728\u306F\u3001\u591A\u6B21\u5143\u63A2\u7D22\u9375\u3092\u4F7F\u3063\u305F\u63A2\u7D22\uFF08\u4F8B\u3048\u3070\u3001\u7BC4\u56F2\u63A2\u7D22\u3084\u6700\u8FD1\u508D\u63A2\u7D22\uFF09\u306A\u3069\u306E\u7528\u9014\u306B\u4F7F\u308F\u308C\u308B\u30C7\u30FC\u30BF\u69CB\u9020\u3067\u3042\u308B\u3002kd\u6728\u306FBSP\u6728\u306E\u7279\u6B8A\u30B1\u30FC\u30B9\u3067\u3042\u308B\u3002 kd\u6728\u306F\u3001\u5EA7\u6A19\u8EF8\u306E1\u3064\u306B\u5782\u76F4\u306A\u5E73\u9762\u3060\u3051\u3092\u4F7F\u3063\u3066\u5206\u5272\u3092\u884C\u3046\u3002BSP\u6728\u3067\u306F\u5206\u5272\u5E73\u9762\u306E\u89D2\u5EA6\u306F\u4EFB\u610F\u3067\u3042\u308B\u3002\u3055\u3089\u306B\u4E00\u822C\u7684\u306B\u306F\u3001kd\u6728\u306E\u6839\u30CE\u30FC\u30C9\u304B\u3089\u8449\u30CE\u30FC\u30C9\u307E\u3067\u306E\u5404\u30CE\u30FC\u30C9\u306B\u306F1\u3064\u306E\u70B9\u304C\u683C\u7D0D\u3055\u308C\u308B\u3002\u3053\u306E\u70B9\u3082BSP\u6728\u3068\u306F\u7570\u306A\u308A\u3001BSP\u6728\u3067\u306F\u8449\u30CE\u30FC\u30C9\u306E\u307F\u304C\u70B9\uFF08\u307E\u305F\u306F\u4ED6\u306E\u5E7E\u4F55\u5B66\u7684\u30D7\u30EA\u30DF\u30C6\u30A3\u30D6\uFF09\u3092\u542B\u3080\u3002\u3064\u307E\u308A\u3001kd\u6728\u306E\u5404\u5206\u5272\u5E73\u9762\u306F\u5FC5\u305A1\u3064\u306E\u70B9\u3092\u901A\u308B\u3002\u8449\u30CE\u30FC\u30C9\u306E\u307F\u304C\u30C7\u30FC\u30BF\u3092\u683C\u7D0D\u3059\u308B\u6D3E\u751F\u30C7\u30FC\u30BF\u69CB\u9020\u3092\u3068\u547C\u3076\u3002\u307E\u305F\u3001\u7279\u8A18\u3059\u3079\u304Dkd\u6728\u306E\u5225\u306E\u5B9A\u7FA9\u3068\u3057\u3066\u3001\u5404\u5206\u5272\u5E73\u9762\u304C1\u3064\u306E\u70B9\u3092\u901A\u308B\u3088\u3046\u6C7A\u5B9A\u3055\u308C\u308B\u3082\u306E\u306E\u3001\u70B9\u3092\u8449\u30CE\u30FC\u30C9\u3067\u306E\u307F\u8A18\u61B6\u3059\u308B\u3068\u3044\u3046\u5B9A\u7FA9\u3082\u3042\u308B\u3002"@ja . . . . . . . . "k-d tree"@en . . . "1975"^^ . "Kd\u6728"@ja . . . . . . "Drzewo kd (ang. k-dimensional tree, k-d tree, drzewo k-wymiarowe) \u2013 struktura danych, b\u0119d\u0105ca wariantem drzew binarnych, u\u017Cywana do . Drzewa kd s\u0105 przydatne do tworzenia struktur w niekt\u00F3rych zastosowaniach, takich jak lub znajdowanie punkt\u00F3w w prostok\u0105tnych obszarach. Czasowa z\u0142o\u017Cono\u015B\u0107 obliczeniowa tych zada\u0144 wynosi gdzie to ca\u0142kowita liczba punkt\u00F3w, \u2013 liczba znalezionych punkt\u00F3w."@pl . . . . .