Dragon curve
Fractal constructible with L-systems / From Wikipedia, the free encyclopedia
Dear Wikiwand AI, let's keep it short by simply answering these key questions:
Can you list the top facts and stats about Dragon curve?
Summarize this article for a 10 year old
SHOW ALL QUESTIONS
"Dragon fractal" redirects here. For the filled Julia sets, see Douady rabbit.
"Twindragon" redirects here. For other uses, see Twin Dragon (disambiguation).
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. The dragon curve is probably most commonly thought of as the shape that is generated from repeatedly folding a strip of paper in half, although there are other curves that are called dragon curves that are generated differently.