A note on the optimal labelling of quadtree nodes

A Hunter, P Willis

Research output: Contribution to journalArticlepeer-review


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 languageEnglish
Pages (from-to)398-401
Number of pages4
JournalThe Computer Journal
Issue number5
Publication statusPublished - 1990


Dive into the research topics of 'A note on the optimal labelling of quadtree nodes'. Together they form a unique fingerprint.

Cite this