Difference between revisions of "PR Quadtree"
From CMSC 420
Ben Zoller (talk | contribs) (new page about PR Quadtrees) |
(No difference)
|
Revision as of 05:49, 22 March 2007
A PR (Point Region) Quadtree is a four-way search trie.
A PR Quadtree follows the following rules:
- At most, one vertex can lie in a region represented by a quadtree leaf node.
- Each region's quadtree leaf node is maximal.
