A Simplified Recognition Algorithm of Digital Planes Pieces

  • Mohammed Mostefa Mesmoudi
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2301)


Debled proposed an efficient algorithm for the recognition of rectangular digital planes pieces. However, uses, in some cases called strongly exterior cases, some validity criteria which are only sufficient but not necessary. In this paper we give necessary and sufficient conditions (including strongly exterior cases) to recognize pieces of digital planes. We build up a simplified form of Debled’s algorithm. Furthermore, our approach is independent from the rectangular form of pieces considered by Debled.


Convex Hull Vector Versus Convex Polygon Recognition Algorithm Great Common Divisor 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. [1]
    E. Andrès. Cercles discrets et rotations discrètes. PhD thesis, Louis Pasteur University, December 1992.Google Scholar
  2. [2]
    Y. Boukhatem. Sur la reconnaissance des plans discrets. Master Thesis, Mostaganem University, April 2001.Google Scholar
  3. [3]
    I. Debled-Rennesson. Etude et Reconnaissance des Droites et Plans Discrets. PhD thesis, Louis Pasteur University, October 1995.Google Scholar
  4. [4]
    I. Debled-Rennesson and J.P. Reveilles. Incremental algorithm for recognizing pieces of digital planes. In Spie’s Internat. Symp. on Optical Science, Engeneering and Instrumentation, Technical conference Vision Geometry 5, Denver, USA, Aug 1996.Google Scholar
  5. [5]
    S. H. Hung. On the straightness of digital arcs. In IEEE Transactions on Pattern Analysis and Machine Intelligence, volume PAMI 7, pages 203–215, 1985.Google Scholar
  6. [6]
    C.E. Kim and A. Rosenfeld. Convex digital solids. In IEEE Transactions on Pattern Analysis and Machine Intelligence, volume PAMI 6, pages 639–645, 1984.CrossRefGoogle Scholar
  7. [7]
    C.E. Kim and I. Stajmenović. On the recognition digital planes in threedimensional space. In North-Holland, editor, Pattern Recognition Letters, volume 12, pages 665–669, 1991.Google Scholar
  8. [8]
    M. M. Mesmoudi and I. Debled-Rennesson. Contribution à la reconnaissance des plans discrets. Technical report, Done at Loria Laboartory INRIA-Lorraine, April 2000.Google Scholar
  9. [9]
    M.M. Mesmoudi and I. Debled-Rennesson. Sur la reconnaissance des plans discrets. In Colloque d’Analyse et Application. Mostaganem University, Oct 1999.Google Scholar
  10. [10]
    J.P. Reveilles. Géométrie discrète, calculs en nombre entiers et algorithmique. Doctorat d’Etat thesis, Louis Pasteur University, Strasbourg, 1991.Google Scholar
  11. [11]
    I. Stojmenović and R. Tosić. Digitaziation schemes and the recognition of digital straight lines, hyperplanes and flats in arbitrary dimensions. In Vision Geometry, Contemporay Mathematics series, volume 119, pages 197–212. AMS, Providence, RI, 1991.Google Scholar
  12. [12]
    P. Veelaert. Digital planarity of rectangular surface segments. In IEEE Transactions on Pattern Analysis and Machine Intelligence, volume 16, pages 647–652, 1994.CrossRefGoogle Scholar
  13. [13]
    P. Veerlaert. On the flatness of digital hyperplanes, volume 3. Journal of Mathematical Imaging and Vision, 1993.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Mohammed Mostefa Mesmoudi
    • 1
  1. 1.Department of Computer Science and Information Science (DISI)Science University of GenoaGenoaItaly

Personalised recommendations