Euclidean distance transform on polymorphic processor array

This paper describes a new parallel algorithm for Euclidean Distance Transform on the Polymorphic Processor Array, a massively parallel architecture based on a reconfigurable mesh interconnection network. The proposed algorithm has been implemented using the Polymorphic Parallel C language and has been validated through simulation, its computational complexity is O(N) (worst case) for pictures of NxN pixels on a Polymorphic Processor Array of NxN processing elements