Serial and Parallel Algorithms for the Medial Axis Transform
We develop an Q(n2) time serial algorithm to obtain the medial axis transform (MAT) of an n x n image. An 0(log n) time CREW PRAM algorithm and an 0(log2 n) time SIMD hypercube parallel algorithm for the MAT are also developed. Both of these use 0(n2) processors. Two problems associated with the MAT are also studied. These are the area and perimeter reporting problem. We develop an 0(log n) time hypercube algorithm for both of these problems. Here, n is the number of squares in the MAT, and the algorithms use 0(n2) processors.
MSU Digital Commons Citation
Jenq, John and Sahni, Sartaj, "Serial and Parallel Algorithms for the Medial Axis Transform" (1992). Department of Computer Science Faculty Scholarship and Creative Works. 540.