Multiresolution Polygonal Approximation of Digital Curves

We propose optimal split algorithm for multiresolution polygonal approximation of digital curves. Instead of using a sequence of heuristic split steps as in the previous methods, we apply optimal approximation to obtain the next (higher) resolution levels using the previous (lower) resolution level as starting point. We compare the proposed approach against fast heuristic multiresolution algorithm based on a merge strategy under the L2error measure.