@techreport{TR-IC-98-06,
  number = {IC-98-06},
  author = {Helena Cristina da Gama Leitão and Jorge Stolfi},
  title = {Automatic Reassembly of Irregular Fragments},
  month = {April},
  year = {1998}, 
  institution = {Institute of Computing, University of Campinas},
  note = {In English, 38 pages.
    \par\selectlanguage{english}\textbf{Abstract}
      This report addresses the following problem: given one or more
      unknown objects that have been broken or torn into a large
      number of irregular fragments, find the pairs of fragments
      that were adjacent in the original objects.
    \par
      Our approach is based on information extracted from the fragment
      outlines, which is used to compute the mismatch between pairs of
      pieces of contour. In order to asymptotically reduce the cost of
      matching, we use a {\em multiple scales} technique: after
      filtering and resampling the fragment outlines at several
      different scales of detail, we look for initial matchings at the
      coarsest possible scale.  We then repeatedly select the most
      promising pairs, and re-match them at the next finer scale of
      detail.  In the end, we are left with a small set of fragment
      pairs that are most likely to be adjacent in the original
      object.
  }
}