Avoid expensive sqrt operation in hot loop of BitMap.grow_mask
This commit is contained in:
parent
2c136e6170
commit
293cc2126e
1 changed files with 3 additions and 2 deletions
|
@ -559,6 +559,7 @@ void BitMap::grow_mask(int p_pixels, const Rect2i &p_rect) {
|
|||
|
||||
bool bit_value = p_pixels > 0;
|
||||
p_pixels = Math::abs(p_pixels);
|
||||
const int pixels2 = p_pixels * p_pixels;
|
||||
|
||||
Rect2i r = Rect2i(0, 0, width, height).intersection(p_rect);
|
||||
|
||||
|
@ -588,8 +589,8 @@ void BitMap::grow_mask(int p_pixels, const Rect2i &p_rect) {
|
|||
}
|
||||
}
|
||||
|
||||
float d = Point2(j, i).distance_to(Point2(x, y)) - CMP_EPSILON;
|
||||
if (d > p_pixels) {
|
||||
float d = Point2(j, i).distance_squared_to(Point2(x, y)) - CMP_EPSILON2;
|
||||
if (d > pixels2) {
|
||||
continue;
|
||||
}
|
||||
|
||||
|
|
Loading…
Reference in a new issue