★ Bad Apple video (full) ★ ▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬ ▬▬▬▬▬▬▬▬▬▬▬▬ ★ Hi! I'm Wolther and I'm an intro maker ★ ▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬ info: 12fps 2601 frames 217 seconds of video (3minutes, 37seconds) rendered with a quadtree credits: @52525rr for the original video and an idea with compression how it works: basically I scanned the pixels from the video. Then I used a quadtree to render the data. To store this I put the path of the quadtree into a string of 1,2, and 3's. and then finally I compressed the string (from base 3) to base 35) It took me a while to get the compression working. I spent a whole day trying to make it but failed. Then I finally got it working to convert between base 2,3,4,5,6,7,8,9 and 10 after thinking of a new method. I then struggled to convert that to up to base 3000, but scratch doesn’t really like me and that didn’t work. I am 98 percent sure the theory works it’s just that I think it was a limit with scratch:/ so then I just did base 35 :P Also I originally stored the Quadtree by storing each root’s data in terms of how it it got there (which quadrants it was in when it split) (bad explanation lmao) but with more research and looking at @52525rr project I found the way @52525rr stored their Quadtree was more efficient so I stored it using the same method as them which basically tracks how you split the tree. Thanks to the coding train on YouTube for introducing me to Quadtrees Btw the amount of pixels scanned per frame is 250,000. That is more items in a list than scratch can store(200,000). Now it is stored in just all 2601 frames are stored In a total of 2601 items of avenging 700ish length
