Pemmaraju, Sriram V.Shaffer, Clifford A.2013-06-192013-06-191992http://hdl.handle.net/10919/19649We 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.application/pdfenIn CopyrightTechnical reportTR-92-09http://eprints.cs.vt.edu/archive/00000289/01/TR-92-09.pdf