This project has moved and is read-only. For the latest updates, please go here.

Tree in spatial indexing of SharpMap

Topics: Algorithms, SharpMap Project
Mar 11, 2008 at 7:50 AM
I wonder if i could possibly ask some questions about spatial indexing in Sharpmap.
That index seems to use the binary tree with name " QuadTree",so i am confused about it. And the implementation of it uses some features of R-Tree, so is there anyone who can tell me the what this spatial indexing really is and its mechanism. Thanks!
Mar 11, 2008 at 11:19 AM
Edited Mar 11, 2008 at 11:23 AM

A quad tree is a method of dividing and sub dividing space until no node contains more items than a given threshold. You can read about it at HTH jd
Mar 11, 2008 at 4:51 PM
Also note that the Quadtree class in SharpMap isn't really implemented - it's only a skeleton class.