Medien Wiki - User contributions [en]

IFD:PhysicalComp2011/Augusto Gandia

2013-02-15T18:37:51Z

Augustogandia:

==Trip Book - digital and physical combination==

===First ideas===

Despite the differences from this concept of the 80', "teleportation" is real
nowadays. Last year I came from the other corner of the earth to Germany and after some hours the only perception which makes me understand the distance was the view through planes and trains windows. I arrived to Weimar and I could, like many other students, leave this place without seen more than the facilities of the University, the supermarkets and the down town streets. In the past, the communication between neighbor cities was through unclear paths across the outskirts. In the current way of living these are residual areas but it doesn't mean that are no interesting. I decide to take a map from Weimar and randomly visit different points of these undervalued zones and pick up an element which then reminds me that place. One leaf was the object that made that connection between my mind and the place and also a time connection due to the fact that leaves mutate when the times goes by.

<gallery>
File:2tabla.jpg
</gallery>

===Digital collected data===

Digital let us made things simple. By creating an small program in Processing we can access information like names of streets, distances and paths to reach every leaf. Also digital data like pictures doesn't change throw time so that phenomenon gives us the chance to compare, for example physical leaves with digital ones and see how they have changed.

<gallery>
File:3paths.jpg
</gallery>

===Physical collected data===

Physical let us have a Book (object). An object is something ephemeral that show us how the time modifies it and let us compare digital data and physical data. It is the old school way of storing data but it's not fact to argue that it's not a contemporary wonderful tool.

<gallery>
File:4hojas.jpg
</gallery>

===Demo Video===

<videoflash type=vimeo>36111919|450|250</videoflash>
<br><br>

===Places photographs===

<gallery>
File: imagen1.JPG
File: imagen2.JPG
File: imagen3.JPG
File: imagen4.JPG
File: imagen5.JPG
File: imagen6.JPG
File: imagen7.JPG
File: imagen8.JPG
File: imagen9.JPG
File: imagen10.JPG
File: imagen11.JPG
File: imagen12.JPG
</gallery>

===Leaves photographs===

<gallery>
File:hojitas1.jpg
File:hojitas2.jpg
File:hojitas3.jpg
File:hojitas4.jpg
File:hojitas5.jpg
File:hojitas6.jpg
File:hojitas7.jpg
File:hojitas8.jpg
File:hojitas9.jpg
File:hojitas10.jpg
File:hojitas11.jpg
</gallery>

===Book photographs===

<gallery>
File:Primero.jpg
File:Cuarta.jpg
</gallery>

