PR Quadtree

From CMSC 420
Revision as of 05:49, 22 March 2007 by Ben Zoller (talk | contribs) (new page about PR Quadtrees)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

A PR (Point Region) Quadtree is a four-way search trie.

A PR Quadtree follows the following rules:

  1. At most, one vertex can lie in a region represented by a quadtree leaf node.
  2. Each region's quadtree leaf node is maximal.

Web Accessibility

Retrieved from "https://wiki.cs.umd.edu/cmsc420/w/index.php?title=PR_Quadtree&oldid=1457"