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. Reinterpretation of these addresse...
| 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-026. |
| 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. Reinterpretation of these addresses as hypercube node identifiers affords simple conceptualization of processor grids of arbitrary Euclidean dimension. Use of gray code produces a hierarchy of topological neighborhoods reflected in the addresses themselves, and, with this, fast multicast algorithms for various multiple-processor subgroups." |
|---|---|
| Item Description: | "October 1992." |
| Physical Description: | 16 leaves : illustrations ; 28 cm. |
| Bibliography: | Includes bibliographical references. |