added the merge tree based haloFinder code in halo_merge.h, included the GUI version for that code in halorenderMergeTree.cpp, included the code to run this version in halo.cpp with other tests & also added code to verify results at the end, Corrected an error in the vtk based version in halo_vtk.h, added the naive halo finder implementation for comparison ...
uncommented a set of code related to the computation in halo_merge.h
Adding the current best version of merge tree based halo finder
memory optimizations, improved removeEmptyEdges & sortEdgesPerCube functions, Included code for the merge tree to store the halo size as well
get the edge size needed before allocation of edge array, remove neighbor cube size calculations
some code added to 'sortEdgesPerCube' function
using the parallel radix sort
removed commented out code
some minor changes
completed the global merge tree adjustinng step, uses the new sort for OMP, now uses onle nodes & nodesTmp1 arrays to store the merge tree
adding a couple of files which were missed in the previous commit
minor changes to some files
changes to cmake to get it running on LANL desktop
fixed the new version where cube diagonal length is min_ll
working version where the cube's digonal size is the min_ll, but still needs to be optimized more
doing the local edge computation step only for the non empty cubes instead of doing it for all cubes
mapping the non empty cube details to the start of all arrays & doing the computation, gives the correct results
unfinished global step - using of superparent
working version where all computations are done only to the non-empty cubes (both in local & global steps)
check scalability for base case, has a bug in merge step