General repository updates

Author: Carla-de-Beer

Animated_Circle_Grid/Animated_Circle_Grid.pde

@@ -1,5 +1,5 @@
 // Carla de Beer
-// Created November 2010; updated January 2014.
+// Created: November 2010; updated: January 2014.
 // Animated circle grid.
 
 Circle [][] grid;
@@ -23,7 +23,7 @@ void setup() {
 }
 
 void draw() { 
-  background(55);
+  background(128);
   pushMatrix();
   translate((width - (SPACING*(COLS-1)))/2, (height - (SPACING*(ROWS-1)))/2);
   for (int i = 0; i < COLS; ++i) {

Animated_Circle_Grid/README.md

@@ -1,6 +1,8 @@
-Animated Circle Grid
-====================
+# Animated Circle Grid
 
+Animating a set of circles within a fixed grid pattern. This sketch was one of my first Processing projects.
+
+</br>
 <p align="center">
   <img src="gif/animated circle grid.gif"/>
 </p>

Animated_Circle_Grid/gif/screenShot.png

@@ -1,5 +1,5 @@
 // Carla de Beer
-// January 2014
+// Created: January 2014.
 // An animated NURBS surface imbued with movement through the addition of a particle spring system. 
 // NURBS algorithm based on that of Alasdair Turner's: http://www.openprocessing.org/sketch/8101
 

Animated_Circle_Grid/screen-0056.tif

@@ -1,6 +1,6 @@
 // Carla de Beer
-// January 2015
-// 1D Cellular Automata played out on a 2D lozenge-shaped grid
+// Created: January 2015.
+// 1D Cellular Automata played out on a 2D lozenge-shaped grid.
 
 // Rule set
 // Modify the input values here:
@@ -32,7 +32,6 @@ void draw() {
   pushMatrix();
   translate(0, width/n *sin(radians(60)));
 
-
   // Modify the input values here:
   for (int i = 0; i < num; ++i) {
     for (int j = 0; j < jVal; ++j) {

Animated_Circle_Grid/screen-0274.tif

@@ -1,15 +1,14 @@
 class Cell {
-
   float x, y;
   float w;
   float xoff;
   float yoff;
   boolean value;
 
-  Cell(float x_, float y_, float w_) {
-    x = x_;
-    y = y_;
-    w = w_;
+  Cell(float x, float y, float w) {
+    this.x = x;
+    this.y = y;
+    this.w = w;
 
     xoff = cos(radians(60))*w;
     yoff = sin(radians(60))*w;
@@ -32,5 +31,4 @@ class Cell {
     endShape();
     popMatrix();
   }
-}
-
+}

Animated_Circle_Grid/screen-0394.tif

@@ -6,10 +6,10 @@ class Circle {
   int originalxpos;
   int originalypos;
 
-  Circle (int _xpos, int _ypos, int _rad) { 
-    xpos = _xpos;
-    ypos = _ypos;
-    rad = _rad;
+  Circle (int xpos, int ypos, int rad) { 
+    this.xpos = xpos;
+    this.ypos = ypos;
+    this.rad = rad;
     originalxpos = xpos;
     originalypos = ypos;
     sp = 1;

Animated_NURBS_Surface/Animated_NURBS_Surface.pde

@@ -1,5 +1,5 @@
 // Carla de Beer
-// November 2010
+// Created: November 2010.
 
 final int RADIUS = 20;
 

CA_1D/CA_1D.pde

@@ -1,9 +1,10 @@
+// Carla de Beer
+// Created: January 2017.
 // Pointillated image creation with circle packing algorithm.
 // Based on Daniel Shiffman's Coding Train video series on animated circle packing:
 // https://www.youtube.com/watch?v=QHEQuoIKgNE
 // Image: Scheveningen Museum Beelden aan Zee
-// https://freewallpaperspictures.com/tag/images-photos/
-// Created: January 2017
+// https://freewallpaperspictures.com/tag/images-photos
 
 import java.util.*;
 import java.text.*;

CA_1D/Cell.pde

@@ -1,5 +1,5 @@
 // Carla de Beer
-// February 2018
+// Created: February 2018.
 // Four double pendula with various settings.
 // Based on Daniel Shiffman's Coding Train coding challenge:
 // https://www.youtube.com/watch?v=uWzPe_S-RVE

Circle_Grid_With_Mouse_Repel/Circle.pde

@@ -1,9 +1,4 @@
-// The Nature of Code
-// Daniel Shiffman
-// http://natureofcode.com
-
 class Cell {
-
   float x, y, z, h;
   float w;
   float check = 0.5;
@@ -12,10 +7,10 @@ class Cell {
   int previous;
   int cap;
 
-  Cell(float x_, float y_, float w_) {
-    x = x_;
-    y = y_;
-    w = w_;
+  Cell(float x, float y, float w) {
+    this.x = x;
+    this.y = y;
+    this.w = w;
     z = 0;
     h = 20;
     cap = 60;
@@ -70,7 +65,7 @@ class Cell {
         z = -20;
       }
     } else fill((1.8*h)%255);
-    
+
     stroke(10);
     strokeWeight(0.5);
     pushMatrix();

Circle_Grid_With_Mouse_Repel/Circle_Grid_With_Mouse_Repel.pde

@@ -1,9 +1,4 @@
-// The Nature of Code
-// Daniel Shiffman
-// http://natureofcode.com
-
 class GOL {
-
   int w = 10;
   int columns, rows;
   boolean colorOn = true;
@@ -73,5 +68,4 @@ class GOL {
       }
     }
   }
-}
-
+}

Circle_Packing_Image/Circle_Packing_Image.pde

@@ -1,19 +1,15 @@
 // Carla de Beer
-// January 2014
-// 3D Implementation of John Conway's Game of Life CA,
-// based on Daniel Shiffman's Nature of Code 2D CA example
-
-// The Nature of Code
-// Daniel Shiffman
+// Created: January 2014.
+// 3D Implementation of John Conway's Game of Life CA.
+// Based on Daniel Shiffman's 2D CA example in "The Nature of Code":
 // http://natureofcode.com
 
-PVector eye;
-PVector center;
-PVector up;
-
 import processing.opengl.*;
 
 GOL gol;
+PVector eye;
+PVector center;
+PVector up;
 
 boolean noPause = true;
 import processing.dxf.*;

DoublePendulum/DoublePendulum.pde

@@ -1,13 +1,4 @@
-// Hexagonal implementation of Daniel Shiffman's 2D CA
-
-// The Nature of Code
-// Daniel Shiffman
-// http://natureofcode.com
-
-// A basic implementation of John Conway's Game of Life CA
-
 class Cell {
-
   float x, y;
   float w;
   float xoff;
@@ -16,10 +7,10 @@ class Cell {
   int state;
   int previous;
 
-  Cell(float x_, float y_, float w_) {
-    x = x_;
-    y = y_;
-    w = w_;
+  Cell(float x, float y, float w) {
+    this.x = x;
+    this.y = y;
+    this.w = w;
 
     xoff = w/2;
     yoff = sin(radians(60))*w;

GOL_3D/Cell.pde

@@ -1,13 +1,4 @@
-// Hexagonal implementation of Daniel Shiffman's 2D CA
-
-// The Nature of Code
-// Daniel Shiffman
-// http://natureofcode.com
-
-// A basic implementation of John Conway's Game of Life CA
-
 class GOL {
-
   float w = 10;
   float h = sin(radians(60))*w;
   int columns, rows;
@@ -81,5 +72,4 @@ class GOL {
       }
     }
   }
-}
-
+}

GOL_3D/GOL.pde

@@ -1,13 +1,9 @@
 // Carla de Beer
-// January 2014
-// Hexagonal implementation of Daniel Shiffman's 2D CA
-
-// The Nature of Code
-// Daniel Shiffman
+// Created: January 2014.
+// A basic implementation of John Conway's Game of Life CA on a hexagonal grid.
+// Based on Daniel Shiffman's 2D CA implementation in "The Nature of Code":
 // http://natureofcode.com
 
-// A basic implementation of John Conway's Game of Life CA
-
 GOL gol;
 
 void setup() {

GOL_3D/GOL_3D.pde

@@ -1,8 +1,9 @@
+// Carla de Beer
+// Created: January 2018.
 // Floyd-Steinberg dithering.
 // A dithering technique using error diffusion, meaning it pushes (adds) the residual quantisation error of a pixel onto its neighbouring pixels, to be dealt with later.
 // Based on Daniel Shiffman's Coding Train video:
 // https://www.youtube.com/watch?v=0L2n8Tg2FwI
-// Created: January 2018
 
 PImage img;
 static int FACTOR = 2;

GOL_HexPattern/Cell.pde

@@ -1,10 +1,10 @@
+// Carla de Beer
+// Created: January 2018.
 // Images with a dot screen.
 // A simple form of resolution reduction by increasing the effective pixel size.
 // The size of each dot relates to the brightness level of the corresponding image spot.
-// Created: January 2018
 
 PImage img;
-
 static int DIVISON = 6;
 
 void setup() {

GOL_HexPattern/GOL.pde

@@ -1,8 +1,8 @@
-// December 2017 //<>//
+// Carla de Beer //<>//
+// Created: December 2017.
 // Image segmentation using the k-nearest neighbour algorithm.
 // Algorithm adapted from: https://en.wikipedia.org/wiki/Image_segmentation.
 // Press 'R' or 'r' to restart the sketch. A single mouse press halts the centroid recalculation.
-// Carla de Beer
 
 import processing.core.PFont;
 import java.util.*;

GOL_HexPattern/GOL_HexPattern.pde

@@ -1,6 +1,7 @@
+// Carla de Beer
+// Created: January 2018.
 // Image thresholding.
 // Algorithm adapted from: https://en.wikipedia.org/wiki/Thresholding_(image_processing)
-// Created: January 2018
 
 PImage img;
 

Image Processing/FloydSteinbergDithering/FloydSteinbergDithering.pde

@@ -1,7 +1,7 @@
-// December 2017 //<>//
+// Carla de Beer //<>//
+// Created: December 2017.
 // Using the k-nearest neighbour algorithm to break an image up into Voronoi colour fields.
 // Press 'R' or 'r' to restart the sketch. 
-// Carla de Beer
 
 import processing.core.PFont;
 import processing.data.FloatList;

Image Processing/ImageDotScreen/ImageDotScreen.pde

@@ -1,5 +1,4 @@
 class City {
-
   private float lon, lat;
   private String name;
 

Image Processing/ImageSegmentationKNN/ImageSegmentationKNN.pde

@@ -1,5 +1,5 @@
 // Carla de Beer
-// November 2016; updated October 2017
+// Created: November 2016; updated October 2017.
 // Minimum Spanning Tree (Prim's Algorithm) connecting the 50 largest cities in the US.
 
 // Based on Daniel Shiffman's Minimum Spanning Tree solution from the Coding Train coding challenges series:

Image Processing/ImageThresholding/ImageThresholding.pde

@@ -3,8 +3,8 @@ class Curve {
   float theta;
   PVector vecPos;
 
-  Curve(PVector _vecPos) {
-    vecPos = _vecPos;
+  Curve(PVector vecPos) {
+    this.vecPos = vecPos;
     theta = 0.0;
   }
 

Image Processing/ImageVoronoi/ImageVoronoi.pde

@@ -1,8 +1,7 @@
 // Carla de Beer
-// January 2015
-// Parametric curve sketches on a 4 x 4 grid
+// Created: January 2015.
+// Parametric curve sketches on a 4 x 4 grid.
 
-public static final int STOP = 90;
 Curve [][] curves;
 int rows = 4; 
 int cols = 4;

Minimum_Spanning_Tree_Cities/City.pde

@@ -1,11 +1,11 @@
 // Carla de Beer
-// Created: January 2014
-// Updated: March 2018
-// Lissajous and parametric curve equations that generate geometric patterns.
+// Created: January 2014; updated: March 2018.
+// Parametric and Lissajous curve equations.
 // Inspiration taken from: "Chapter 10: Paramteric Equations and Polar Coordinates" in: 
 // STEWART, J., 2012. "Calculus Early Transcendentals". 7th Edition, p636 - 641.
 
-// Run the bash script executable from the terminal with the command `./runSketch <num>` where <num> in an integer value between 1 and 15.
+// Run the bash script executable from the terminal with the command `./runSketch <num>`
+// where <num> in an integer value between 1 and 15.
 
 int choice;
 float r = 165.0;
@@ -98,12 +98,12 @@ PVector getCoordinates(int choice) {
     y = 1.5*r*sin(10*theta);
     break;
   case 6:
-    // 6. Parametric curve equation (heart)
+    // 6. Parametric curve equation
     x = 1.5*r*pow(cos(5*theta*PI), 3);
     y = 1.5*r*pow(sin(4*theta*PI), 3);
     break;
   case 7:
-    // 7. Parametric curve equation
+    // 7. Parametric curve equation  (heart)
     x = 60*5*pow(sin(theta), 3);
     y = 60*(4*cos(theta) - 1.3*cos(2*theta) - 0.6*cos(3*theta) - 0.2*cos(4*theta)) + 25;
     break;