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
Book sections

Convex and Concave Parts of Digital Curves

Hélène Reiter-Dorksen 1 Isabelle Debled-Rennesson 2
2 ADAGE - Applying discrete algorithms to genomics
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : Decomposition of a digital curve into convex and concave parts is of relevance in several scopes of image processing. In digital plane convexity cannot be observed locally. It becomes an interesting question, how far one can decide whether a part of a digital curve is convex or concave by a method which is "as local as possible". In a previous paper, it was proposed to define the meaningful parts of a digital curve as meaningful parts of the corresponding polygonal representation. This technique has an approximative character. In our considerations, we use geometry of arithmetical discrete line segments. We will introduce an exact method to define convex and concave parts of a digital curve.
Document type :
Book sections
Complete list of metadata

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


  • HAL Id : inria-00100055, version 1



Hélène Reiter-Dorksen, Isabelle Debled-Rennesson. Convex and Concave Parts of Digital Curves. none. Geometric Properties from Incomplete Data, Kluwer, 15 p, 2004. ⟨inria-00100055⟩



Record views