guys, what i mean is have people improved on k-d tree and m-tree for
this? here is the homepage of m-tree:
http://www-db.deis.unibo.it/Mtree/
this is closely related to any efficient partition of higher
dimensional space, such as a higher dimensional voronoi diagram. i
don't know a scalable highe
what do you think is the best data structure, that also scales with
number of dimensions. i implemented m-tree last but it is hopeless!
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To pos
