28 Sep 14 at 6 pm


They wait here every time the shower is on

Satchi and Jack !!!

(via dancacomodiabo)


They wait here every time the shower is on

Satchi and Jack !!!
28 Sep 14 at 5 am


ArrayList<PointPosition> pointPosition = new ArrayList();
int width = 500,
    height = 700;

void setup() {
  size(width, height);
  threshold = 135;

void draw() {
  int i = 0;
  for(PointPosition p:pointPosition){
    p.tpos.x = width/2 + sin(i*TAU/(TAU/22)) * i;
    p.tpos.y = height/2 + cos(i*TAU/(TAU/22)) * i;
    if (p.pos.x > width || p.pos.x < 0) {
      p.tpos.x = width/2;
      p.pos.x = p.tpos.x;
    if (p.pos.y > height || p.pos.y < 0) {
      p.tpos.y = height/2;
      p.pos.y = p.tpos.y;

class PointPosition {
  PVector pos = new PVector();
  PVector tpos = new PVector();
  void update(){
  void render(){

void startScatter(){
  for (int i=0; i<width; i++) {
    PointPosition p = new PointPosition();
      p.pos.x = width/2;
      p.pos.y = height/2;
      p.tpos.x = width/2 + sin(i*TAU/(TAU/22)) * i;
      p.tpos.y = height/2 + cos(i*TAU/(TAU/22)) * i;

nice Moire patterns dude :)

(via alg0rh1tm)


//shell_140926aArrayList&lt;PointPosition&gt; pointPosition = new ArrayList();int width = 500,    height = 700;void setup() {  size(width, height);  background(0);  frameRate(24);  threshold = 135;  startScatter();}void draw() {  fill(0,1);  rect(-2,-2,width+2,height+2);  int i = 0;  for(PointPosition p:pointPosition){    i++;    p.tpos.x = width/2 + sin(i*TAU/(TAU/22)) * i;    p.tpos.y = height/2 + cos(i*TAU/(TAU/22)) * i;    p.update();    if (p.pos.x &gt; width || p.pos.x &lt; 0) {      p.tpos.x = width/2;      p.pos.x = p.tpos.x;    }    if (p.pos.y &gt; height || p.pos.y &lt; 0) {      p.tpos.y = height/2;      p.pos.y = p.tpos.y;    }    stroke(255);    p.render();  }}class PointPosition {  PVector pos = new PVector();  PVector tpos = new PVector();  void update(){    pos.lerp(tpos,0.001);  }  void render(){    point(pos.x,pos.y);  }}void startScatter(){  for (int i=0; i&lt;width; i++) {    PointPosition p = new PointPosition();      p.pos.x = width/2;      p.pos.y = height/2;      p.tpos.x = width/2 + sin(i*TAU/(TAU/22)) * i;      p.tpos.y = height/2 + cos(i*TAU/(TAU/22)) * i;    pointPosition.add(p);  }}

nice Moire patterns dude :)

via pohutukaryl
28 Sep 14 at 5 am


Spring Forest (5,3): embedded, unembedded, and cowl
12” x 11” x 9”
Knitted wool (Dream in Color Classy, in colors Happy Forest and Spring Tickle)
2009 and 2013
A (p,q) torus knot traverses the meridian cycle of a torus p times and the longitudinal cycle q times. Here are three instantiations of a (5,3) torus knot:
(a, middle) The knot embedded on a torus. A (p,q) torus knot may be drawn on a standard flat torus as a line of slope q/p. The challenge is to design a thickened line with constant slope on a curved surface.
(b, top) The knot projection knitted with a neighborhood of the embedding torus. The knitting proceeds meridianwise, as opposed to the embedded knot, which is knitted longitudinally. Here, one must form the knitting needle into a (5,3) torus knot prior to working rounds.
(c, bottom) The knot projection knitted into a cowl. The result looks like a skinny knotted torus.

Modern Striped Klein
2” x 14” x 7”
Knitted wool (Dream in Color Classy Firescorched in Aqua Jet with Sundown Orchid and Happy Forest)
This Klein bottle was knitted from an intrinsic-twist Mobius band with the boundary self-identified. A Klein bottle can be viewed as the connected sum of two projective planes; here, the stripes highlight the two circles that generate the fundamental groups of the individual projective planes. In some positions, this coloring of the Klein bottle resembles an ouroboros (a snake eating its own tail). The design is more than 10 years old; I recently realized that I had no high-quality example of it (only worn classroom models) and thus created one. Dream in Color veil-dyed yarn was chosen to add a color depth to the seed-stitch texture. Images of this piece graced the cover of the March-April 2013 issue of American Scientist.

Free-Range Mathematician
Sarah Lawrence College / Smith College
Hadley, MA

(via visualizingmath)

28 Sep 14 at 5 am


Did you miss math?

(via visualizingmath)

01 Sep 14 at 1 am

(Source: ostolero, via chelonaut)

01 Sep 14 at 1 am


John Conway first theorized that it would be impossible to create a forever-expanding universe using these rules, which was proven wrong by a team at MIT, creating the “glider gun,” which is featured in the third gif. 

Since then, thanks to computers, people all over the world have added new designs to the database, creating amazingly complex designs.

For example Andrew J. Wade created a design which replicates itself every 34 million generations! Furthermore it is also a spaceship (permanently moving pattern) and not only that, it was also the first spaceship that did not travel purely diagonally or horizontally/vertically! These types of spaceships are now appropriately named Knightships.

The simulation has some interesting properties, for example it has a theoretical maximum speed information can travel. Or simply, light speed - as that is the limit in our own universe. The limit is set to 1 cell per generation - after all how can you create something further than 1 cell away in one generation if you can only effect your immediate neighbours? And yet you can get things like the ‘stargate’ (Love the name, huge SG fan here.) which allows a space ship to travel 11 cells in just 6 generations.

Some smart people have even designed calculators, prime number generators and other incredibly complex patterns.

You can create your own patterns here: http://www.bitstorm.org/gameoflife/

All gifs were made from this video: https://www.youtube.com/watch?v=C2vgICfQawE

(via chelonaut)

27 Aug 14 at 2 am



(via flyinskies)