For log search is it ok if we change the search area to be 2^n (8 or 16) to avoid 1/2 pixel search for logarithmic? and If not can we round or truncate the search radius?

EX:  

radius = 12

while(radius/2 > 1)...

giving
12/2->6/2 ->2/2 (rounding or truncating would both cause it to be the last search...)
instead of    12/2 -> 6/2 -> 3/2 -> 1.5/2