Abstract A parallel algorithm for the rotation of digitized images is presented. The parallelism used is of a type that is not commonly realized by parallel algorithm designers. This algorithm can be regarded as a process-and-data-decomposition type of algorithm. This is the decomposition of a process into a number of subprocesses and the allocation of each subprocess to a processor for execution, together with the decomposition of data into smaller portions and the allocation of each portion to a processor for execution. The algorithm is targeted at an MIMD machine mad eup of transputers.