IEEE Transactions on Pattern Analysis and Machine Intelligence · 1997 · 110 citations · 18 references
ComputingComputer ScienceComputational GeometryComputational MechanicsGeometric ModelingGeometry ProcessingPotential Field InterpretationShape AnalysisShape RepresentationComputational EfficiencyComputational Efficiency AnalysisForce Field ModelsNewtonian MechanicsPolygonal RepresentationRegion DescriptionShapeValleys
This paper is concerned with efficient derivation of the medial axis transform of a 2D 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 the force field, thus, avoiding 2D search. The potential field is computed in closed form using 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 the 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.
18
Micheál Jacob · Health Education Journal · 1989 · 3.1K citations · Full text
A fast parallel algorithm for thinning digital patterns
Tingwei Zhang, Ching Y. Suen · Communications of the ACM · 1984 · 2.7K citations · Full text
Per‐Erik Danielsson · Computer Graphics and Image Processing · 1980 · 2K citations
A transformation for extracting new descriptors of shape
H.E. Blum · Medical Entomology and Zoology · 1967 · 1.7K citations
Distance functions on digital pictures
Amir Rosenfeld, John L. Pfaltz · Pattern Recognition · 1968 · 835 citations