Fast Guaranteed Polygonal Approximations of Closed Digital Curves
We present in this paper a new non-parametric method for polygonal approximations of digital curves. In classical polygonal approximation algorithms, a starting point is randomly chosen on the curve and heuristics are used to ensure its effectiveness. We propose to use a new canonical representation of digital curves where no point is privileged. We restrict the class of approximation polygons to the class of digital polygonalizations of the curve. We describe the first algorithm which computes the polygon with minimal Integral Summed Squared Error in the class in both linear time and space, which is optimal, independently of any starting point.
- [DP73]Douglas, D.H., Pleucker, T.K.: Algorithm for the reduction of the number of points required to represent a line or its caricature. The Canadian Cartographer 10(2), 112–122 (1973)Google Scholar
- [Fes05]Feschet, F.: Canonical representations of discrete curves. Pattern Analysis and Applications (2005) (Accepted for publication, to appear) Google Scholar
- [FT03]Feschet, F., Tougne, L.: On the Min DSS Problem of Closed Discrete Curves. In: Del Lungo, A., Di Gesù, V., Kuba, A. (eds.) IWCIA. ENDM, vol. 12. Elsevier, Amsterdam (2003)Google Scholar
- [II88]Imai, H., Iri, M.: Polygonal approximations of a curve (formulations and algorithms). In: Toussaint, G.T. (ed.) Computational Morphology, pp. 71–86. North-Holland, Amsterdam (1988)Google Scholar
- [Mar03]Marji, M.: On the detection of dominant points on digital planar curves. PhD thesis, Graduate School, Wayne State University (2003)Google Scholar