  We revisit the stroke correspondence problem [13,14]. We optimize this
algorithm by 1) evaluating suitable preprocessing (normalization) methods 2)
extending the algorithm with an additional distance measure to handle Hiragana,
Katakana and Kanji characters with a low number of strokes and c) simplify the
stroke linking algorithms. Our contributions are implemented in the free,
open-source library ctegaki and in the demo-tools jTegaki and Kanjicanvas.
