Dragon curve (nonfiction): Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary |
||
| (3 intermediate revisions by the same user not shown) | |||
| 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> | |||
</gallery> | |||
== Fiction cross-reference == | == Fiction cross-reference == | ||
* [[Dragon curve]] | * [[Dragon curve (drug)]] | ||
== Nonfiction cross-reference == | |||
* [[Fractal (nonfiction)]] | |||
== External links == | == External links == | ||
| Line 14: | Line 19: | ||
[[Category:Nonfiction (nonfiction)]] | [[Category:Nonfiction (nonfiction)]] | ||
[[Category:Curves (nonfiction)]] | |||
[[Category:Dragons (nonfiction)]] | |||
[[Category:Fractals (nonfiction)]] | [[Category:Fractals (nonfiction)]] | ||
[[Category:Mathematics (nonfiction)]] | [[Category:Mathematics (nonfiction)]] | ||
Latest revision as of 07:38, 21 July 2021
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