A dragon curve is any member of a family of self-similar fractal curves, which can be approximated by recursive methods such as Lindenmayer systems.
-
Updated
Jul 29, 2017 - Java
A dragon curve is any member of a family of self-similar fractal curves, which can be approximated by recursive methods such as Lindenmayer systems.
Add a description, image, and links to the dragon-curve topic page so that developers can more easily learn about it.
To associate your repository with the dragon-curve topic, visit your repo's landing page and select "manage topics."