Optimal Contour Approximation and Applications

Abstract

A contour of n vertices is a polygonal path which is represented using a sequence of ver- tices P = < v0; v1; : : : ; vn >; v0 = vn; where vi; v(i+1) is an edges on the path. A contour approximation problem is to substitute the contour P by another simpler contour Q while maintaining the deviation between P and Q. In this article, we present a result that we can nd a Q with the least number of edges for a given error bound.