Improved efficient field computation via fast Fourier transforms

It is shown that in computing at a set of points regularly distributed over a planar surface the electromagnetic fields radiated by sources similarly distributed over a second plane via the fast Fourier transform (FFT), one need not require that the field and source planes be parallel. This significantly increases the flexibility of such FFT-based algorithms for computational electromagnetics.