CSDL Home IEEE Transactions on Pattern Analysis & Machine Intelligence 1997 vol.19 Issue No.02 - February
Issue No.02 - February (1997 vol.19)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/34.574801
<p><b>Abstract</b>—This paper is concerned with efficient derivation of the medial axis transform of a two-dimensional polygonal region. Instead of using the shortest distance to the region border, a potential field model is used for computational efficiency. The region border is assumed to be charged and the valleys of the resulting potential field are used to estimate the axes for the medial axis transform. The potential valleys are found by following force field, thus, avoiding two-dimensional search. The potential field is computed in closed form using the equations of the border segments. The simple Newtonian potential is shown to be inadequate for this purpose. A higher order potential is defined which decays faster with distance than as inverse of distance. It is shown that as the potential order becomes arbitrarily large, the axes approach those computed using the shortest distance to the border. Algorithms are given for the computation of axes, which can run in linear parallel time for part of the axes having initial guesses. Experimental results are presented for a number of examples.</p>
Generalized potential, Newtonian potential, topology, medial axis, symmetric axis transform, skeletonization, distance transform.
Narendra Ahuja, "Shape Representation Using a Generalized Potential Field Model", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol.19, no. 2, pp. 169-176, February 1997, doi:10.1109/34.574801