An Elementary Algorithm for Digital Arc Segmentation

This paper is concerned with the digital circle recognition problem and more precisely with the circular separating algorithm. It tries to go further in implementation details, giving pseudo-code algorithms for the main points, and avoids using the sophisticated machinery coming either from Computational Geometry or from Linear Programming found in previous papers on this subject. After recalling the geometrical meaning of the separating circle problem, we present an incremental algorithm to segment a discrete curve into digital arc.