Use 1D FFTs in bivariate KDE

Since we are convolving with a product distribution, the 2D convolution is separable. This approach has complexity `O(m*log(m)+n*log(n))` whereas the 2D FFT has complexity `O(m*n*(log(m)+log(n)))`.