It shares the features of all quadtrees but is a true tree as the center of a subdivision is always on a point.
Because the tree must allow more than 8 points in such a quadrant, QuadTrees can approach O(N) complexity for data sets with arbitrary geometry (e.g., maps or graphs).
Source: Wikipedia > Quadtree
Web Links
- GEOS: geos::index::quadtree::Quadtree Class Reference, Modified November 28, 2008, 12:00 am
- www.ics.uci.edu/~pablo/files/data/oliver/bbdresult/src/<b>quadtree</b>.cpp, Modified June 8, 2005, 12:00 am
- TNTsdk: QUADTREE Class Reference, Modified October 28, 2008, 12:00 am
- Quadtree.Size Method, Modified May 31, 2003, 12:00 am
- QuadTree (OpenMap API), Modified February 2, 2006, 12:00 am
- Quadtree.Query Method, Modified May 31, 2003, 12:00 am
- GEOS: Member List, Modified October 30, 2008, 12:00 am
- Quadtree - Wikipedia, the free encyclopedia, Modified November 13, 2008, 12:00 am
- Quadtree, Modified February 3, 2005, 12:00 am
- The Skip Quadtree: A Simple Dynamic Data Structure for Multidimensional ..., Modified January 17, 2007, 12:00 am