Monthly Archives: November 2013

dualization method for the Stampfli tiling – the code

// ********* use processing 2 **************** you can download from processing.org //———————————————————————————— // this is the main code to generate the Stampfli tiling // it shows you how to use the dualization method, // you can generate other tilings with … Continue reading

Posted in programming, Quasiperiodic design, Tilings | Tagged , , , , | 7 Comments

Dualization method for the Stampfli tiling

I am now showing step by step how to get the Stampfli tiling with the dualization method. In the next post you will find the code, which you could change to make other quasiperiodic tilings. First, we combine two hexagon … Continue reading

Posted in programming, Quasiperiodic design, Tilings | Tagged , , , | Leave a comment

combination of grids – the code

//lines between a1 and b1, a2 and b2 //  intersection: interpolation parameter t=0…1 on line 1 //  t<0 or t>1 means there is no intersection. float intersectionAt(Vector a1,Vector b1,Vector a2,Vector b2){   if ((max(a1.x,b1.x)<min(a2.x,b2.x))||min(a1.x,b1.x)>max(a2.x,b2.x)) return -1;  // check intersection of … Continue reading

Posted in programming | Tagged , , | 1 Comment

Combination of grids

In the earlier post “irregular tilings and their duals” I briefly discussed how a straight line and a hexagonal tiling can be put together to get a new irregular tiling or grid and how its dual looks like. This nicely … Continue reading

Posted in programming | Tagged , | Leave a comment

class Grid – the code

class Grid{   Points gridPoints,dualPoints;   Lines gridLines,dualLines;   Polygons gridPolygons,dualPolygons;   float cosAngle,sinAngle;    // parameters for translation and rotation   Vector shift;     Grid(){     gridPoints=new Points();     dualPoints=new Points();     gridLines=new Lines();     dualLines=new Lines();     gridPolygons=new … Continue reading

Posted in programming | Tagged , , | Leave a comment

class Grid

These objects can contain the points, lines and polygons of a tiling in “gridPoints”, “gridLines” and “gridPolygons” as well as the points, lines and polygons of its dual in “dualPoints”, “dualLines” and “dualPolygons”. Often they contain only points and lines … Continue reading

Posted in programming | Tagged , | Leave a comment

class Polygons – the code

class Polygons{   Polygon[] polygons;     Polygons(){     polygons=new Polygon[0];   }          void addPolygon(Polygon p){     polygons=(Polygon[])(append(polygons,p));   }     void show(){     for (int i=0;i<polygons.length;i++){       polygons[i].show();     }   }   void showRegular(int … Continue reading

Posted in programming | Tagged , , | Leave a comment