Hi ,
So your question is to find a square region, when the middle is known (and the number of pixels in a row is not even.)
Top left is 0,0, (2 - 2 = 0)
Bottom right must be 4,4. (2 + 2 =4)
2 nested loops will find every pixel in the area.
If you are talking about a selection in a large bitmap, then we do not have enough data.
Paul
So your question is to find a square region, when the middle is known (and the number of pixels in a row is not even.)
Top left is 0,0, (2 - 2 = 0)
Bottom right must be 4,4. (2 + 2 =4)
2 nested loops will find every pixel in the area.
If you are talking about a selection in a large bitmap, then we do not have enough data.
Paul
It is more important to do the right thing, than to do the thing right.(P.Drucker)
Better is the enemy of good. (Montesquieu) = French version for 'kiss'.
Better is the enemy of good. (Montesquieu) = French version for 'kiss'.