Fast algorithm for multiple-objects min-ε problem
Alexander Kolesnikov, Pasi Fränti · 2004
Fast algorithm for joint near-optimal approximation of multiple polygonal curves is proposed. It is based on iterative reduced-search dynamic programming introduced earlier for the min-/spl epsiv/ problem of a single polygonal curve. The proposed algorithm jointly optimizes the number of line segments allocated to the different individual curves, and the approximation of the curves by the given number of segments. Trade-off between time and optimality is controlled by the breadth of (the search, and by the numbers of iterations applied.