Talk:Tree Structure
From GPWiki
The wiki is now hosted by GameDev.NET at wiki.gamedev.net. All gpwiki.org content has been moved to the new server. However, the GPWiki forums are still active! Come say hello. just quick. octree is for 3 dimensions, quad tree is for 2 dimensions, binary tree is for 1 dimension. Now think of the space in units of each dimension. For 1 dimension there is the root node at zero. From 0 there are negative units of space and positive. Now we are in limited space and have two positive objects and no negative so we are done with the negative siding from root zero node and continue with positive units. Now depending on where we chose second level node of positive units to devide the space we have either binary tree or "point" binary tree. There can be more information found if you look for "Spatial Indexing". Like http://homepages.ge.ucl.ac.uk/~mhaklay/java.htm |
The Game Programming Wiki has moved! 
