12 Aug
2010
12 Aug
'10
6:30 p.m.
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 would also like to have some scenarios that show the current limit of Mondrian.
A simple one is "view nodes: (1 to: 100000)". It takes time since the search is
linear. QuadTree should considerably speed the thing up.
Cheers,
Alexandre
--
_,.;:~^~:;._,.;:~^~:;._,.;:~^~:;._,.;:~^~:;._,.;:
Alexandre Bergel http://www.bergel.eu
^~:;._,.;:~^~:;._,.;:~^~:;._,.;:~^~:;._,.;:~^~:;.