Title :
Medial Axis Transformation of a Planar Shape
Author_Institution :
MEMBER, IEEE, Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, IL 60201.
fDate :
7/1/1982 12:00:00 AM
Abstract :
The medial axis transformation is a means first proposed by Blum to describe a shape. In this paper we present a 0(n log n) algorithm for computing the medial axis of a planar shape represented by an n-edge simple polygon. The algorithm is an improvement over most previously known results interms of both efficiency and exactness and has been implemented in Fortran. Some computer-plotted output of the program are also shown in the paper.
Keywords :
Computational complexity; Digital arithmetic; Euclidean distance; Helium; Shape; Skeleton; Tree graphs; Analysis of algorithm; Voronoi diagram; computational complexity; continuous skeleton; divide-and-conquer; medical axis transformation; simple polygon;
Journal_Title :
Pattern Analysis and Machine Intelligence, IEEE Transactions on
DOI :
10.1109/TPAMI.1982.4767267
