Great and very detailed article!

Fragment of a discussion from Talk:Binary Search PIF
← Thread:Talk:Binary Search PIF/Great and very detailed article!/reply (7)

Jump to navigation Jump to search

You do not have permission to edit this page, for the following reasons:

The action you have requested is limited to users in the group: Users.
You must confirm your email address before editing pages. Please set and validate your email address through your user preferences.

You can view and copy the source of this page.

Of course it is not only abount the BFT time, we still have a Kdtree, and the other components, but when we are talking about milliseconds it helps a lot.

Return to Thread:Talk:Binary Search PIF/Great and very detailed article!/reply (7).

kd tree is very fast, comparing to the cost of simulation imo.

Not as fast as the presented algo for sure.

Rsalesc (talk)‎

Retrieved from "http://robowiki.net/wiki/Thread:Talk:Binary_Search_PIF/Great_and_very_detailed_article!/reply_(7)#Great_and_very_detailed_article.21_6118"