103
edits
Changes
new page about PR Quadtrees
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.
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.