Robust Decomposition of a Digital Curve into Convex and Concave Parts - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2008

Robust Decomposition of a Digital Curve into Convex and Concave Parts

Résumé

We propose a linear in time and easy-to-implement algorithm that robustly decomposes a digital curve into convex and concave parts. This algorithm is based on classical tools in discrete and computational geometry: convex hull computation and Pick's formula.
Fichier non déposé

Dates et versions

hal-01501289 , version 1 (04-04-2017)

Identifiants

  • HAL Id : hal-01501289 , version 1

Citer

Tristan Roussillon, Isabelle Sivignon, Laure Tougne. Robust Decomposition of a Digital Curve into Convex and Concave Parts. International Conference on Pattern Recognition (ICPR 2008), Dec 2008, Tampa, United States. pp.1-4. ⟨hal-01501289⟩
110 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More