1988•The Computer JournalRequires access
The Goblin Quadtree
R. Williams
Open publisher page 8 citations
Abstract
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.