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.
Euclidean distance transform on polymorphic processor array
MIGLIARDI, MAURO
1995
Abstract
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.
File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
