In more than two dimensions, it is often advantageous for cache locality to group the dimensions recursively.
There are other multidimensional FFT algorithms that are distinct from the row-column algorithm, although all of them have O(N log N) complexity.