Dragon curve (nonfiction): Difference between revisions
Jump to navigation
Jump to search
No edit summary |
|||
| Line 1: | Line 1: | ||
A '''dragon curve''' is any member of a family of self-similar [[fractal (nonfiction)]] curves, which can be approximated by recursive methods such as Lindenmayer systems. | A '''dragon curve''' is any member of a family of self-similar [[fractal (nonfiction)]] curves, which can be approximated by recursive methods such as Lindenmayer systems. | ||
== | == In the News == | ||
<gallery mode="traditional"> | |||
</gallery> | |||
== Fiction cross-reference == | == Fiction cross-reference == | ||
| Line 9: | Line 10: | ||
* [[Dragon curve]] | * [[Dragon curve]] | ||
== External links | == Nonfiction cross-reference == | ||
* [[Fractal (nonfiction)]] | |||
External links: | |||
* [https://en.wikipedia.org/wiki/Dragon_curve Dragon curve] @ Wikipedia | * [https://en.wikipedia.org/wiki/Dragon_curve Dragon curve] @ Wikipedia | ||
Revision as of 11:45, 24 June 2016
A dragon curve is any member of a family of self-similar fractal (nonfiction) curves, which can be approximated by recursive methods such as Lindenmayer systems.
In the News
Fiction cross-reference
Nonfiction cross-reference
External links:
- Dragon curve @ Wikipedia