Serial and Parallel Algorithms for the Medial Axis Transform

  • Authors:
  • Jing-Fu Jenq;Sartaj Sahni

  • Affiliations:
  • -;-

  • Venue:
  • IEEE Transactions on Pattern Analysis and Machine Intelligence
  • Year:
  • 1992

Quantified Score

Hi-index 0.14

Visualization

Abstract

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.