홈 >                  	Term: k-d-B-tree  
k-d-B-tree
A data structure which splits multidimensional spaces like an adaptive k-d tree, but balances the resulting tree like a B-tree.
- 품사: noun
- 분야/도메인: 컴퓨터 과학
- 카테고리: Algorithms & data structures
- Government Agency: NIST
 			0   			 		
 작성자
- GeorgeV
- 100% positive feedback

