HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

Fast polygonal approximation of digital curves

Isabelle Debled-Rennesson 1 Salvatore Tabbone 2 Laurent Wendling 2
1 ADAGE - Applying discrete algorithms to genomics
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
2 QGAR - Querying Graphics through Analysis and Recognition
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : 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.
Document type :
Conference papers
Complete list of metadata

Contributor : Publications Loria Connect in order to contact the contributor
Submitted on : Tuesday, September 26, 2006 - 10:13:39 AM
Last modification on : Friday, February 4, 2022 - 3:10:59 AM


  • 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⟩



Record views