[Moose-dev] Re: Quadtree in Mondrian

On 12.08.2010, at 18:05, Alexandre Bergel wrote:

Hi!

Thanks to Simon, there is a MOQuadTree class and its tests in Mondrian. Quadtree is a tree data structure that is used to partition a two dimensional space by recursively subdividing it into four quadrants or regions. We could imagine plenty of new caches using quad trees.

I haven't seen any complain about speed anymore. However, I feel you restraint _yourself_ from pushing Mondrian to its limits :-) If you experience any slowdown, please keep a description of what you have done before changing your visualization.

QuadTree are probably the way to go if we want to reach 1,000,000 nodes :-)

Hmmm, I'm looking for a quad tree implementation :) Is it bound to Mondrian?

Norbert