The Euclidean distance transform (EDT) converts a binary image into one where each pixel has a value equal to its distance to the nearest foreground pixel. Two parallel algorithms for EDT on linear array with reconfigurable pipeline bus system (LARPBS) are presented. For an image with n × n pixels, the first algorithm can complete EDT in O[(log n log log n)/(log log log n)] time using n2 processors. The second algorithm can computethe EDT in O(log n log log n) time using n2/(log log n) processors.