Skip Navigation

The Computer Journal 1990 33(5):398-401; doi:10.1093/comjnl/33.5.398
© 1990 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (2)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Hunter, A.
Right arrow Articles by Willis, P. J.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

A Note on the Optimal Labelling of Quadtree Nodes

A. Hunter * and P. J. Willis *

The School of Mathematical Sciences, The University of Bath, Bath, Avon, BA2 7AY, UK

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.

Received August 1989.

* The School of Mathematical Sciences, The University of Bath, Bath, Avon, BA2 7AY


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.