| 摘要 |
PURPOSE:To compress the storage capacity for dot information and to perform efficient retrieval by representing only an area which includes dot information among 2<n> recursively divided areas in a tree structure, uniting a node whose position number is 1 with a slave node, and adding division information to each node as position information relative to a master node. CONSTITUTION:An (n)-dimensional space is divided recursively into 2<n> areas and only areas which include dot information among those divided areas are represented in the tree structure; and nodes whose position numbers are 1 are united with slave nodes and division information as position information relative to the master node is added to each node. For example, an area is divided equally and recursively by four until each divided area includes only one dot. Branches and nodes are reduced in number, so the storage capacity may be small and the retrieval time is shortened because of the retrieval based on the division information and the reconstruction of the tree structure; and the retrieval is performed efficiently and the retrieval time is made balanced.
|
