Use touch/mouse to drag the control points and to pan/zoom the view.

Choose a recipe:

Max search depth:

Epsilon:

Which solution to plot:

Apply transforms:

1:
2:

The image shows the limit set of a Kleinian group of two Möbius transformations and their inverses.

The lines are drawn by a search tree defined by the choice of which of the four transforms to apply next. The search continues until the maximum depth is reached or the distance between successive points is less than epsilon. When the algorithm fails (if the pattern is degenerate) we show an IFS point cloud for the same limit set.

The yellow boxes show where the current region is transformed to by the two transformations and their inverses.

Source code: https://github.com/timhutton/mobius-transforms