Hypercube Algorithms for Image Transformations.
Sanjay Ranka, Sartaj K. Sahni · 1989
Efficient hypercube algorithms are developed for the following image transformations: shrinking, expanding, translation, rotation, and scaling. A 2 -step shrinking and expanding of a gray scale NN image can be done in O (k) time on an N processor MIMD hypercube and in O (logN) time on an SIMD hypercube. Translation, rotation, and scaling of an NN image take O (logN) time on an N processor hypercube.