import megamu.mesh.*;
import java.io.File;

PImage img, qrcode;
ArrayList files = new ArrayList();

void setup() {
  size(1311, 567, P3D);
  stroke(0);
  noStroke();
  smooth();
  
  qrcode = loadImage("_qrcode.png");

  String path = sketchPath + "/data"; 

  File folder = new File(path);
  File[] listOfFiles = folder.listFiles(); 

  
  for (int i = 0; i < listOfFiles.length; i++) 
  {
    if (listOfFiles[i].isFile() && !listOfFiles[i].getName().equals("_qrcode.png")) 
    {
      files.add(listOfFiles[i].getName());
    }
  }
}

void draw() 
{   
  background(0);
  
  int cloudSize = 20;
  
  //Generate point cloud
  float[][] points = new float[cloudSize][2];
  for(int i = 0; i < cloudSize; i++)
  {
    points[i][0] = random(0, width);
    points[i][1] = random(0, height);
  }
  
  Delaunay myDelaunay = new Delaunay( points );
  
  ArrayList tris = getTriangles(myDelaunay, cloudSize);
  int r, g, b;
  do
  {
    r = (int)random(0, 255);
    g = (int)random(0, 255);
    b = (int)random(0, 255);
  } while(r<200 && g<200 && b<200);
  
  for(int j=0; j<tris.size(); j++)
  {
    int[] tri = (int[])tris.get(j);
    int variation = 25;
    img = loadImage((String)files.get(floor(random(files.size()-1))));
    if(img!=null && img.height>0)
    {
      beginShape();
      tint(random(r-variation, r+variation), random(g-variation, g+variation), random(b-variation, b+variation));
      texture(img);
      vertex(points[tri[0]][0], points[tri[0]][1], 0,  map(points[tri[0]][0], 0, width, 0, img.width), map(points[tri[0]][1], 0, width, 0, img.width) );
      vertex(points[tri[1]][0], points[tri[1]][1], 0,  map(points[tri[1]][0], 0, width, 0, img.width), map(points[tri[1]][1], 0, width, 0, img.width));
      vertex(points[tri[2]][0], points[tri[2]][1], 0,  map(points[tri[2]][0], 0, width, 0, img.width), map(points[tri[2]][1], 0, width, 0, img.width));
      endShape();
    }
  }
  
  strokeWeight(7);
  float[][] myEdges = myDelaunay.getEdges();
  stroke(0);
  for(int i=0; i<myEdges.length; i++)
  {
  	float startX = myEdges[i][0];
  	float startY = myEdges[i][1];
  	float endX = myEdges[i][2];
  	float endY = myEdges[i][3];
  	line( startX, startY, endX, endY );
  }
  
  
  tint(255);
  int margin = (height-qrcode.height)/2;
  image(qrcode, width-qrcode.width-margin, margin);
  
  //delay(2000);
  String fname = "card" + Integer.toString(floor(random(10000, 99999))) + ".png";
  save(fname);
}

ArrayList getTriangles(Delaunay del, int size)
{
  ArrayList tris = new ArrayList();
  int p1, p2, p3;
  int connections;
  int found;
  boolean exists;
  //first we get every edge
  //then for each other point, we see if it connects to both points on the edge
  int[][] links = del.getLinks();
  for(int i=0; i<links.length; i++)
  {
    p1 = links[i][0];
    p2 = links[i][1];
    for(p3=0; p3<size; p3++)
    {
      if(p3!=p1 && p3!=p2)
      {
        connections=0;
        for(int j=0; j<links.length; j++)
        {
          if( (links[j][0]==p1 && links[j][1]==p3) || (links[j][0]==p3 && links[j][1]==p1) || (links[j][0]==p2 && links[j][1]==p3) || (links[j][0]==p3 && links[j][1]==p2) )
          {
            connections++;
          }
        }
        if(connections==2)
        {
          //check for existing triangle on the list
          exists = false;
          for(int j=0; j<tris.size(); j++)
          {
            int[] tri = (int[])tris.get(j);
            found=0;
            for(int k=0; k<3; k++)
            {
              if(tri[k]==p1 || tri[k]==p2 || tri[k]==p3)
              {
                found++;
              }
            }
            if(found==3)
            {
              exists = true;
            }
          }
          if(!exists)
          {
            int[] tri = new int[3];
            tri[0] = p1;
            tri[1] = p2;
            tri[2] = p3;
            tris.add(tri);
          }
        }
      }
    }
  }
  return tris;
}