pouët.net

Mystran information 30 glöps

• general:
• level: user
• personal:
• first name: Pihlaja
• last name: Voipio

• 4k Windows mansikkajäätelön iltalento
• Music is custom synth that's not terrible capable, because I was totally out of size by the time I had to add a soundtrack. :)
• isokadded on the 2017-01-08 07:58:47
• 4k Windows mansikkajäätelön iltalento
• I just realised I don't remember seeing the particular GPU sorting algorithm ever mentioned anywhere, so might just as well drop a note about it here (even though it might not be novel), since it's extremely simple (ie. take very little code to implement).
  
  It's essentially a variation of bitonic merge sort, it's incremental and it's based on the idea of simply pretending we have a bitonic sequence (even if we don't, which curiously enough is not very important):
  
  1. take array of 2^k=N elements and pair-wise sort first and last, second and second to last and so on in parallel ie. foreach i..N/2, sort(e[i],e[N-i-1]).
  
  2. split the array in half from the middle and repeat for each half recursively (in parallel, obviously), takes k=O(log N) passes until all the sub-arrays have size 1. The only difference between passes is the sub-division size, essentially just add varying modulo to the indexing calculation.
  
  3. it turns out (informally, but it works) that if the above process is repeated k=O(log N) times, we get a fully sorted result (giving a total complexity of O(log^2 N) parallel passes), however...
  
  ...in practice, the outer loop (step 3) doesn't need to run to completion, it can be done a few times per frame (every round improves the order more or less consistently, although some elements here and there might get a bit worse sometimes), the positions can be updated / rendered, and then keep sorting from whatever the order was previous frame. The intro does 10 or 15 or something like that outer passes per frame, but it's not very critical at all, even just a couple of passes will keep everything sorted "reasonably well."
  
  Obviously this might not be the best sorting algorithm if the actual implementation complexity doesn't matter (IIRC it needs about twice the passes of a proper bitonic sort), but it's ridiculously small and simple and still not terrible inefficient.
  
  So.. yeah.. I'd be surprised if I was the first to think of this algorithm, but at least now it's documented somewhere. :)
• isokadded on the 2017-01-07 04:55:24
• 32k Amiga AGA Amiga OCS/ECS I would rather by Saksalainen Laatu
• Just put 64kB limit on demo compo.. but this demo was great either way. :)
• rulezadded on the 2016-08-08 13:18:07
• 1k JavaScript ASTRA by Ribbon [web]
• My favourite also ... and definitely one of those intros where you forget that it's a really small file, because you don't really care, because it's a beautiful coherent piece of art that just "happens to be" really small, almost by accident. ;)
• rulezadded on the 2016-08-08 11:13:06
• 4k Windows mansikkajäätelön iltalento
• Actually, there is no curl-noise at all, it's pure stable-fluids... which is why I had so little space to actually make it interesting. :P
• isokadded on the 2016-08-08 03:03:37
• 4k Windows Outcast by Unknown Artists [web]
• This is truly something special!
• rulezadded on the 2016-08-08 02:13:04
• 4k Windows my first intro
• Thanks for kind words. For those wondering, yeah, I'm the guy does does VST plugins (signaldust) as well.
  
  So yeah, this was my first attempt at some size-coding, and I specifically wanted to do something that wouldn't involve fractals or raymarching... so made this about 90% old school CPU. Didn't quite expect it to do this well, though.
  
  But yeah, still searching for a job right now... so future productions depend on whether or not I manage to avoid starving to death before the next party. ;)
• isokadded on the 2014-08-12 20:24:09
• 64k Windows fr-022: ein.schlag by Farbrausch [web]
• This is cool.. i like this far more than .the .product.. some objects are rather crappy, but somehow this gives me the impression of "the product proved we can do quality in no space, no we do some demoscene quality with drunken style, in no more space"... really nice..
• rulezadded on the 2002-05-19 05:12:26
• 64k Windows fr-08: .the .product by Farbrausch [web]
• hmmh.. is it possible the camera sequences during and after the scroller where different when I watched this just a minute ago to refresh my memories from what they used to be, or do I just remeber wrong ????
• isokadded on the 2002-05-17 22:42:36
• 64k Windows tekniks 2.0 by Unique [web]
• hmmh.. for some reason I like the "say nothing" effects that really are ugly.. but the music is probably worst piece of shit i've ever heard. No offence :)
  
• isokadded on the 2002-05-13 02:35:12