How does it work? - it uses a Quad Tree structure to compress large areas in an image into just 4 colors. - each large Leaf Node stores 4 4bit colors for each of its corners over which they interpolate. - each small Leaf Node stores 1 8bit color. - the colors are all packed into either a 24bit integer, or a 48bit integer. How did I make this so fast inside Scratch? - no clue T-T Why did I make this? - saw someone make Bad Apple using Quad Trees https://scratch.mit.edu/projects/1272522593/ but my implimentation is way off #compression
