Uni-color-2D graphics can't be spectaculair, let alone breathtaking. Unless you are in the know. Let me explain. I am now able to - almost - print tilings automatically from just a string of numbers as I wrote about in a previous post.
Not spectaculair at all, it's just a collection of 8 tilings containing 72 polygons in total. But if I change ( 4,2 ) by (10,5) and add a colorfunction the program creates immediately the following graphic.
Both are, in fact, representations of the same sequence.{6, 2, 4, 3, 3, 2, 4, 2, 3, 2, 3, 3, 4, 4, 3, 3, 4} but the variations from this sequence alone are endless. The program creates a graphic for every sequence input. Not all graphics will be tilings of the plane by definition. The following ( major ) step is to let the program reject sequences that do not lead to tilings of the plane.
Tne next part will include an implentation of a 'Point in Polygon' predicate. Many of those exist and have been implemented for many languages. That could be a topic for a more in-depth post next time.
No comments:
Post a Comment