page_title: T-square (fractal)
section_title: Algorithmic description
hierarchical_section_title: T-square (fractal) / Algorithmic description
context_page_description: In mathematics, the T-square is a two-dimensional fractal. It has a boundary of infinite length bounding a finite area. Its name comes from the drawing instrument known as a T-square.
context_section_description: It can be generated from using this algorithm:
  Image 1:
  Start with a square. (The black square in the image)
  Image 2:
  At each convex corner of the previous image, place another square, centered at that corner, with half the side length of the square from the previous image.
  Take the union of the previous image with the collection of smaller squares placed in this way.
  Images 3–6:
  Repeat step 2.
  The method of creation is rather similar to the ones used to create a Koch snowflake or a Sierpinski triangle, "both based on recursively drawing equilateral triangles and the Sierpinski carpet."
caption: Golden squares with T-branching