1) Find conditions on the triangle t, such that the resulting polygon p(n) is not self intersecting. For example, if t is equilateral then p(n) is not self intersecting for all n.

2) Find the perimeter and area enclosed by a non self-intersecting p(n). Find the limits of these quantities for infinite n.

3) Find the convex hull of p(n) and its limit for infinite n.

4) Replace the initial triangle with an arbitrary convex polygon, formulate and solve the analogous problems.

For another interesting picture, build with rectangles insead of triangles see the file Koch_Snowflake_gen2.html .

Produced with EucliDraw© |