An elementary algorithm for digital arc segmentation

Electronic Notes in Theoretical Computer Science

Volumn 46, Issue , 2001, Pages 355-370

  Coeurjolly, David ^a   Tougne, Laure ^a   Gérard, Yan ^b   Reveillès, Jean Pierre ^b  

^a UNIVERSITÉ LUMIÈRE LYON 2   (France)

^b UNIVERSITÉ CLERMONT AUVERGNE   (France)

Author keywords

Arc separability; Digital arc recognition; Digital circle; Digital curvature

Indexed keywords

CODES (SYMBOLS); COMPUTATIONAL GEOMETRY; HOUGH TRANSFORMS; IMAGE SEGMENTATION; LINEAR PROGRAMMING; PATTERN RECOGNITION; PROBLEM SOLVING; SET THEORY;

ARC SEPARABILITY; DIGITAL ARC RECOGNITION; DIGITAL CIRCLE; DIGITAL CURVATURE;

ALGORITHMS;

EID: 18944386997     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)80997-6     Document Type: Conference Paper

References (17)

1. Coeujolly D., S. Miguet and L. Tougne, Discrete curvature based on osculating circle estimation, in: International Worshop in Visual Form IV, 2001.
2. Damaschke P. The linear time recognition of digital arcs. Pattern Recognition Letters. 1995;543-548
3. de Berg M., van Kreveld M., Overmars M., Schwarzkopf O. "Computational Geometry" 2000;Springer-Verlag
4. Debled I., "Etude et reconnaissance des droites et plans discrets," Ph.D. thesis, Université Louis Pasteur - Strasbourg (1995).
5. Debled-Rennesson I., Reveillès J.-P. A linear algorithm for segmentation of digital curves. Parallel Image Analysis: Theory and Applications. 1993;73-100
6. Feschet F. and L. Tougne, Optimal time computation of the tangent of a discrete curve: Application to the curvature, in: Discrete Geometry for Computer Imagery, 1999.
7. Fisk S. Separating points sets by circles, and the recognition of digital disks. IEEE Transaction on Pattern Analysis and Machine Intelligence. 8:1986;554-556
8. Gérard Y., "Contribution à la géometrie discrète," Ph.D. thesis, Université d'Auvergne - Clermont-Ferrand I (1999).
9. Graham R.L. An efficient algorithm for determining the convex hull of a finite planar set. Information Processing Letters. 1:1972;132-133
10. Jonas A., Kiryati N. Digital representation schemes for 3d curves. Pattern Recognition. 30:1997;1803-1816
11. Kovalevsky, V. A., New definition and fast recognition of digital straight segments and arcs, Proceedings of the tenth international conference on Pattern Analysis and Machine Intelligence (1990).
12. Rosenfeld A. Digital straight lines segments. IEEE Transactions on Computers. 1974;1264-1369
13. Sklansky J. Measuring concavity on a rectangular mosaic. IEEE Trans. Comput. 21:1972;1355-1364
14. Sladoje N., Zunić J. Ellipses estimation from their digitization. 1347:1997;187-198
15. Toussaint G.T., Avis D. On a convex hull algorithm for polygons and its application to triangulation problems. Pattern Recognition. 1982
16. Vialard A. Geometrical parameters extraction from discrete paths. Discrete Geometry for Computer Imagery. 1996
17. Vittone J., "Caractérisation et reconnaissance de droites et de plans en géométrie discrète," Ph.D. thesis, Université Joseph Fourier-Grenoble 1 (1999).