Convex and Concave Parts of Digital Curves - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Book Sections Year : 2004

Convex and Concave Parts of Digital Curves

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.
No file

Dates and versions

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

Identifiers

  • HAL Id : inria-00100055 , version 1

Cite

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⟩
214 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More