Im currently looking at motion detection, and im looking for the most efficient way to check a large array for change. What i was thinking is splitting the 1D array up using a quadtree. And then just doing a small check on the larger area, and more indepth calculations the further into the tree as it goes. My question here is this an efficent way to do it ? Or is there a better method to use?- is less better here, If im doing this check every few frames of a video, would it be better to just check one array of the next in a whole ?
 Sorry... i ment to post this is general programming :S - Can someone move it ?
Edited by McGrane, 26 February 2013 - 06:18 PM.