Quadtrees and hypercubes : grid embedding strategies based on spatial data structure addressing /
Abstract: "A uniform toroidal addressing scheme for k-trees, or spacial data structures, is given. These include bintrees, for decomposing the line, or partitioning linear arrays: quadtrees, for two-dimensional structures; octrees, for three dimensions; etc. Application of the strategy to the...
| Main Author: | |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
College Station, Tex. :
Texas A & M University, Computer Science Dept.,
[1992]
|
| Series: | Technical report (Texas A & M University. Computer Science Department) ;
92-013. |
| Subjects: |
| Summary: | Abstract: "A uniform toroidal addressing scheme for k-trees, or spacial data structures, is given. These include bintrees, for decomposing the line, or partitioning linear arrays: quadtrees, for two-dimensional structures; octrees, for three dimensions; etc. Application of the strategy to the embedding of grids in hypercubes is presented. This affords simple conceptualization in processor grids of arbitrary Euclidean dimension, as well as the preservation of gray code hierarchical neighborhoods, and, with this, fast multicast algorithms for various multiple-processor subgroups." |
|---|---|
| Item Description: | "June 1992." |
| Physical Description: | 12 leaves : illustrations ; 28 cm. |
| Bibliography: | Includes bibliographical references. |