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 higher dimensional voronoi routine either. --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected] To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
