Optimal multiresolution polygonal approximation
Alexander Kolesnikov, Pasi Fränti · 2005
We propose optimal and near-optimal algorithm for multiresolution polygonal approximation of digital curves. The solution with minimum number of segments is constructed as the shortest path in a weighted graph where the weights are recursively defined as the number of segments of all embedded layers.