Street Fighter II paper trails – allocating sprite space by hand
When writing a DMG emulator I thought about how these tiny sprites are often similar. A sprite will be a series of bytes with an address to the beginning.<p>It got me thinking about a kind of compression algorithm could find byte overlaps and re-pack the sprites, and then adjust the addresses.<p>This got me thinking: are there any compression algorithms that do not require decompression? You pack them once and then just point at slices.<p>Then this got me thinking: is that just what unzipping is doing, just eagerly?