We can generate $n - m$-dimensional hyperslices or stacks thereof.
We can interpolate those hyperslices with stack interpolation which solves the unwanted shearing of interpolation kernels along the discretized axes (cool for sheared lighht sheet images, serial section alignments and similar stuff)
Stack interpolation likely will have to be revisited to replace the Lists<RealRandomAccessible<T>> by RandomAccessible<RealRandomAccessible<T>>, or introduce a truly 1-dimensional lazy evaluated long list, this could be called Stack<R> extends RandomAccessible<R> with R being the hyperslices (this should be discussed in more detail).
This will give us several things:
Stack interpolation likely will have to be revisited to replace the
Lists<RealRandomAccessible<T>>byRandomAccessible<RealRandomAccessible<T>>, or introduce a truly 1-dimensional lazy evaluated long list, this could be calledStack<R> extends RandomAccessible<R>with R being the hyperslices (this should be discussed in more detail).