
Analysis of the Worst Case Space Complexity of a PR Quadtree
1992) Analysis of the Worst Case Space Complexity of a PR Quadtree. Technical Report TR-92-09, Computer Science, Virginia Polytechnic Institute and State University. (
Full text available as: |
Abstract
We demonstrate that a resolution-r PR quadtree containing n points has, in the worst case, at most nodes. This captures the fact that as n tends towards 4r, the number of nodes in a PR quadtree quickly approaches O(n). This is a more precise estimation of the worst case space requirement of a PR quadtree than has been attempted before.
Item Type: | Departmental Technical Report |
---|---|
Subjects: | Computer Science > Historical Collection(Till Dec 2001) |
ID Code: | 289 |
Deposited By: | User autouser |
Deposited On: | 05 December 2001 |