An elementary algorithm for digital arc segmentation
Résumé
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.
| Origine | Fichiers éditeurs autorisés sur une archive ouverte |
|---|
Loading...