A new contour filling algorithm based on 2D topological map - Archive ouverte HAL
Communication Dans Un Congrès Année : 2007

A new contour filling algorithm based on 2D topological map

Denis Arrivault
  • Fonction : Auteur
  • PersonId : 836981

Résumé

In this paper, we present a topological algorithm which allows to fill contours images. The filling problem has been widely treated and it recently appeared that it can always be split into two different process : a generic topological process and a dedicated geometrical post-processing which depends on the application. Our algorithm, based on a 2D topological map description of the image, addresses the first step of processing. It is fast, generic and robust. Moreover, the complete topological description allows to easily integrate geometrical constrains and makes our approach an interesting basis for every filling process.
Fichier principal
Vignette du fichier
conf-2007-gbr.pdf (256.33 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-00348857 , version 1 (22-12-2008)

Identifiants

Citer

Guillaume Damiand, Denis Arrivault. A new contour filling algorithm based on 2D topological map. Graph-Based Representations in Pattern Recognition, Jun 2007, Alicante, Spain. pp.319-329, ⟨10.1007/978-3-540-72903-7_29⟩. ⟨hal-00348857⟩
118 Consultations
248 Téléchargements

Altmetric

Partager

More