Unit tests for KdTree

Jump to navigation Jump to search
Revision as of 22 May 2012 at 15:02.
The highlighted comment was created in this revision.

Unit tests for KdTree

Hello Rednaxela,

I just converted your KD-tree Java code to C#. Do you have unit tests for KD-Tree? They would allow me to test if the conversion succeded.

    Ojd00:05, 6 May 2012

    I don't know if you could modified it to run the C# implementation, but K-NN algorithm benchmark has an accuracy checker with linear search, as with performance benchmark. You can give it a try.

      Nat Pavasant13:59, 7 May 2012
       

      Yeah, I didn't use any unit tests when writing the KD-Tree, just some functional tests. The most thorough of which is from the K-NN algorithm benchmark that Nat and I wrote. It repeatedly tests the KD-Trees with a very large set of random set of points against known-good results from a very very simple linear-time k-nn search.

        Rednaxela17:31, 8 May 2012
         

        I just published my C# implementation of a KD-Tree based on Rednaxela's java implementation here on robowiki.

          Ojd16:02, 22 May 2012