An elementary algorithm for digital arc segmentation

  • Authors:
  • D. Coeurjolly;Y. Gérard;J.-P. Reveillés;L. Tougne

  • Affiliations:
  • Laboratoire ERIC, Université Lumière Lyon 2, 5 av. Pierre Mendès-France, Bron 69676, France;Laboratoire LLAICI, IUT Clermont 1, Université d'Auvergne Clermont 1, B.P. 86, Aubiêre 63172, France;Laboratoire LLAICI, IUT Clermont 1, Université d'Auvergne Clermont 1, B.P. 86, Aubiêre 63172, France;Laboratoire ERIC, Université Lumière Lyon 2, 5 av. Pierre Mendès-France, Bron 69676, France

  • Venue:
  • Discrete Applied Mathematics - The 2001 international workshop on combinatorial image analysis (IWCIA 2001)
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper concerns the digital circle recognition problem, especially in the form of the circular separation problem. General fundamentals, based on classical tools, as well as algorithmic details, are given (the latter by providing pseudo-code for major steps of the algorithm). After recalling the geometrical meaning of the separating circle problem, we present an incremental algorithm to segment a discrete curve into digital arcs.