Polygonal chain approximation: A query based approach (Q706723): Difference between revisions

The paper deals with the min-\# problem (given a polygonal path and a positive approximation error \(\epsilon\), find an \(\varepsilon\)-approximating path with the smallest number of vertices). A new query based approach is used for solving the problem with infinite beam criterion. A greedy heuristic is proposed to speed-up the computation. Finally comparison are done for three algorithms based on different approaches: iterative, breadth first traversal, respectively priority queues.