Lably
Skip to content

Finite subdivision rule

  • 9 min read
  • 8 chapters

Related on Lably

Through Polygon, Fractal and Tessellation

Definition

A subdivision rule takes a tiling of the plane by polygons and turns it into a new tiling by subdividingeach polygon into smaller polygons. It is finite if there are only finitely many ways that every polygon can subdivide. Each way of subdividing a tile is called a tile type. Each tile type is represented by a label (usually a letter). Every tile type subdivides into smaller tile types. Each edge also gets subdivided according to finitely many edge types. Finite subdivision rules can only subdivide tilings that are made up of polygons labelled by tile types. Such tilings are called subdivision complexes for the subdivision rule. Given any subdivision complex for a subdivision rule, we can subdivide it over and over again to get a sequence of tilings.

For instance, binary subdivision has one tile type and one edge type:

Since the only tile type is a quadrilateral, binary subdivision can only subdivide tilings made up of quadrilaterals. This means that the only subdivision complexes are tilings by quadrilaterals. The tiling can be regular, but doesn't have to be:

Here we start with a complex made of four quadrilaterals and subdivide it twice. All quadrilaterals are type A tiles.

Sign in to keep reading

7 more chapters are free with a Lably account.

More in Geometry