/page/2
Candidate contributions in 2013 NYC Mayor election. Color = Candidate // Size = Amount // x,y = lat,long

Candidate contributions in 2013 NYC Mayor election. Color = Candidate // Size = Amount // x,y = lat,long

click and zoom

click and zoom

history of the world in 100 seconds

This is a unique look of the US Electrical Power Grid system. Unable to easily integrate the GIS data associated with the grid, I decided to use social networking algorithms to parse and color the data. I got this idea from the Six Degrees of Kevin Bacon joke and the scientists that took that joke a bit deeper. This is actually the dataset they used, and in their paper, they speak alot about how many man made networks end up following the laws of organic networks occurring in the natural. Cool! 

(in addition, on my search for the corresponding GIS data– I did find an interesing article release by EPRI. Saying that the average iPad being used will cost $1.39/year (12kw per year) to keep it working. Where as a flatscreen TV is 300kw / year!  

http://bit.ly/QoB0wI

// Complex math operations

//  - only some of these are used by this filter, but they are handy to have around :)

#define I float2(0.0, 1.0)

#define complexMult(a,b) float2(a.x*b.x - a.y*b.y, a.x*b.y + a.y*b.x)

#define complexMag(z) float(pow(length(z), 2.0))

#define complexReciprocal(z) float2(z.x / complexMag(z), -z.y / complexMag(z))

#define complexDivision(a,b) complexMult(a, complexReciprocal(b))

#define complexArg(z) float(atan(z.y, z.x))

#define complexLog(z) float2(log(length(z)), complexArg(z))

#define complexExp(z) float2(exp(z.x) * cos(z.y), exp(z.x) * sin(z.y))

#define sinh(x) float((exp(x) - exp(-x)) / 2.0)

#define cosh(x) float((exp(x) + exp(-x)) / 2.0)

#define complexSin(z) float2(sin(z.x) * cosh(z.y), cos(z.x) * sinh(z.y))

#define complexCos(z) float2(cos(z.x) * cosh(z.y), -sin(z.x) * sinh(z.y))

#define complexTan(z) float2(sin(2.0 * z.x)/(cos(2.0 * z.x) + cosh(2.0 * z.y)), sinh(2.0 * z.y)/(cos(2.0 * z.x) + cosh(2.0 * z.y)))

#define complexSinh(z) float2(sinh(z.x) * cos(z.y), cosh(z.x) * sin(z.y))

#define complexCosh(z) float2(cosh(z.x) * cos(z.y), sinh(z.x) * sin(z.y))

#define complexTanh(z) float2(sinh(2.0 * z.x)/(cosh(2.0 * z.a) + cos(2.0 * z.y)), sin(2.0 * z.y)/(cosh(2.0 * z.x) + cos(2.0 * z.y)))

#define polar(r,a) float2(cos(a) * r, sin(a) * r)

#define complexPower(z,p) float2(polar(pow(length(z), float(p)), float(p) * complexArg(z)))

This is a test of a social network. I figured a way to inverse the sizes of Degree. So the nodes (people) with the least amount of connections are now the largest. Didn’t tell me much, so back to the books.

This is a test of a social network. I figured a way to inverse the sizes of Degree. So the nodes (people) with the least amount of connections are now the largest. Didn’t tell me much, so back to the books.

Edward tufte is getting weird… it’s awesome.

Cool. Made possible by the following.


void setup() {
  size(500, 500);
  smooth();

}

void draw() {
  noStroke();
  for (int y = 0; y < height; y+=10) {
    for (int x = 0; x < width; x+=10) {
      fill(random(360), 222, 222);
      rect(x, y, 10, 10);
    }
  }
  noLoop();
}

Cool. Made possible by the following.

void setup() {

  size(500, 500);

  smooth();

}

void draw() {

  noStroke();

  for (int y = 0; y < height; y+=10) {

    for (int x = 0; x < width; x+=10) {

      fill(random(360), 222, 222);

      rect(x, y, 10, 10);

    }

  }

  noLoop();

}

Candidate contributions in 2013 NYC Mayor election. Color = Candidate // Size = Amount // x,y = lat,long

Candidate contributions in 2013 NYC Mayor election. Color = Candidate // Size = Amount // x,y = lat,long

click and zoom

click and zoom

history of the world in 100 seconds

This is a unique look of the US Electrical Power Grid system. Unable to easily integrate the GIS data associated with the grid, I decided to use social networking algorithms to parse and color the data. I got this idea from the Six Degrees of Kevin Bacon joke and the scientists that took that joke a bit deeper. This is actually the dataset they used, and in their paper, they speak alot about how many man made networks end up following the laws of organic networks occurring in the natural. Cool! 

(in addition, on my search for the corresponding GIS data– I did find an interesing article release by EPRI. Saying that the average iPad being used will cost $1.39/year (12kw per year) to keep it working. Where as a flatscreen TV is 300kw / year!  

http://bit.ly/QoB0wI

// Complex math operations

//  - only some of these are used by this filter, but they are handy to have around :)

#define I float2(0.0, 1.0)

#define complexMult(a,b) float2(a.x*b.x - a.y*b.y, a.x*b.y + a.y*b.x)

#define complexMag(z) float(pow(length(z), 2.0))

#define complexReciprocal(z) float2(z.x / complexMag(z), -z.y / complexMag(z))

#define complexDivision(a,b) complexMult(a, complexReciprocal(b))

#define complexArg(z) float(atan(z.y, z.x))

#define complexLog(z) float2(log(length(z)), complexArg(z))

#define complexExp(z) float2(exp(z.x) * cos(z.y), exp(z.x) * sin(z.y))

#define sinh(x) float((exp(x) - exp(-x)) / 2.0)

#define cosh(x) float((exp(x) + exp(-x)) / 2.0)

#define complexSin(z) float2(sin(z.x) * cosh(z.y), cos(z.x) * sinh(z.y))

#define complexCos(z) float2(cos(z.x) * cosh(z.y), -sin(z.x) * sinh(z.y))

#define complexTan(z) float2(sin(2.0 * z.x)/(cos(2.0 * z.x) + cosh(2.0 * z.y)), sinh(2.0 * z.y)/(cos(2.0 * z.x) + cosh(2.0 * z.y)))

#define complexSinh(z) float2(sinh(z.x) * cos(z.y), cosh(z.x) * sin(z.y))

#define complexCosh(z) float2(cosh(z.x) * cos(z.y), sinh(z.x) * sin(z.y))

#define complexTanh(z) float2(sinh(2.0 * z.x)/(cosh(2.0 * z.a) + cos(2.0 * z.y)), sin(2.0 * z.y)/(cosh(2.0 * z.x) + cos(2.0 * z.y)))

#define polar(r,a) float2(cos(a) * r, sin(a) * r)

#define complexPower(z,p) float2(polar(pow(length(z), float(p)), float(p) * complexArg(z)))

This is a test of a social network. I figured a way to inverse the sizes of Degree. So the nodes (people) with the least amount of connections are now the largest. Didn&#8217;t tell me much, so back to the books.

This is a test of a social network. I figured a way to inverse the sizes of Degree. So the nodes (people) with the least amount of connections are now the largest. Didn’t tell me much, so back to the books.

Edward tufte is getting weird… it’s awesome.

Cool. Made possible by the following.


void setup() {
  size(500, 500);
  smooth();

}

void draw() {
  noStroke();
  for (int y = 0; y &lt; height; y+=10) {
    for (int x = 0; x &lt; width; x+=10) {
      fill(random(360), 222, 222);
      rect(x, y, 10, 10);
    }
  }
  noLoop();
}

Cool. Made possible by the following.

void setup() {

  size(500, 500);

  smooth();

}

void draw() {

  noStroke();

  for (int y = 0; y < height; y+=10) {

    for (int x = 0; x < width; x+=10) {

      fill(random(360), 222, 222);

      rect(x, y, 10, 10);

    }

  }

  noLoop();

}

About:

Hello. My name is Zack DeSario. This is my life.