Seven-segment display for kanji

It is a standard exercise to figure out the combinational logic that takes 4 bits of binary-coded decimal and outputs each of the segments of a numeric seven-segment display. No doubt someone has achieved the minimum number of NAND gates.

There are fun tricks one can play by increasing the levels of logic as well as sharing logic between between segments.

Consider the same problem, but on a much larger scale, given input of a CJK Unihan Unicode code point, produce a rasterized representation of the Chinese character. What is even the ballpark minimum number of NAND gates needed? It's a hard optimization problem.

Of course, the practical way to do this is with a ROM.