A fast native blur filter. See
iterativeBoxBlur(Bitmap, int, int)
iterativeBoxBlur(Bitmap bitmap, int iterations, int blurRadius)
This is a fast, native implementation of an iterative box blur.
This is a fast, native implementation of an iterative box blur. The algorithm runs in-place on the provided bitmap and therefore has a very small memory footprint.
The iterative box blur has the nice property that it approximates the Gaussian blur very quickly. Usually iterations=3 is sufficient such that the casual observer cannot tell the difference.
The edge pixels are repeated such that the bitmap still has a well-defined border.
Asymptotic runtime: O(width * height * iterations)
Asymptotic memory: O(radius + max(width, height))
|bitmap||The targeted bitmap that will be blurred in-place|
|iterations||The number of iterations to run. Must be greater than 0.|
|blurRadius||The given blur radius. Must be greater than 0.|