PenroseKiteDart: Library to explore Penrose's Kite and Dart Tilings.

[ Diagrams, bsd3, graphics, library ] [ Propose Tags ]

Library to explore Penrose's Kite and Dart Tilings using Haskell Diagrams. Please see

[Skip to Readme]


Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees


  • No Candidates
Versions [RSS] 1.0.0
Change log
Dependencies base (>=4.7 && <5), containers (>=0.6.7 && <0.8), diagrams-lib (>=1.4.6 && <1.5) [details]
License BSD-3-Clause
Copyright 2021 Chris Reade
Author Chris Reade
Category Graphics
Home page
Bug tracker
Source repo head: git clone
Uploaded by chrisreade at 2024-04-09T09:10:13Z
Distributions NixOS:1.0.0
Downloads 20 total (3 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs available [build log]
Last success reported on 2024-04-09 [all 1 reports]

Readme for PenroseKiteDart-1.0.0

[back to package description]


Author: Chris Reade

March 2021 - 2024

See LICENSE file

Penrose Kites and Darts

Penrose's kite and dart tiles have the property that they can tile the entire plane aperiodicly. There are rules to ensure legal tilings with the kites and darts. Tilings can still get stuck (so cannot be continued to cover the entire plane) - these are called incorrect.

This package is a Haskell library of tools to build, draw and explore finite tilings with kites and darts, making use of the Haskell Diagrams package.

Using the Package

You will need the Haskell Diagrams package to be installed as well as this package (PenroseKiteDart). (See Haskell Diagrams). Once installed, a Main.hs module to produce diagrams should import a chosen backend for Diagrams such as the default (SVG) along with Diagrams.Prelude

module Main (main) where

import Diagrams.Backend.SVG.CmdLine
import Diagrams.Prelude

plus (for Penrose Kite and Dart tilings)

import PKD

and optionally

import TgraphExamples

Then to ouput someExample figure

fig::Diagram B
fig = someExample

main :: IO ()
main = mainWith fig

When the code is executed it will generate an SVG file. (See the Haskell Diagrams package for more details on producing diagrams.)

Tgraphs to Describe Finite Tilings

Tile Graphs (Tgraphs) use a simple planar graph representation for finite patches of tiles. A Tgraph is made from a list of faces with type TileFace each of which is a half-dart or a half-kite. Each TileFace is thus a triangle with three positive Int vertices and a constructor LD (left dart), RD (right dart), LK (left kite), RK (right kite).

For example a fool consists of two kites and a dart (= 4 half kites and 2 half darts):

fool :: Tgraph
fool = makeTgraph [RD (1,2,3),LD (1,3,4)   -- right and left dart
                  ,LK (5,3,2),RK (5,2,7)   -- left and right kite
                  ,RK (5,4,3),LK (5,6,4)   -- right and left kite

The function

makeTgraph :: [TileFace] -> Tgraph

performs checks to make sure the tiling is legal, raising an error if there is a problem. To produce a diagram, we simply draw the Tgraph

foolFigure :: Diagram B
foolFigure = labelled draw fool


Module PKD is the main module which imports and rexports Tgraphs and TileLib. Tgraphs imports and re-exports the contents of the other Tgraph modules, namely Tgraph.Compose, Tgraph.Decompose, Tgraph.Force, Tgraph.Relabelling, Tgraph.Prelude. TileLib contains underlying drawing tools for tiles. Tgraph.Try is imported and re-exported by Tgraph.Prelude - used for results of partial functions. HalfTile is imported and re-exported by Tgraph.Prelude - (with the constructors LD,RD,LK,RK).

Further Information

A more detailed User Guide for the PenroseKiteDart package can be found at