Fast polygonal approximation of digital curves - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2004

Fast polygonal approximation of digital curves


In this paper, we have extended the approach defined in "Debled-Rennesson et al, Segmentation of discrete curves into fuzzy segments,IWCIA'03" to a multiorder analysis. The approach is based on the arithmetical definition of discrete lines with variable thickness. We provide a framework to analyse a digital curve at different levels of thickness. The extremities points of a segment provided at a high resolution are tracked at lower resolution in order to refine their location. The high resolution level is automatically defined from the stability of the number of segments between two consecutive levels. The method is threshold-free and automatically provides a partitioning of a digital curve into its meaningful parts.
Not file

Dates and versions

inria-00100038 , version 1 (26-09-2006)


  • HAL Id : inria-00100038 , version 1


Isabelle Debled-Rennesson, Salvatore Tabbone, Laurent Wendling. Fast polygonal approximation of digital curves. 17th International Conference on Pattern Recognition - ICPR'04, Aug 2004, Cambridge, United Kingdom, pp.465-468. ⟨inria-00100038⟩
168 View
0 Download


Gmail Facebook Twitter LinkedIn More