Farn

Polygon Fractal with Iterative Triangle Construction

Geometric Iteration: The Step button shows the process step-by-step. Start runs it quickly.

  • A random starting point is chosen inside the given regular polygon, along with a random vertex and one of its neighbouring vertices.
  • The starting point is connected to these two vertices. Together with the corresponding polygon side, this forms a triangle.
  • The chosen centre point of this triangle has to be computed. The resulting point is the start for the next iteration step, using the same procedure.

This process generates a fractal attractor (Type 1 to Type 4), depending on which triangle centre is used:

  1. Centroid, i.e. the intersection of the medians (default)
  2. Incenter, i.e. the intersection of the angle bisectors
  3. Incenter of the medial triangle of the original triangle
  4. Weighted centroid (similar to Type 1)

Experiments with the Geometry Machine

Try different polygons and test Types 1 to 4. A, B and C are the vertices of the construction triangle. A lies inside the polygon, while B and C are two adjacent vertices of the polygon. With the weighted centroid you can pull the attractor inward (Point A) or outward (Points B and C).

Note: Depending on the chosen polygon and type, some points may lie outside the polygon. Such points are not drawn, but the algorithm continues using them.


Ready to start

Quick-Links

Kurs Chaosspiel

Kurs Plantagen

Wachstum

Math & Art Gallery

AI Gallery

Galerie Cosch

Ulliversum

Flickr Ulli S.

© 2019 Ulrich Schwebinghaus