@article{oai:nagano-nct.repo.nii.ac.jp:00000526,
 author = {宮崎, 敬 and 大沢, 裕 and 坂内, 正夫},
 journal = {長野工業高等専門学校紀要},
 month = {Jan},
 note = {application, It is often necessary to retrieve information on the basis of range in n-dimensional coordinate space. A number of data structure have been proposed for this problem. Among them, the k-d tree and the binary tree seem to be effective from the point of view of geometrical database management. These data structures, however, are not fully satisfactory, especially in dynamic situation or in maldistribution situation. This paper proposes an application of the data structure. named the BD-tree, to geometical database management. We will describe the structure of the BD-tree, partitioning method, its directory tree organization and the management of plain figure data.},
 pages = {83--88},
 title = {多次元パターン管理構造の図形管理への応用},
 volume = {18},
 year = {1988}
}