Closed GoogleCodeExporter closed 9 years ago
This test is designed to show a weakness in the dynamic tree when objects are
inserted along an axis.
The previous solution produced a balanced tree at the cost of poor spatial
sorting. The real solution is to get both good sorting and a well balanced
tree. This is an open problem.
Original comment by erinca...@gmail.com
on 24 Aug 2010 at 6:35
Implemented AVL rotations and grandchild shuffling to keep the tree balanced
and efficient.
Original comment by erinca...@gmail.com
on 24 Mar 2011 at 6:45
Original issue reported on code.google.com by
wqyfavo...@gmail.com
on 18 Aug 2010 at 3:46