Abstract
Methods of labelling quadtree nodes by extended quaternary numbers are discussed. It is shown that a fixed bit-length technique requires only 2n+1 bits to represent any node in a depth n quadtree. A technique using exactly that number of bits is described. A more useful extension, requiring 2n+2 bits, is compared with the best technique previously published, which typically requires 2n+4 bits.
Original language | English |
---|---|
Pages (from-to) | 398-401 |
Number of pages | 4 |
Journal | The Computer Journal |
Volume | 33 |
Issue number | 5 |
DOIs | |
Publication status | Published - 1990 |