The Goblin Quadtree
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 de...
Published in: | The Computer Journal |
---|---|
Main Author: | |
Format: | Text |
Language: | English |
Published: |
Oxford University Press
1988
|
Subjects: | |
Online Access: | http://comjnl.oxfordjournals.org/cgi/content/short/31/4/358 https://doi.org/10.1093/comjnl/31.4.358 |
id |
fthighwire:oai:open-archive.highwire.org:comjnl:31/4/358 |
---|---|
record_format |
openpolar |
spelling |
fthighwire:oai:open-archive.highwire.org:comjnl:31/4/358 2023-05-15T18:32:38+02:00 The Goblin Quadtree Williams, R. 1988-08-01 00:00:00.0 text/html http://comjnl.oxfordjournals.org/cgi/content/short/31/4/358 https://doi.org/10.1093/comjnl/31.4.358 en eng Oxford University Press http://comjnl.oxfordjournals.org/cgi/content/short/31/4/358 http://dx.doi.org/10.1093/comjnl/31.4.358 Copyright (C) 1988, British Computer Society Computer Graphics TEXT 1988 fthighwire https://doi.org/10.1093/comjnl/31.4.358 2008-12-25T20:28:39Z 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. Text The Pointers HighWire Press (Stanford University) The Computer Journal 31 4 358 363 |
institution |
Open Polar |
collection |
HighWire Press (Stanford University) |
op_collection_id |
fthighwire |
language |
English |
topic |
Computer Graphics |
spellingShingle |
Computer Graphics Williams, R. The Goblin Quadtree |
topic_facet |
Computer Graphics |
description |
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. |
format |
Text |
author |
Williams, R. |
author_facet |
Williams, R. |
author_sort |
Williams, R. |
title |
The Goblin Quadtree |
title_short |
The Goblin Quadtree |
title_full |
The Goblin Quadtree |
title_fullStr |
The Goblin Quadtree |
title_full_unstemmed |
The Goblin Quadtree |
title_sort |
goblin quadtree |
publisher |
Oxford University Press |
publishDate |
1988 |
url |
http://comjnl.oxfordjournals.org/cgi/content/short/31/4/358 https://doi.org/10.1093/comjnl/31.4.358 |
genre |
The Pointers |
genre_facet |
The Pointers |
op_relation |
http://comjnl.oxfordjournals.org/cgi/content/short/31/4/358 http://dx.doi.org/10.1093/comjnl/31.4.358 |
op_rights |
Copyright (C) 1988, British Computer Society |
op_doi |
https://doi.org/10.1093/comjnl/31.4.358 |
container_title |
The Computer Journal |
container_volume |
31 |
container_issue |
4 |
container_start_page |
358 |
op_container_end_page |
363 |
_version_ |
1766216847566307328 |