Skip to content

Commit 20c9ac5

Browse files
committed
Better conclusion, links to IFS and L-systems
1 parent 64b30bf commit 20c9ac5

File tree

1 file changed

+11
-4
lines changed

1 file changed

+11
-4
lines changed

README.md

+11-4
Original file line numberDiff line numberDiff line change
@@ -251,10 +251,17 @@ up to you.
251251

252252
## Conclusions & Further work ##
253253

254-
In a broad sense, our tree is the expression of two simple rules: (1) branches grow, and
255-
(2) branches branch. In tuning your tree, you might notice that slight
256-
changes in the rules can produce profound changes in the final result when the rules are
257-
applied recursively. In this regard, you and the sakura are the same.
254+
Our tree is the expression of two simple rules: (1) branches grow, and (2)
255+
branches branch. It's a [fractal](http://en.wikipedia.org/wiki/Fractal)—an
256+
image that contains instances of itself. In tuning your tree, you might notice
257+
that since the rules are applied recursively, slight changes in the rules can
258+
produce profound changes in the final result. In this regard, you and your
259+
sakura are the same.
260+
261+
Our tree represents a recursive structure as a collection of objects.
262+
You might be interested in other ways of representing fractals, such as
263+
[Lindenmayer systems](http://en.wikipedia.org/wiki/L-system) and
264+
[iterated function systems](http://en.wikipedia.org/wiki/Iterated_function_system).
258265

259266
## References ##
260267

0 commit comments

Comments
 (0)