A Note on the Optimal Labelling of Quadtree Nodes | Zendy

Andrew Hunter | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A Note on the Optimal Labelling of Quadtree Nodes

Author(s) -

Andrew Hunter

Publication year - 1990

Publication title -

the computer journal

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.319

H-Index - 64

eISSN - 1460-2067

pISSN - 0010-4620

DOI - 10.1093/comjnl/33.5.398

Subject(s) - quadtree , extension (predicate logic) , computer science , node (physics) , labelling , algorithm , bit (key) , arithmetic , mathematics , computer network , programming language , physics , criminology , quantum mechanics , sociology

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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research