- Sierpinski Triangle
- Implementing an object as a JavaFX Group
- Recursion controlled with a depth limit
- Koch Snowflake
- Recursion controlled with a size limit

This chapter shows how to draw two classic fractals: the Sierpinski Triangle and the Koch Snowflake. Both of these have a long history in mathematics and in graphics. They are often used in programming books to show recursion with graphics.

Sierpinski is pronounced *sehr-'pin-ski* (accent on pin).

Koch is pronounced *Kokh*. The "ch" is like the "ch" in the composer Bach.

These Wikipedia articles may be of interest:

Sierpinski Triangle

Koch Snowflake

Names of Mathematicians

How many sides does a triangle have?