By Topic

Data structures for multilayer N-dimensional data using hierarchical structure

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Y. Nakamura ; Mitsubishi Electr. Corp., Hyoga, Japan ; S. Abe ; Y. Ohsawa ; M. Sakauchi

A multilayer (ML) data structure, which is a hierarchical data structure for N-dimensional data classified into layers, is proposed. In the ML structure, a node structure is extended so that data can be stored not only in the leaves (terminal nodes) but also in internal nodes by adding a layer-management mechanism. The creation, management, and searching methods of the ML structure are described, taking two-dimensional point data classified into layers as an object. The management of line data or expansion to n(n>2)-dimensional data can be easily realized. Good retrieval performances are obtained in the case of a spatial search for a specific layer's data and that for plural layers' data

Published in:

Pattern Recognition, 1990. Proceedings., 10th International Conference on  (Volume:ii )

Date of Conference:

16-21 Jun 1990