Issue No. 12 - December (1992 vol. 14)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/34.177389
<p>An O(n/sup 2/) time serial algorithm is developed for obtaining the medial axis transform (MAT) of an n*n image. An O(log n) time CREW PRAM algorithm and an O(log/sup 2/ n) time SIMD hypercube parallel algorithm for the MAT are also developed. Both of these use O(n/sup 2/) processors. Two problems associated with the MAT, the area and perimeter reporting problem, are studied. An O(log n) time hypercube algorithm is developed for both of them, where n is the number of squares in the MAT, and the algorithms use O(n/sup 2/) processors.</p>
area reporting problem; parallel algorithms; medial axis transform; serial algorithm; CREW PRAM algorithm; SIMD hypercube parallel algorithm; perimeter reporting problem; hypercube algorithm; computational complexity; hypercube networks; image processing; parallel algorithms; transforms
S. Sahni and J. Jenq, "Serial and Parallel Algorithms for the Medial Axis Transform," in IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 14, no. , pp. 1218-1224, 1992.