Maximal superpositions of grids and an application

  • Gilles d'Andréa
  • Christophe Fiorio
2D Recognition
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1347)


In this paper, we present an efficient algorithm of maximals superpositions of two digital sets coded in grids. It represents the basis of an application which controls the printing quality of industrial products labels, in which we consider a grid as the representation of a character.


  1. [CL96]
    R. G. Casey and E. Lecolinet. A survey of methods and strategies in character segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 18(7):690–706, July 1996.Google Scholar
  2. [dF97]
    G. d'Andréa and C. Fiorio. Superpositions maximales de polyominos horizontalement convexes. Rapport de Recherche LIRMM, Laboratoire d'Informatique, de Robotique et de Microélectronique de Montpellier, 161 rue Ada — 34392 Montpellier Cedex 5 — France, July 1997.Google Scholar
  3. [Go154]
    S.W. Golomb. Checkerboards and polyominoes. American Mathematical Monthly, LXI, 10:672–682, December 1954.Google Scholar
  4. [Go165]
    S.W. Golomb. Polyominoes. Charles Scribner's Sons, New-York, 1965.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Gilles d'Andréa
    • 1
  • Christophe Fiorio
    • 1
  1. 1.LIRMMMontpellier Cedex 5

Personalised recommendations