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 text not available from this repository. (Request a copy)

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.

Item Type:	Article
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 Sciences > Faculty of Science > Lincoln School of Computer Science
Depositing User:	Rosaline Smith
Date Deposited:	14 Jul 2010 13:00
Last Modified:	18 Jul 2011 16:27
URI:	http://eprints.lincoln.ac.uk/id/eprint/2786

Actions (login required)

View Item