We develop two algorithms to perform the q step shrinking and expanding of an N x N binary image on a pyramid computer with an N x N base. The time complexity of both algorithms is O(√q). However, one uses O(√q) space per processor, while the per-processor space requirement of the other is O(1).
|Number of pages||6|
|Journal||IEEE Transactions on Parallel and Distributed Systems|
|State||Published - Nov 1993|