Quadtrees and Hypercubes: Grid Embedding Strategies Based on Spatial Data Structure Addressing | Zendy

Leila Anne Breene | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Quadtrees and Hypercubes: Grid Embedding Strategies Based on Spatial Data Structure Addressing

Author(s) -

Leila Anne Breene

Publication year - 1993

Publication title -

the computer journal

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.319

H-Index - 64

eISSN - 1460-2067

pISSN - 0010-4620

DOI - 10.1093/comjnl/36.6.562

Subject(s) - hypercube , computer science , embedding , grid , theoretical computer science , euclidean geometry , scalability , topology (electrical circuits) , algorithm , parallel computing , mathematics , combinatorics , geometry , database , artificial intelligence

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 reflectes in the addresses themselves and, with this, fast multicast algorithms for various multiple-processor subgroups

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research