Vision algorithm

From WikiManual
Revision as of 19:07, 3 October 2005 by 216.249.144.14 (talk)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search

Naive Approach

For x = 1 to MaxRobs
  For y = 1 to MaxRobs
    check if bot x can see bot y

I'm also looking into k-d trees and quad trees. If you are knowledgable in space partitioning algorithms, please post your thoughts on what the most appropriate algorithm to use is and why!