Serial and parallel algorithms for the medial axis transform

The authors develop an O(n²) time serial algorithm to obtain the medial axis transform (MAT) of an n ×n image. An O(logn) time CREW PRAM algorithm and an O(log²n) time SIMD hypercube parallel algorithm for the MAT are also developed. Both of these use O(n²) processors. Two problems associated with the MAT are also studied. These are the area and perimeter reporting problem. The authors develop an O(logn ) time hypercube algorithm for both of these problems. Here n is the number of squares in the MAT and the algorithms use O (n²) processors