dwitter.net

+ New dweet
function u(t) {
} //
122/140


Please log in (or register) to post a dweet (copy-paste the code somewhere safe to save it meanwhile)


u(t) is called 60 times per second. t: Elapsed time in seconds. S: Shorthand for Math.sin. C: Shorthand for Math.cos. T: Shorthand for Math.tan. R: Function that generates rgba-strings, usage ex.: R(255, 255, 255, 0.5) c: A 1920x1080 canvas. x: A 2D context for that canvas.
show FPS hide FPS share fullscreen

function u(t) {

}//
140/140


Please log in (or register) to post as a new dweet (copy-paste code somewhere safe to save it meanwhile).

  • u/tomxor
    For the lazy game designer... Just add chip tunes and a player :D
  • u/tomxor
    #crt #degauss #sidescroller
  • u/magna
    Awesome!
  • u/magna
    I had a RGB CRT setup, but I hadn't been able to fit any interesting patterns: d/7512
  • u/tomxor
    I had a look at yours magna, they are true crt, much more realistic i think. The scan lines on this are just a sideeffect I exploited and it was easy to add colour distortion in the R().
  • u/magna
    Here we go: d/10843
  • u/C010011012
    is it a cellular automata?
  • u/tomxor
    Yes and no, it's a fractal n=T(0|(i/w+f^f-i/w)/(t**.7+6)) which is just a more elaborate variation of serpinsky triangles to produce more interesting patterns. Some fractals are automata, but not all automata are fractals, see here: https://en.wikipedia.org/wiki/Rule_90
  • u/tomxor
    The implication is serpinsky triangles are computationally reducable, meaning it does not have to be computed in the same way as a cellular automata i.e state can be computed at step t directly without traversing intermidiate steps.

Please log in (or register) to comment.

u(t) is called 60 times per second. t: elapsed time in seconds. c: A 1920x1080 canvas. x: A 2D context for that canvas. S: Math.sin C: Math.cos T: Math.tan R: Generates rgba-strings, ex.: R(255, 255, 255, 0.5)