Make a program which can fill a 2D space with "pursuit polygons".
The following picture will help you understand better what I mean.
You can use any convex n-polygon you like
here are some examples
notice that for every polygon you can also use the "anti-clockwise" version of the polygon, which produces interesting results
Can you find a way to divide and fill a given space with pursuit polygons?
The result would look better if this could work with ANY convex polygon and not only the regular polygons that I used...
I am new here, so I'll try some specifications:
You must fill an A4 page ( 2480 Pixels X 3508 Pixels)
You can use only triangles,4-gons and pentagons.(try some of them to have anti-clockwise rotation)
Fewest bytes wins.
Use at least 10 polygons and at most 20
All the polygons must be convex
The borders must be the sides of the polygons.So the polygons must fit perfectly in the given rectangular space.
The algorithm must create RANDOM patterns but you should try to keep the polygons all about the same size and make the polygons as regular as possible.
Sorry for the edits