12 Aug
2010
12 Aug
'10
6:21 p.m.
On 12 août 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.
Thanks Alex
But does it mean you started to use QuadTree or not?
It may be the way to go, but last time I tried I was a bit deceived. I think my
implementation currently lacks some optimization. First step, we could do some benchmarks
on QuadTree.
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 :-)
--
Simon