Mini-Sized

Jump to navigation Jump to search
Revision as of 17 July 2013 at 16:58.
The highlighted comment was edited in this revision. [diff]

Mini-Sized

Could a kd-tree be made less than one thousand bytes?

    Sheldor (talk)‎15:59, 17 July 2013

    I'm not sure, if you leave out the complicated stuff it loses its speed. Perhaps with the help of built-in structures like Java's PriorityQueue it might be possible. Impress us!

      Skilgannon (talk)‎17:56, 17 July 2013
       

      I'd say... possibly, but there's no reason to. An efficiently implemented linear search will waste much less of the limited codesize, and ought to be fast enough, espescially given that the number of search dimensions that make sense to put in a Minibot is small. The first nearest-n-neighbor search bots didn't use kd-trees and worked just fine.

      On the other hand... if you're wanting to do it for it's own sake, it would be real neat to see just how small it could get! :)

        Rednaxela (talk)‎17:56, 17 July 2013
         
        Retrieved from "http://robowiki.net/wiki/Thread:Talk:Kd-tree/Mini-Sized"