title: Unitary rotations in two-, three-, and D-dimensional Cartesian data arrays.
abstract: Using a previous technique to rotate two-dimensional images on an N×N square pixellated screen unitarily, we can rotate three-dimensional pixellated cubes of side N, and also generally D-dimensional Cartesian data arrays, also unitarily. Although the number of operations inevitably grows as N(2D) (because each rotated pixel depends on all others), and Gibbs-like oscillations are inevitable, the result is a strictly unitary and real transformation (thus orthogonal) that is invertible (thus no loss of information) and could be used as a standard.
authors.forename: Guillermo
authors.initials: G
authors.lastname: Krötzsch
authors.forename: Kenan
authors.initials: K
authors.lastname: Uriostegui
authors.forename: Kurt Bernardo
authors.initials: KB
authors.lastname: Wolf