3 ms·
This is the first time learning about these, but it resembles a compression algorithm: an image of m * n bits is represented by m + n + d numbers, which may tak
by userbinator 3y ago
This is the first time learning about these, but it resembles a compression algorithm: an image of m * n bits is represented by m + n + d numbers, which may take less than m * n bits, a sort of 2D RLE. The compression algorithms used by faxes, T.4 and T.6, are also based on this idea.
Not be confused with nomograms: https://en.wikipedia.org/wiki/Nomogram https://en.wikipedia.org/wiki/Nomogram
- sdenton4 3y agoSadly, nonogram solving is in general NP-complete, which limits its usefulness as a compression algorithm. https://en.wikipedia.org/wiki/Nonogram#Nonograms_in_computing https://en.wikipedia.org/wiki/Nonogram#Nonograms_in_computin...