OPTIMAL MULTIRESOLUTION POLYGONAL APPROXIMATION (WP-L3)

Author(s) : Alexander Kolesnikov (University of Joensuu, Finland) Pasi Franti (University of Joensuu, Finland)

Abstract : 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.

Menu