===Some Links===
* [http://keiichimatsuda.com AR cities.]
* [http://postpolitical.us/blog/alternatives/tools_and_technology/social-bicycles-bikeshare-everywhere/ Social Bikes Tracking System]
* [http://www.discomole.com/2009/06/augmented-reality-book AR Book]
* Urbanism in Antiquity from Mesopotamia T: From Mesopotamia to Crete Walter Emanuel Aufrecht ISBN 978-1850756668

===Code===
<syntaxhighlight lang="cpp">
boolean overPoint1 = false;
boolean overPoint2 = false;
boolean overPoint3 = false;
boolean overPoint4 = false;
boolean overPoint5 = false;
boolean overPoint6 = false;
boolean overPoint7 = false;
boolean overPoint8 = false;
boolean overPoint9 = false;
boolean overPoint10 = false;
boolean overPoint11 = false;
boolean overPoint12 = false;

int[] line1xa = {
(800+2), (800-7), (800-40), (800-90), (800-130), (800-155), (800-185), (800-213), (800-245), (800-282), (800-285)
, (800-380), (800-380), (800-490)
};
int[] line1ya = {
(450-2), (450+17),(450+9), (450+98), (450+95), (450+68), (450+47), (450+34), (450+25), (450+25), (450+30)
, (450+24), (450-2), (450+30)
};

int[] line1x = {
(800+2), (800-7), (800+46), (800+38), (800-62)
};
int[] line1y = {
(450-2), (450+17), (450+33), (450+65), (450+140)
};

int[] line1xb = {
(800+2), (800-75), (800-105), (800-138), (800-149), (800-230), (800-390)
};
int[] line1yb = {
(450-2), (450-28),(450-128), (450-129), (450-122), (450-118), (450-86)
};

int[] line1xc = {
(800+2), (800-75), (800-105), (800-131), (800-175), (800-239), (800-259), (800-257), (800-240)
};
int[] line1yc = {
(450-2), (450-28),(450-128), (450-218), (450-226), (450-210), (450-250), (450-262), (450-290)
};

int[] line1xd = {
(800+2), (800-75), (800-105), (800-131), (800-175), (800-239), (800-259), (800-257), (800-332), (800-375), (800-424)
};
int[] line1yd = {
(450-2), (450-28),(450-128), (450-218), (450-226), (450-210), (450-250), (450-262), (450-257), (450-272), (450-271)
};

int[] line1xe = {
(800+2), (800+18), (800+144), (800+163), (800+182), (800+202), (800+214), (800+209), (800+241), (800+263), (800+301), (800+301), (800+510)
};
int[] line1ye = {
(450-2), (450-34), (450-4), (450-33), (450-31), (450-55), (450-90), (450-109), (450-121), (450-151), (450-143), (450-128), (450-95)
};

int[] line1xf = {
(800+2), (800+18), (800+33), (800+6), (800+12), (800+60), (800+68), (800+29), (800+8), (800+3), (800-49)
};
int[] line1yf = {
(450-2), (450-34), (450-64), (450-73), (450-82), (450-95), (450-102), (450-188), (450-195), (450-250), (450-255)
};

int[] line1xg = {
(800+2), (800+18), (800+33), (800+6), (800+12), (800+60), (800+68), (800+98), (800+110), (800+123), (800+123), (800+101)
};
int[] line1yg = {
(450-2), (450-34), (450-64), (450-73), (450-82), (450-95), (450-102), (450-127), (450-173), (450-230), (450-270), (450-345)
};

int[] line1xh = {
(800+2), (800+18), (800+33), (800+6), (800+12), (800+60), (800+68), (800+98), (800+110), (800+169), (800+205), (800+189), (800+184), (800+240), (800+352)
};
int[] line1yh = {
(450-2), (450-34), (450-64), (450-73), (450-82), (450-95), (450-102), (450-127), (450-173), (450-176), (450-189), (450-202), (450-236), (450-253), (450-339)
};

int[] line1xi = {
(800+2), (800+90), (800+115), (800+166), (800+120), (800+95)
};
int[] line1yi = {
(450-2), (450+20), (450+32), (450+38), (450+220), (450+255)
};

int[] line1xj = {
(800+2), (800+90), (800+115), (800+166), (800+171), (800+227), (800+400)
};
int[] line1yj = {
(450-2), (450+20), (450+32), (450+38), (450+44), (450+27), (450+207)
};

int[] line1xk = {
(800+2), (800+90), (800+115), (800+166), (800+171), (800+227), (800+250), (800+278), (800+315), (800+348), (800+350), (800+390), (800+457)
};
int[] line1yk = {
(450-2), (450+20), (450+32), (450+38), (450+44), (450+27), (450+25), (450+27), (450+45), (450+62), (450+67), (450+60), (450+63), (450+62)
};

float pos =0;
float pos2 =0;
float pos3 =0;
float pos4 =0;
float pos5 =0;
float pos6 =0;
float pos7 =0;
float pos8 =0;
float pos9 =0;
float pos10 =0;
float pos11 =0;
float pos12 =0;

void setup() {
size(1600,900);
background(255);
imageMode(CENTER);
}

void draw() {

noStroke();
background(255);
//a=(width/2)+11;
//b=(height/2)-45;
smooth();
// myImage=loadImage("mapa.jpg");
// image(myImage,a,b,1000,600);

//1 Drawing the points:

for(int i=0; i<line1xa.length; i++) {

int rad = 7;
if(i==line1xa.length -1 ) {
rad=12;
fill(222,255,126);
if(overPoint1 == true) {
rad = 40;
}
}
else {
fill(0);
}
ellipse(line1xa[i],line1ya[i], rad,rad);
}

//1 check if mouse is over the last (red) point:
if( mouseX<line1xa[line1xa.length-1]+50 && mouseX>line1xa[line1xa.length-1]-50 && mouseY<line1ya[line1ya.length-1]+50 && mouseY>line1ya[line1ya.length-1] -50 ) {
overPoint1 = true;
if(pos < line1xa.length-1) {
pos += 0.1;
}
}
else {
overPoint1 = false;
if(pos > 0) {
pos -= 0.1;
}
}
//1 connect the points:
stroke(0);
connect_line(line1xa, line1ya, pos);

//2 Drawing the points:
noStroke();
for(int i=0; i<line1x.length; i++) {
int rad = 7;
if(i==line1x.length -1 ) {
rad=12;
fill(222,255,126);
if(overPoint2 == true) {
rad = 40;
}
}
else {
fill(0);
}
ellipse(line1x[i],line1y[i], rad,rad);
}

//2 check if mouse is over the last (red) point:
if( mouseX<line1x[line1x.length-1]+50 && mouseX>line1x[line1x.length-1]-50 && mouseY<line1y[line1y.length-1]+50 && mouseY>line1y[line1y.length-1] -50 ) {
overPoint2 = true;
if(pos2 < line1x.length-1) {
pos2 += 0.1;
}
}
else {
overPoint2 = false;
if(pos2 > 0) {
pos2 -= 0.1;
}
}
//2 connect the points:
stroke(0);

connect_line2(line1x, line1y, pos2);

//3 Drawing the points:
noStroke();
for(int i=0; i<line1xb.length; i++) {
int rad = 7;
if(i==line1xb.length -1 ) {
fill(222,255,126);
rad=12;
if(overPoint3 == true) {
rad = 40;
}
}
else {
fill(0);
}
ellipse(line1xb[i],line1yb[i], rad,rad);
}

//3 check if mouse is over the last (red) point:
if( mouseX<line1xb[line1xb.length-1]+50 && mouseX>line1xb[line1xb.length-1]-50 && mouseY<line1yb[line1yb.length-1]+50 && mouseY>line1yb[line1yb.length-1] -50 ) {
overPoint3 = true;
if(pos3 < line1xb.length-1) {
pos3 += 0.1;
}
}
else {
overPoint3 = false;
if(pos3 > 0) {
pos3 -= 0.1;
}
}
//3 connect the points:
stroke(0);
connect_line3(line1xb, line1yb, pos3);

//4 Drawing the points:
noStroke();
for(int i=0; i<line1xc.length; i++) {
int rad = 7;
if(i==line1xc.length -1 ) {
fill(222,255,126);
rad=12;
if(overPoint4 == true) {
rad = 40;
}
}
else {
fill(0);
}
ellipse(line1xc[i],line1yc[i], rad,rad);
}

//4 check if mouse is over the last (red) point:
if( mouseX<line1xc[line1xc.length-1]+50 && mouseX>line1xc[line1xc.length-1]-50 && mouseY<line1yc[line1yc.length-1]+50 && mouseY>line1yc[line1yc.length-1] -50 ) {
overPoint4 = true;
if(pos4 < line1xc.length-1) {
pos4 += 0.1;
}
}
else {
overPoint4 = false;
if(pos4 > 0) {
pos4 -= 0.1;
}
}
//4 connect the points:
stroke(0);
connect_line4(line1xc, line1yc, pos4);

//5 Drawing the points:
noStroke();
for(int i=0; i<line1xd.length; i++) {
int rad = 7;
if(i==line1xd.length -1 ) {
fill(222,255,126);
rad=12;
if(overPoint5 == true) {
rad = 40;
}
}
else {
fill(0);
}
ellipse(line1xd[i],line1yd[i], rad,rad);
}

//5 check if mouse is over the last (red) point:
if( mouseX<line1xd[line1xd.length-1]+50 && mouseX>line1xd[line1xd.length-1]-50 && mouseY<line1yd[line1yd.length-1]+50 && mouseY>line1yd[line1yd.length-1] -50 ) {
overPoint5 = true;
if(pos5 < line1xd.length-1) {
pos5 += 0.1;
}
}
else {
overPoint5 = false;
if(pos5 > 0) {
pos5 -= 0.1;
}
}
//5 connect the points:
stroke(0);
connect_line5(line1xd, line1yd, pos5);

//6 Drawing the points:
noStroke();
for(int i=0; i<line1xe.length; i++) {
int rad = 7;
if(i==line1xe.length -1 ) {
fill(222,255,126);
rad=12;
if(overPoint6 == true) {
rad = 40;
}
}
else {
fill(0);
}
ellipse(line1xe[i],line1ye[i], rad,rad);
}

//6 check if mouse is over the last (red) point:
if( mouseX<line1xe[line1xe.length-1]+50 && mouseX>line1xe[line1xe.length-1]-50 && mouseY<line1ye[line1ye.length-1]+50 && mouseY>line1ye[line1ye.length-1] -50 ) {
overPoint6 = true;
if(pos6 < line1xe.length-1) {
pos6 += 0.1;
}
}
else {
overPoint6 = false;
if(pos6 > 0) {
pos6 -= 0.1;
}
}
//6 connect the points:
stroke(0);
connect_line6(line1xe, line1ye, pos6);

//7 Drawing the points:
noStroke();
for(int i=0; i<line1xf.length; i++) {
int rad = 7;
if(i==line1xf.length -1 ) {
fill(222,255,126);
rad=12;
if(overPoint7 == true) {
rad = 40;
}
}
else {
fill(0);
}
ellipse(line1xf[i],line1yf[i], rad,rad);
}

//7 check if mouse is over the last (red) point:
if( mouseX<line1xf[line1xf.length-1]+50 && mouseX>line1xf[line1xf.length-1]-50 && mouseY<line1yf[line1yf.length-1]+50 && mouseY>line1yf[line1yf.length-1] -50 ) {
overPoint7 = true;
if(pos7 < line1xf.length-1) {
pos7 += 0.1;
}
}
else {
overPoint7 = false;
if(pos7 > 0) {
pos7 -= 0.1;
}
}
//7 connect the points:
stroke(0);
connect_line7(line1xf, line1yf, pos7);

//8 Drawing the points:
noStroke();
for(int i=0; i<line1xg.length; i++) {
int rad = 7;
if(i==line1xg.length -1 ) {
fill(222,255,126);
rad=12;
if(overPoint8 == true) {
rad = 40;
}
}
else {
fill(0);
}
ellipse(line1xg[i],line1yg[i], rad,rad);
}

//8 check if mouse is over the last (red) point:
if( mouseX<line1xg[line1xg.length-1]+50 && mouseX>line1xg[line1xg.length-1]-50 && mouseY<line1yg[line1yg.length-1]+50 && mouseY>line1yg[line1yg.length-1] -50 ) {
overPoint8 = true;
if(pos8 < line1xg.length-1) {
pos8 += 0.1;
}
}
else {
overPoint8 = false;
if(pos8 > 0) {
pos8 -= 0.1;
}
}
//8 connect the points:
stroke(0);
connect_line8(line1xg, line1yg, pos8);

//9 Drawing the points:
noStroke();
for(int i=0; i<line1xh.length; i++) {
int rad = 7;
if(i==line1xh.length -1 ) {
fill(222,255,126);
rad=12;
if(overPoint9 == true) {
rad = 40;
}
}
else {
fill(0);
}
ellipse(line1xh[i],line1yh[i], rad,rad);
}

//9 check if mouse is over the last (red) point:
if( mouseX<line1xh[line1xh.length-1]+50 && mouseX>line1xh[line1xh.length-1]-50 && mouseY<line1yh[line1yh.length-1]+50 && mouseY>line1yh[line1yh.length-1] -50 ) {
overPoint9 = true;
if(pos9 < line1xh.length-1) {
pos9 += 0.1;
}
}
else {
overPoint9 = false;
if(pos9 > 0) {
pos9 -= 0.1;
}
}
//9 connect the points:
stroke(0);
connect_line9(line1xh, line1yh, pos9);

//10 Drawing the points:
noStroke();
for(int i=0; i<line1xi.length; i++) {
int rad = 7;
if(i==line1xi.length -1 ) {
fill(222,255,126);
rad=12;
if(overPoint10 == true) {
rad = 40;
}
}
else {
fill(0);
}
ellipse(line1xi[i],line1yi[i], rad,rad);
}

//10 check if mouse is over the last (red) point:
if( mouseX<line1xi[line1xi.length-1]+50 && mouseX>line1xi[line1xi.length-1]-50 && mouseY<line1yi[line1yi.length-1]+50 && mouseY>line1yi[line1yi.length-1] -50 ) {
overPoint10 = true;
if(pos10 < line1xi.length-1) {
pos10 += 0.1;
}
}
else {
overPoint10 = false;
if(pos10 > 0) {
pos10 -= 0.1;
}
}
//10 connect the points:
stroke(0);
connect_line10(line1xi, line1yi, pos10);

//11 Drawing the points:
noStroke();
for(int i=0; i<line1xj.length; i++) {
int rad = 7;
if(i==line1xj.length -1 ) {
fill(222,255,126);
rad=12;
if(overPoint11 == true) {
rad = 40;
}
}
else {
fill(0);
}
ellipse(line1xj[i],line1yj[i], rad,rad);
}

//11 check if mouse is over the last (red) point:
if( mouseX<line1xj[line1xj.length-1]+50 && mouseX>line1xj[line1xj.length-1]-50 && mouseY<line1yj[line1yj.length-1]+50 && mouseY>line1yj[line1yj.length-1] -50 ) {
overPoint11 = true;
if(pos11 < line1xj.length-1) {
pos11 += 0.1;
}
}
else {
overPoint11 = false;
if(pos11 > 0) {
pos11 -= 0.1;
}
}
//11 connect the points:
stroke(0);
connect_line11(line1xj, line1yj, pos11);

//12 Drawing the points:
noStroke();
for(int i=0; i<line1xk.length; i++) {
int rad = 7;
if(i==line1xk.length -1 ) {
fill(222,255,126);
rad=12;
if(overPoint12 == true) {
rad = 40;
}
}
else {
fill(0);
}
ellipse(line1xk[i],line1yk[i], rad,rad);
}
//12 check if mouse is over the last (red) point:
if( mouseX<line1xk[line1xk.length-1]+50 && mouseX>line1xk[line1xk.length-1]-50 && mouseY<line1yk[line1yk.length-1]+50 && mouseY>line1yk[line1yk.length-1] -50 ) {
overPoint12 = true;
if(pos12 < line1xk.length-1) {
pos12 += 0.1;
}
}
else {
overPoint12 = false;
if(pos12 > 0) {
pos12 -= 0.1;
}
}
//12 connect the points:
stroke(0);
connect_line12(line1xk, line1yk, pos12);
}
void connect_line(int[] xArray, int[] yArray, float position) {

int num_points = xArray.length;
int full_pos = int(position);
float rest_pos = position - full_pos;

for (int i=0; i < full_pos; i++) {
if(i < num_points) {
line(xArray[i], yArray[i], xArray[i+1], yArray[i+1]);
}
}

if (full_pos < num_points-1) {
float betweenX = lerp(xArray[full_pos], xArray[full_pos+1], rest_pos);
float betweenY = lerp(yArray[full_pos], yArray[full_pos+1], rest_pos);
line(xArray[full_pos], yArray[full_pos], betweenX, betweenY);
}
}
void connect_line2(int[] xArray, int[] yArray, float position) {

int num_points = xArray.length;
int full_pos = int(position);
float rest_pos = position - full_pos;

for (int i=0; i < full_pos; i++) {
if(i < num_points) {
line(xArray[i], yArray[i], xArray[i+1], yArray[i+1]);
}
}

if (full_pos < num_points-1) {
float betweenX = lerp(xArray[full_pos], xArray[full_pos+1], rest_pos);
float betweenY = lerp(yArray[full_pos], yArray[full_pos+1], rest_pos);
line(xArray[full_pos], yArray[full_pos], betweenX, betweenY);
}
}

void connect_line3(int[] xArray, int[] yArray, float position) {

int num_points = xArray.length;
int full_pos = int(position);
float rest_pos = position - full_pos;

for (int i=0; i < full_pos; i++) {
if(i < num_points) {
line(xArray[i], yArray[i], xArray[i+1], yArray[i+1]);
}
}

if (full_pos < num_points-1) {
float betweenX = lerp(xArray[full_pos], xArray[full_pos+1], rest_pos);
float betweenY = lerp(yArray[full_pos], yArray[full_pos+1], rest_pos);
line(xArray[full_pos], yArray[full_pos], betweenX, betweenY);
}
}

void connect_line4(int[] xArray, int[] yArray, float position) {

int num_points = xArray.length;
int full_pos = int(position);
float rest_pos = position - full_pos;

for (int i=0; i < full_pos; i++) {
if(i < num_points) {
line(xArray[i], yArray[i], xArray[i+1], yArray[i+1]);
}
}

if (full_pos < num_points-1) {
float betweenX = lerp(xArray[full_pos], xArray[full_pos+1], rest_pos);
float betweenY = lerp(yArray[full_pos], yArray[full_pos+1], rest_pos);
line(xArray[full_pos], yArray[full_pos], betweenX, betweenY);
}
}
void connect_line5(int[] xArray, int[] yArray, float position) {

int num_points = xArray.length;
int full_pos = int(position);
float rest_pos = position - full_pos;

for (int i=0; i < full_pos; i++) {
if(i < num_points) {
line(xArray[i], yArray[i], xArray[i+1], yArray[i+1]);
}
}

if (full_pos < num_points-1) {
float betweenX = lerp(xArray[full_pos], xArray[full_pos+1], rest_pos);
float betweenY = lerp(yArray[full_pos], yArray[full_pos+1], rest_pos);
line(xArray[full_pos], yArray[full_pos], betweenX, betweenY);
}
}

void connect_line6(int[] xArray, int[] yArray, float position) {

int num_points = xArray.length;
int full_pos = int(position);
float rest_pos = position - full_pos;

for (int i=0; i < full_pos; i++) {
if(i < num_points) {
line(xArray[i], yArray[i], xArray[i+1], yArray[i+1]);
}
}

if (full_pos < num_points-1) {
float betweenX = lerp(xArray[full_pos], xArray[full_pos+1], rest_pos);
float betweenY = lerp(yArray[full_pos], yArray[full_pos+1], rest_pos);
line(xArray[full_pos], yArray[full_pos], betweenX, betweenY);
}
}
void connect_line7(int[] xArray, int[] yArray, float position) {

int num_points = xArray.length;
int full_pos = int(position);
float rest_pos = position - full_pos;

for (int i=0; i < full_pos; i++) {
if(i < num_points) {
line(xArray[i], yArray[i], xArray[i+1], yArray[i+1]);
}
}

if (full_pos < num_points-1) {
float betweenX = lerp(xArray[full_pos], xArray[full_pos+1], rest_pos);
float betweenY = lerp(yArray[full_pos], yArray[full_pos+1], rest_pos);
line(xArray[full_pos], yArray[full_pos], betweenX, betweenY);
}
}
void connect_line8(int[] xArray, int[] yArray, float position) {

int num_points = xArray.length;
int full_pos = int(position);
float rest_pos = position - full_pos;

for (int i=0; i < full_pos; i++) {
if(i < num_points) {
line(xArray[i], yArray[i], xArray[i+1], yArray[i+1]);
}
}

if (full_pos < num_points-1) {
float betweenX = lerp(xArray[full_pos], xArray[full_pos+1], rest_pos);
float betweenY = lerp(yArray[full_pos], yArray[full_pos+1], rest_pos);
line(xArray[full_pos], yArray[full_pos], betweenX, betweenY);
}
}
void connect_line9(int[] xArray, int[] yArray, float position) {

int num_points = xArray.length;
int full_pos = int(position);
float rest_pos = position - full_pos;

for (int i=0; i < full_pos; i++) {
if(i < num_points) {
line(xArray[i], yArray[i], xArray[i+1], yArray[i+1]);
}
}

if (full_pos < num_points-1) {
float betweenX = lerp(xArray[full_pos], xArray[full_pos+1], rest_pos);
float betweenY = lerp(yArray[full_pos], yArray[full_pos+1], rest_pos);
line(xArray[full_pos], yArray[full_pos], betweenX, betweenY);
}
}

void connect_line10(int[] xArray, int[] yArray, float position) {

int num_points = xArray.length;
int full_pos = int(position);
float rest_pos = position - full_pos;

for (int i=0; i < full_pos; i++) {
if(i < num_points) {
line(xArray[i], yArray[i], xArray[i+1], yArray[i+1]);
}
}

if (full_pos < num_points-1) {
float betweenX = lerp(xArray[full_pos], xArray[full_pos+1], rest_pos);
float betweenY = lerp(yArray[full_pos], yArray[full_pos+1], rest_pos);
line(xArray[full_pos], yArray[full_pos], betweenX, betweenY);
}
}

void connect_line11(int[] xArray, int[] yArray, float position) {

int num_points = xArray.length;
int full_pos = int(position);
float rest_pos = position - full_pos;

for (int i=0; i < full_pos; i++) {
if(i < num_points) {
line(xArray[i], yArray[i], xArray[i+1], yArray[i+1]);
}
}

if (full_pos < num_points-1) {
float betweenX = lerp(xArray[full_pos], xArray[full_pos+1], rest_pos);
float betweenY = lerp(yArray[full_pos], yArray[full_pos+1], rest_pos);
line(xArray[full_pos], yArray[full_pos], betweenX, betweenY);
}
}

void connect_line12(int[] xArray, int[] yArray, float position) {

int num_points = xArray.length;
int full_pos = int(position);
float rest_pos = position - full_pos;

for (int i=0; i < full_pos; i++) {
if(i < num_points) {
line(xArray[i], yArray[i], xArray[i+1], yArray[i+1]);
}
}

if (full_pos < num_points-1) {
float betweenX = lerp(xArray[full_pos], xArray[full_pos+1], rest_pos);
float betweenY = lerp(yArray[full_pos], yArray[full_pos+1], rest_pos);
line(xArray[full_pos], yArray[full_pos], betweenX, betweenY);
}
}
</syntaxhighlight>

IFD:ShowreelWS1112/Augusto Gandia - Trip Book

2012-02-03T00:02:04Z

Augustogandia: Created page with "*[http://vimeo.com/36111919]"

*[http://vimeo.com/36111919]

IFD:ShowreelWS1112

2012-01-30T15:08:42Z

Augustogandia:

[[File:Ifd_showreel_20120114b.png]]

<h3 style="color:#0083D6;">INFOS</h3>
'''Präsentation WS 2011/12'''<br>
Professur Interface Design<br>
Prof. Dr. Jens Geelhaar, Frederic Gmeiner, Michael Markert, Gabriel Rausch, Martin Schied,

'''03. Februar 2012'''
'''11:00 - 17:00 Uhr'''<br>
'''Audimax'''<br>
Steubenstraße 6, Haus F

Die Präsentation der Professur Interface Design bietet die Möglichkeit,<br> einen Einblick in die Semesterarbeiten und die Inhalte der angeboten Module zu<br> bekommen. Die Veranstaltung lädt nicht nur Studenten des Bereichs IFD <br>ein, sondern ist offen für alle Interessierten.

<h3 style="color:#0083D6;">HOW TO...</h3>
[[/Wie stelle ich mein Projekt ins Wiki?/]]<br>

Beispiel-Eintrag:<br>
[[/Vorname Nachname - Projekttitel/]]

<h3 style="color:#0083D6;">PROGRAMM</h3>

'''11:00 - 13:00 Block "Projektmodule"'''

* Projektmodul 'Interaktive Bildmedien' (DEUTSCH)
**[[/Reinhard & Tobias & Lydia & Anastasiya - Weimarpedia Kids (Redesign) (15 min)/]]
**[[/Sven & Carlo - Weimarpedia Kids (Spiel und Spaß)/]]
**[[/Juliane & Alex - Weimarpedia Kids (neuer Inhalt) (5 min)/]]
**[[/Melanie & Christiane - IPad-Film kinderleicht?/]]

* Projektmodul 'Zeitmaschinen' (ENGLISH)
**[[/Claudia Heinze - Kreativrhythmus/]]
**[[/Liana Chandra - Musical Movements/]]
**[[/Dianna Mertz - In-Depth: Smart Containers/]]
**[[/Yunshui Jin - Magic Wall/]]

'''Mittagspause'''

'''13:45 - 15:00 Block "Fachmodule"'''

* Fachmodul 'iOS Development II'
**[[/Andreas - Game of Life/]]
**[[/Antje - Projekttitel/]]
**[[/Johannes - Museum/]]
**[[/Patawat - CO2/]]
**[[/Stephan - Projekttitel/]]

* Fachmodul 'Physical Computing'
**[[/Vorname Nachname - Projekttitel/]]
**[[/Yue Mao - Color your life/]]
**[[/Yunshui Jin - 3D Scan/]]
**[[/Julia Putscher & Reinhard W. - EHP - Emotion Heartbeat Project/]]
**[[/ Augusto Gandia - Trip Book/]]

'''15:00 - 17:00 Block "Werkmodule"'''

* Werkmodul 'Interface-Entwicklung für Fortgeschrittene'
** [[/Bastian Bischoff - Projekttitel/]]
** [[/Antje Danz - Projekttitel/]]
** [[/Georg Müller - Projekttitel/]]
** [[/Tobias Wolf - Projekttitel/]]
** [[/Daniel Schulz - Projekttitel/]]
** [[/Michel Buechner - Projekttitel/]]
** [[/Marcel Döpel - Projekttitel/]]
** [[/Johannes Altmann - Projekttitel/]]
** [[/Jan Grassegger & Daniel Plath - Projekttitel/]]

* Werkmodul 'Grundlagen Webentwicklung'
**[[/Wiebke Jahns - "This is what we mean, when we say..."/]]

* Werkmodul 'Grundlagen Elektronik'
**[[/Vorname Nachname - Projekttitel/]]

'''17:00 Schlusswort'''

IFD:PhysicalComp2011/Augusto Gandia

2012-01-01T16:32:16Z

Augustogandia:

==Trip Book==
<br>
===Concept===

<gallery>
File:primera.jpg|quick review
File:segunda.jpg|tree example
File:tercera.jpg|result
</gallery>
<br>
===some collected data===

<gallery>
File:camino1.jpg|path 1
File:hoja1.jpg|leaf 1
File:camino2.jpg|path 2
File:hoja2.jpg|leaf 2
</gallery>
<br>

===Some Links===
====technologies====
*[http://keiichimatsuda.com/]
*[http://postpolitical.us/blog/alternatives/tools_and_technology/social-bicycles-bikeshare-everywhere/]
*[http://www.discomole.com/2009/06/augmented-reality-book/]

File:Hoja2.jpg

2012-01-01T16:31:48Z

Augustogandia:

== Summary ==

== Copyright status: ==

== Source: ==

File:Hoja1.jpg

2012-01-01T16:30:42Z

Augustogandia:

== Summary ==

== Copyright status: ==

== Source: ==

IFD:PhysicalComp2011/Augusto Gandia

2012-01-01T16:18:09Z

Augustogandia:

==Trip Book==
<br>
===Concept===

<gallery>
File:primera.jpg|quick review
File:segunda.jpg|tree example
File:tercera.jpg|result
</gallery>
<br>
===some collected data===

<gallery>
File:camino1.jpg|path 1
File:hojita1.jpg|leaf 1
File:camino2.jpg|path 2
File:hojita2.jpg|leaf 2
</gallery>
<br>

===Some Links===
====technologies====
*[http://keiichimatsuda.com/]
*[http://postpolitical.us/blog/alternatives/tools_and_technology/social-bicycles-bikeshare-everywhere/]
*[http://www.discomole.com/2009/06/augmented-reality-book/]

IFD:PhysicalComp2011/Augusto Gandia

2012-01-01T16:04:39Z

Augustogandia:

==Trip Book==
<br>
===Concept===

<gallery>
File:primera.jpg|quick review
File:segunda.jpg|tree example
File:tercera.jpg|result
</gallery>
<br>
===some collected data===

<gallery>
File:camino1.jpg|path 1
File:hojita1.jpg|leaf 1
File:camino2.jpg|path 2
File:hojita2.jpg|leaf 2
</gallery>
<br>

===Some Links===
====technologies====
http://keiichimatsuda.com/
http://postpolitical.us/blog/alternatives/tools_and_technology/social-bicycles-bikeshare-everywhere/
http://www.discomole.com/2009/06/augmented-reality-book/

File:Hojita2.JPG

2012-01-01T16:04:08Z

Augustogandia:

== Summary ==

== Copyright status: ==

== Source: ==

File:Camino2.jpg

2012-01-01T16:03:26Z

Augustogandia:

== Summary ==

== Copyright status: ==

== Source: ==

File:Hojita1.JPG

2012-01-01T16:02:39Z

Augustogandia:

== Summary ==

== Copyright status: ==

== Source: ==

File:Camino1.jpg

2012-01-01T16:00:46Z

Augustogandia:

== Summary ==

== Copyright status: ==

== Source: ==

IFD:PhysicalComp2011/Augusto Gandia

2012-01-01T15:42:14Z

Augustogandia:

==Trip Book==
<br>
===Concept===

<gallery>
File:primera.jpg|quick review
File:segunda.jpg|tree example
File:tercera.jpg|result
</gallery>
<br>

===Some Links===

IFD:PhysicalComp2011/Augusto Gandia

2012-01-01T15:38:05Z

Augustogandia:

==Trip Book==
<br>
===Concept===

<gallery>
File:primera.jpg|quick review
File:segunda.jpg|tree example
File:tercera.jpg|result
</gallery>
<br>

=====Related Links To That Topic=====

File:Tercera.jpg

2012-01-01T15:37:40Z

Augustogandia:

== Summary ==

== Copyright status: ==

== Source: ==

File:Segunda.jpg

2012-01-01T15:36:17Z

Augustogandia:

== Summary ==

== Copyright status: ==

== Source: ==

File:Primera.jpg

2012-01-01T15:33:10Z

Augustogandia:

== Summary ==

== Copyright status: ==

== Source: ==

File:Pic5.jpg

2011-12-15T16:54:57Z

Augustogandia:

== Summary ==

== Copyright status: ==

== Source: ==

IFD:PhysicalComp2011/Augusto Gandia

2011-11-28T16:40:36Z

Augustogandia:

<gallery>
File:test.png|WinMe Project Synopsis#1

</gallery>

IFD:PhysicalComp2011/Augusto Gandia

2011-11-28T16:40:19Z

Augustogandia:

<gallery>
File:Winme_1.png|WinMe Project Synopsis#1

</gallery>

IFD:PhysicalComp2011/Augusto Gandia

2011-11-28T16:39:38Z

Augustogandia:

File:Winme_1.png|WinMe Project Synopsis#1[[]]

IFD:PhysicalComp2011/Augusto Gandia

2011-11-28T16:39:22Z

Augustogandia: Created page with "File:Winme_1.png|WinMe Project Synopsis#1"

File:Winme_1.png|WinMe Project Synopsis#1

IFD:PhysicalComp2011

2011-10-24T15:30:21Z

Augustogandia:

[[:Category:Fachmodul|Fachmodul]]<br>
''Lehrperson:'' [[Frederic Gmeiner]]<br/>
''Bewertung:'' 6 [[ECTS]], 4 [[SWS]]<br/>
''Termin:'' Montag, 15:15 bis 18:30 Uhr<br/>
''Ort:'' [[Marienstraße 7b]], Raum 104 (wird voraussichtlich noch geändert!)<br/>
''Erster Termin:'' 17.10.2011

==Beschreibung==
Data Stories: Tools for self-reflection

Datenjounalismus bezeichnet allgemein die Verwendung von öffentlich zugänglichen Daten zur Generierung von (interaktiven) Informationsgrafiken zur Erweiterung klassischer journalistischer Reportagen. Die Form der »Datengeschichte« können jedoch auch für den persönlichen Gebrauch interessant sein, denn durch die stetig wachsende Präsenz von Sensoren in Consumer Geräten ist es heute sowohl für den privaten und individuellen Zweck ohne große Mühe machbar eigene Daten über sich selbst und seine Umwelt zu sammeln.

Wie lassen sich diese Daten, die bei der Benutzung von (digitalen) Geräten im Alltag entstehen, nutzen? Welchen Mehrwert können diese Archive für uns selbst oder für eine Gemeinschaft haben? Wie lassen sich gesammelte Informationen inszenieren, sodass diese einen persönlichen Wert erhalten?

Im Mittelpunkt des Kurses steht ein Selbstexperiment bei dem selbst gewählte Daten über einen Zeitraum gesammelt und anschließend inszeniert werden sollen. Hierbei soll eine Übersetzung eines analogen Datensatzes in einen digitalen (oder umgekehrt) stattfinden wobei die dafür verwendeten Geräte und Programme gemeinsam im Rahmen des Kurses entwickelt werden.

Auf der einen Seite werden technische Aspekte und Grundlagen des physical computings behandelt. Ausgangspunkt hierfür ist die Arduino Microcontroller-Plattform sowie die Programmierumgebungen Processing und OpenFrameworks. Je nach vorhandenem Kenntnisstand der Teilnehmer und Anforderungen des jeweiligen Projektes werden weitere Themen angeschlossen, wobei dieses auch in Form von Referaten geschehen kann.

Gleichzeitig sollen alle Teilnehmer im Kurs ein eigenes Projekt entwickeln bei dem das Entwerfen individueller Werkzeuge und Strategien zur Sammlung und Inszenierung (persönlicher) Daten im Vordergrund steht. Dieses kann sowohl anwendungsorientiert wie frei künstlerisch sein.

===English description===

How can we utilise all the meta-data that is being created by the usage of our everyday (digital) devices for an individual purpose? What is the benefit of these archives for ourself or a community? In what way can we stage information, so that it becomes more personal and emotional?

Together we will develop individual tools and strategies to collect and expose (personal) data, either with an application-oriented or an artistic approach.

In order to realise these projects, students will learn about the technical aspects and basics of physical computing with a focus on the Arduino micro-controller as well as the Processing and OpenFramework environments.

==Themen==
* Processing
* OpenFrameworks
* Object-oriented programming
* Arduino
* Overview and usage of libraries
* Reading and controlling of common sensors and actuators
* APIs and protocols like JSON / XML / OSC

==Voraussetzungen==
* Programmier- und Elektronikkenntnisse sind wünschenswert, jedoch nicht zwingend notwendig.
* Bitte wenn möglich einen eigenen Computer mitbringen.

==Anmeldung==
Die Bewerbung für eine Teilnahme am Kurs muss bis zum 10.10.2011 per E-Mail mit dem Betreff: ''Bewerbung {{PAGENAME}}'' und folgenden Angaben an: hello (at) fregment.com gesendet werden.
* Name
* Fachrichtung und Fachsemester
* Matrikelnummer
* Angabe der geltenden Prüfungsordnung
* Gültige E-Mail-Adresse @uni-weimar.de (zur Bestätigung der Anmeldung) [[SCC-Services#E-Mail|Warum?]]
Sollte es mehr als 15 Bewerber geben, entscheidet das Motivationsschreiben, die Zugehörigkeit zur Fakultät/des Studiengangs und ggf. die Reihenfolge der Anmeldungen über die Aufnahme in den Kurs.

==Leistungsnachweis==
Aktive Teilnahme, Dokumentation einer teilweise oder ganz umgesetzen Projektidee im Wiki

==Zielgruppe==
Master-Studenten der Fakultäten Medien, Gestaltung und der Medienarchitektur

==Syllabus==
Termine des Semesters
# tba

==Literatur==

* Toby Segaran & Jeff Hammerbacher: Beautiful Data, O'Reilly, ISBN 978-0596157111
* Tom Igoe: Making Things Talk, O'Reilly & MAKE, ISBN 978-0596510510
* Ben Fry: Visualizing Data, O'Reilly, ISBN 978-0596514556
* Dan O'Sullivan & Tom Igoe: Physical Computing, Premier, ISBN 978-1592003464
* Joshua Noble: Programming Interactivity, O’Reilly, ISBN 978-0596154141
* Casey Reas und Ben Fry: Processing, Mit Press, ISBN 978-0262182621
* Danny Kodicek: Mathematics and Physics for Programmers, Charles River Media, ISBN 978-1584503309

Hinweis: Die hier aufgeführte Literatur ist optional und nicht verbindlich!

==Links==
===Data visualisation===
*[http://infosthetics.com/ information aesthetics blog]
*[http://feltron.com/ Nicholas Feton] // [http://rhizome.org/editorial/2011/jun/1/storytelling-interview-nicholas-felton/ Interview w. Nicholas Felton] // [http://daytum.com/ DAYTUM]
*[http://www.number27.org/wefeelfine.html We Feel Fine] // [http://www.adobe.com/designcenter/thinktank/danzico2.html Telling stories using data: An interview with Jonathan Harris]

===Technology===
*[https://pachube.com pachube.com]
*[[Arduino]]
*[[Processing]]
*[http://www.openframeworks.cc OpenFrameworks]

===Student Links===
====Dianna Mertz====
Interesting projects that utilize data:
*[http://vimeo.com/25781176/ Telepresent Water] // [http://www.dwbowen.com/ David Bown]
*[http://www.stephencartwright.com/ Stephen Cartwright]
Thematic interests:
*Classification of cities, i.e.: [http://world-gazetteer.com/wg.php?men=home&lng=en&des=wg&srt=npan&col=abcdefghinoq&msz=1500&geo=0 World Gazeteer] // [http://www.lboro.ac.uk/gawc/world2008t.html GaWC Classification] // [http://www.lboro.ac.uk/gawc/world2008c.html GaWC Cartogram] // [http://www.lboro.ac.uk/gawc/world2008m.html GaWC Map]
*Book + Information Consumption. For example: [http://www.goodreads.com/ Goodreads]

====Jelena Djokic====
*[http://www.andreasmuxel.com/artresearch/ Andreas Muxel]
*[http://www.brooklynmuseum.org/support/1stfans_twitter_art_feed.php?artist_id=4/ Brooklynmuseum]
*[http://glitchfiction.com/project/not_yet_heard Gunnar Green and Bernhard Hopfengärtner]
*[http://www.daito.ws/work/ Daito Manabe]
*[http://makrolab.ljudmila.org/ Marko Peljhan]

====Julia Putscher====
*[http://timescapers.com/blog/ Timescapers]
*[http://harddisko.ch/dok.htm/ Harddisko] // [http://www.youtube.com/watch?v=apOaClsKQS8/ Harddisko Video]
*[http://www.we-make-money-not-art.com/archives/2011/10/the-noisolation-headphones.php/ Noisolation Headphones]
*[http://vimeo.com/17997743/ Elektronic Dreaming]

====Patawat Phamuad====
* [[/Projects/Patawat_Phamuad|Winme Ticket - funnier public transportation method]]

====Caren-Maria Jörß====

Stephan Thiel - interaction and information designer:

*[http://www.stephanthiel.com/projects/visualliszt.html Visual Liszt: Process Documentation (2011)]
*[http://www.stephanthiel.com/teaching/understandingtexts.html Understanding Texts (2010)]
*[http://www.understanding-shakespeare.com/ Understanding Shakespeare (2010)]

==== [[Sebastian Wolf|Sebastian]] ====

* [[IFD:Zeitmaschinen|Zeitmaschinen/Time Machines]] ([http://infosthetics.com/archives/2011/07/mapnificent_how_far_can_you_travel_via_public_transport_in_a_given_time.html])

* [http://vimeo.com/17260051 White Glove Tracking]
* [http://vimeo.com/13007530 The Sporenspiel]
* [http://cinemetrics.fredericbrodbeck.de/ Cinemetrics]
* [http://www.markuskison.de/index.html#Vanity_Ring Vanity Ring]

====Augusto Gandia====
http://keiichimatsuda.com/augmentedcity.php
http://keiichimatsuda.com/augmented.php
==Mailinglist==
Please subscribe to the list "Datastories" here:
https://mg.medien.uni-weimar.de/mailman/listinfo/datastories

[[Category:WS11]]
[[Category:Physical computing]]
[[Category:Frederic Gmeiner]]
[[Category:Interface Design]]
[[Category:Fachmodul]]