Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Dragon curve
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
{{short description|Fractal constructible with L-systems}} {{redirects|Dragon fractal|the filled Julia sets|Douady rabbit}} {{redirect|Twindragon|other uses|Twin Dragon (disambiguation)}} {{Use dmy dates|date=May 2019|cs1-dates=y}} [[File:Fractal dragon curve.jpg|thumb|Heighway dragon curve]] A '''dragon curve''' is any member of a family of [[Self-similarity|self-similar]] [[fractal curves]], which can be approximated by [[recursion|recursive]] methods such as [[Lindenmayer system]]s. 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.
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)