
Recent Posts
Recent Comments
Antialiasing for im… on Smoothing images Peter Stampfli on Elliptic kaleidoscopes Val Altounian on dualization method for the Sta… zenorogue on Straight lines in elliptic and… Peter Stampfli on Curves Archives
 September 2018
 August 2018
 March 2018
 February 2018
 January 2018
 December 2017
 November 2017
 September 2017
 August 2017
 July 2017
 June 2017
 May 2017
 February 2017
 January 2017
 November 2016
 February 2014
 January 2014
 December 2013
 November 2013
 October 2013
 September 2013
 August 2013
 May 2013
 April 2013
 March 2013
 February 2013
 January 2013
 December 2012
 November 2012
 October 2012
 September 2012
 August 2012
 July 2012
 June 2012
 May 2012
 April 2012
Categories
Meta
Monthly Archives: September 2013
breaking the 10fold rotational symmetry
We modify the “Projection method for 10fold rotational symmetry“. For details see “Projection method – geometry and maths“. To destroy the symmetry we shift the sets of lines alternatingly away or towards the origin. Until now we set the position … Continue reading
12fold rotational symmetry from projection
I use the “Projection method for 10fold rotational symmetry” with 6 instead of 5 sets of parallel lines, setting “numDirections=6;” in “projection method with polygons – the code“. Then, the program searches for 12pointed stars and gives a quasiperiodic design … Continue reading
overlapping polygons – the code
// You need this code to draw overlapping polygons, such as in // the last post “overlapping polygons”. // It first finds at each point for pairs of lines or connections // with the correct angle between. // Then, as … Continue reading
Overlapping polygons
Looking at the dotpattern we got in “Projection method for 10fold rotational symmetry” we could see rhombs instead of the regular polygons shown in “finding polygons“. These rhombs are overlapping and we need a modified code to get them. To … Continue reading
Projection method with polygons – the code
// ********* use processing 2 **************** you can download from processing.org //———————————————————————————— // this is the main code to generate quasiperiodic designs // similar to the one shown in “Finding polygons” // put this code in the main tab of … Continue reading
Posted in programming, Quasiperiodic design
Tagged processing, programming, Quasiperiodic design
Leave a comment
Class Stripes – the code
// a class for working with stripes/sets of parallel lines // lines defined ba ax+by=shift+k; where k is integer // this makes sets of parallel lines as // used in “projection methodgeometry and maths” // see the post “How to … Continue reading
Finding polygons – the code
// kind of extensions to classes TPoint and Tiling // show points without polygons //———————————————————————————– void tilingShowPointsWithoutPolygons(){ for (int i=0;i<tiling.points.length;i++){ if (tiling.points[i].connections.length<2) tiling.points[i].vec.show(); } } // show regular polygons //———————————————————————————– void tilingShowRegularPolygons(int numberCorners){ // regular polygons … Continue reading
Posted in programming, Quasiperiodic design
Tagged Geometry, processing, programming
Leave a comment