Date: 1999-04

Abstract:

A practical algorithm for computing the medial axis transform of 2D polygonal domains is presented. The algorithm computes the medial axis by tracing its paths. The medial axis is generated in the form of a graph where nodes are medial axis keypoints and edges are medial axis paths bounded by keypoints. Graph edges are labeled with the boundary elements governing the local medial axis shape. Examples with different domain boundaries illustrate the algorithm performance.]]>