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
- RDoc Documentation, Modified October 23, 2007, 12:00 am
- GEOS: geos::index::quadtree::Quadtree Class Reference, Modified June 11, 2009, 12:00 am
- Quadtree.cs - nettopologysuite - Google Code, Modified April 12, 2009, 12:00 am
- QuadTree (OpenMap API), Modified March 5, 2009, 12:00 am
- Quadtree Class, Modified May 31, 2003, 12:00 am
- gaphas.quadtree.Quadtree, Modified March 3, 2008, 12:00 am
- TNTsdk: QUADTREE Class Reference, Modified June 21, 2009, 12:00 am
- QuadTree (geotools-gtbuild 2.3.x API), Modified May 7, 2006, 12:00 am
- #include "quadtree.h" Quadtree:Quadtree() { _nwquad = NULL; _nequad ..., Modified June 8, 2005, 12:00 am
- Quadtree, Modified November 12, 2003, 12:00 am