Julian Kent's kd-tree

Jump to navigation Jump to search
Revision as of 5 October 2013 at 00:32.
The highlighted comment was created in this revision.

Julian Kent's kd-tree

is Julian Kent's kd tree faster than Rednaxela's or is it the other way around

    Tmservo (talk)07:45, 4 October 2013

    They're pretty much tied. Mine might be a little faster on systems where the data in the Kd-Tree is frequently pushed out of cache.

      Skilgannon (talk)12:28, 4 October 2013

      is third generation Rednaxela faster than Julian Kent

        Tmservo (talk)12:38, 4 October 2013

        No, as I said above, they are mostly the same except for cache conditions.

          Skilgannon (talk)14:07, 4 October 2013

          what about second generation Rednaxela and first generation Rednaxela

            Tmservo (talk)22:22, 4 October 2013

            3rd gen is the fastest of Rednaxela's trees. There's also a k-NN algorithm benchmark if you want to run some tests.

              Voidious (talk)01:32, 5 October 2013