Jump to content
Sign in to follow this  

Regarding PixelCheckSum performance

Recommended Posts

Hi all,

This is my first post here so dont blame me :P

I just want to know if i m doing something like it should be done

or if there is another way to do this faster.

So in short, i first scan an area for something changing (using pixelchecksum) and if i find anything changing,

i need to know EXACTLY where it is changing.

So my approach is like this :

Posted Image

then when i have 3 areas which contains my 'changing things' i do a union (AND) of all of them (or at least the last 2) and check every square

to finally find EXACTLY what is changing.

Basically another way to do this is to simply check every single square after a succesful first big scan.

So my question is, will my approach be less consumming (statistically) than the most basic approach (checking every square after the first scan) ?

Or, is there another way to do this faster ?

hope i am clear enough.

thanks in advance for any reply.




Share this post

Link to post
Share on other sites

Create an account or sign in to comment

You need to be a member in order to leave a comment

Create an account

Sign up for a new account in our community. It's easy!

Register a new account

Sign in

Already have an account? Sign in here.

Sign In Now
Sign in to follow this  

  • Recently Browsing   0 members

    No registered users viewing this page.

  • Create New...