Hunter, Andrew and Willis, P. J.
(1990)
*A note on the optimal labelling of quadtree nodes.*
The Computer Journal, 33
(5).
pp. 398-401.
ISSN 0010-4620

Full content URL: http://dx.doi.org/10.1093/comjnl/33.5.398

Full text not available from this repository.

Item Type: | Article |
---|---|

Item Status: | Live Archive |

## 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.

Additional Information: | 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. |
---|---|

Keywords: | optimal labelling, quadtree nodes, extended quaternary |

Subjects: | G Mathematical and Computer Sciences > G400 Computer Science |

Divisions: | College of Science > School of Computer Science |

ID Code: | 2786 |

Deposited On: | 14 Jul 2010 13:00 |

Repository Staff Only: item control page