[algogeeks] Re: Solving complicated Tree construction algorithm for Spatial Partioning

2014-06-10 Thread nurabha
Here is brief list of background concepts needed to understand the problem - Space Filling Curves (SFC) : Morton codes are one particular kind of SFC implmeentation. Gray code and Hilber code are two more types of SFCs that can be generated - Binary tree and traversal - Prefix trees - Basic sort

[algogeeks] Solving complicated Tree construction algorithm for Spatial Partioning

2014-06-10 Thread nurabha
I am going to discuss a difficult problem related to geometrical algorithms for space partitioning (2d, 3d, hyperspace). The problem is concerning a special kind of tree called *Octree*(in 3d) or *Quadtree*(2d). The Octree/Quadtree structures are used to hierarchically partition objects pre