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