Skip Navigation

The Computer Journal 1988 31(4):358-363; doi:10.1093/comjnl/31.4.358
© 1988 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 Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Williams, R.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

The Goblin Quadtree

R. Williams

Computer Laboratory, University of Cambridge, Corn Exchange Street, Cambridge CB2 3QG, UK

Received 1 November 1986; revised 1 March 1987

The Goblin quadtree is a new and simple data structure for representing spatial information. It stores a single pointer for each block of four nodes and average values at non-terminal nodes, enabling efficient depth-first traversal to any given level. The pointers are easy to generate and use, as demonstrated by algorithms for building and displaying Goblin quadtrees. The features of this new representation make it particularly suitable for geographic data. The concept of using a dominant value as the average value is explored, and is shown to be advantageous for quadtree display and storage.


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.