A note on the optimal labelling of quadtree nodes

A Hunter, P Willis

Research output: Contribution to journalArticle

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

Fingerprint

Labeling

Cite this

A note on the optimal labelling of quadtree nodes. / Hunter, A; Willis, P.

In: The Computer Journal, Vol. 33, No. 5, 1990, p. 398-401.

Research output: Contribution to journalArticle

Hunter, A ; Willis, P. / A note on the optimal labelling of quadtree nodes. In: The Computer Journal. 1990 ; Vol. 33, No. 5. pp. 398-401.
@article{c0358b385df6422381b24af52ea58dd5,
title = "A note on the optimal labelling of quadtree nodes",
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.",
author = "A Hunter and P Willis",
year = "1990",
doi = "10.1093/comjnl/33.5.398",
language = "English",
volume = "33",
pages = "398--401",
journal = "The Computer Journal",
issn = "0010-4620",
publisher = "Oxford University Press",
number = "5",

}

TY - JOUR

T1 - A note on the optimal labelling of quadtree nodes

AU - Hunter, A

AU - Willis, P

PY - 1990

Y1 - 1990

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

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

UR - http://dx.doi.org/10.1093/comjnl/33.5.398

U2 - 10.1093/comjnl/33.5.398

DO - 10.1093/comjnl/33.5.398

M3 - Article

VL - 33

SP - 398

EP - 401

JO - The Computer Journal

JF - The Computer Journal

SN - 0010-4620

IS - 5

ER -