\begin{thebibliography}{1}

\bibitem{2008-FAIR}
Jan Modersitzki.
\newblock {FAIR} -- {F}lexible {A}lgorithms for {I}mage {R}egistration.
\newblock \newline\url{http://www.cas.mcmaster.ca/~fair}, 2008.

\bibitem{2006-FLIRT}
SAFIR research group.
\newblock {FLIRT} -- a {FL}exible {I}mage {R}egistration {T}oolbox.
\newblock
  \newline\url{http://www.math.uni-luebeck.de/safir/FLIRT-Download/index.shtml%
}, 2006.

\bibitem{1991-COCA}
B.~Fischer and J.~Modersitzki.
\newblock {\sc Coca:} {CO}mplex {C}hebyshev {A}pproximation.
\newblock
  \newline\url{http://www.math.uni-luebeck.de//modersitzki/COCA/COCA.html},
  1991.

\end{thebibliography}
