This package implements Birdsong and Rummelt's 2016 algorithm for fast Fourier transforms on hexagonal lattices.
HexFFT currently exports four functions:
ihfft2() which compute the FFT and its inverse, respectively.
Alternatively, you can wrap your data in the
OffsetHexData type and use the standard
Note that transforms along individual dimensions (i.e.
fft(data, dim)) are not implemented.
The current implementation is ca. 10 times slower than
Base.fft() for comparable rectangular grids. However significant optimization should be possible by preallocating and reusing temporary arrays.