btree.h File Reference Detailed DescriptionDefinition a binary tree to speed up the search for neighouring charts in the atlas. Definition in file btree.h.
Macro Definition Documentation
Initial number of points in the tree. Enlarged as needed. Definition at line 29 of file btree.h. Referenced by InitBTree(). Function Documentation
Creates a binary tree of charts from the central point of one chart.
Definition at line 19 of file btree.c. References AddChart2Btree(), GetBoxInterval(), GetBoxNIntervals(), GetChartAmbientDim(), GetChartCenter(), GetChartRadius(), INIT_NUM_POINTS_IN_BTREE, LowerLimit(), TBTree::m, NEW, TBTree::r, TBTree::tp, and UpperLimit(). Referenced by InitAtlasFromPoint(), and LoadAtlas(). Adds a new chart to the tree of charts.
Definition at line 75 of file btree.c. References ArrayPi2Pi(), Error(), GetChartCenter(), TBTree::m, MEM_DUP, NEW, and TBTree::tp. Referenced by DetermineChartNeighbours(), InitBTree(), and LoadAtlas(). Uses the tree of charts to efficiently detect neighbouring charts to a given chart. We assume that the charts all have the same domain radius as the original chart (the one used to initialize the tree). Note that the output of this search is not the set of neighbours but the set of potential neighbours (identifiers of points in tree leaves close to the test point). This is not an issue since the intersection test that typically follows the search for neighbours takes care of actually detecting the true neighbours.
Definition at line 113 of file btree.c. References ArrayPi2Pi(), GetChartCenter(), TBTree::m, NEW, TBTree::r, and TBTree::tp. Referenced by DetermineChartNeighbours().
Deletes a tree of charts and releases the allocated memory. Definition at line 155 of file btree.c. References TBTree::tp. Referenced by DeleteAtlas(). |
Follow us!