KDTreeF
Fragment of a discussion from User talk:Chase-san/Kd-Tree
← Thread:User talk:Chase-san/Kd-Tree/KDTreeF/reply
Jump to navigation
Jump to search
← Thread:User talk:Chase-san/Kd-Tree/KDTreeF/reply
You do not have permission to edit this page, for the following reasons:
You can view and copy the source of this page.
But on the inverse you have a smaller data set earlier on. So it might balance out to a point. But I do intend to work on that a bit. I actually originally tuned with a random data set.
Also the current tree is based off C but I removed the Item class and altered the return to use a heap. Though I was considering having it interface with SortedMap and just returning that interface. So that I could avoid the issue of defining an external class.
I am mulling around how to redesign my tree so that it works better with the JIT, and so I create/destroy fewer objects (which should save some time).
