Comments on: Fractals in 10 minutes no. 3 – The Dragon http://www.algorithm.co.il/blogs/math/fractals-in-10-minutes-no-3-the-dragon/ Algorithms, for the heck of it Tue, 21 Jun 2011 21:07:08 +0000 hourly 1 http://wordpress.org/?v=3.1.3 By: Hacker Wannabe » Blog Archive » Dragonul lui Heghway http://www.algorithm.co.il/blogs/math/fractals-in-10-minutes-no-3-the-dragon/#comment-77 Hacker Wannabe » Blog Archive » Dragonul lui Heghway Sat, 05 Jul 2008 23:05:14 +0000 http://www.algorithm.co.il/blogs/index.php/programming/python/fractals-in-10-minutes-no-3-the-dragon/#comment-77 [...] pe net am găsit și un algoritm descris de Knuth în „Arta programării calculatoarelor”, iar individul al cărui blog îl indic descrie [...] [...] pe net am găsit și un algoritm descris de Knuth în „Arta programării calculatoarelor”, iar individul al cărui blog îl indic descrie [...]

]]> By: lorg http://www.algorithm.co.il/blogs/math/fractals-in-10-minutes-no-3-the-dragon/#comment-76 lorg Thu, 24 Jan 2008 13:50:15 +0000 http://www.algorithm.co.il/blogs/index.php/programming/python/fractals-in-10-minutes-no-3-the-dragon/#comment-76 Well, because of your comment I also looked at the dragon curve page on wikipedia. It seems that: 1. Dragon curves may be produced by lsystems (lstrings). On a side note, a version of the book 'Jurassic Park' had another level of the dragon curve on the openning page of each chapter. It was drawn by using lsystems. I remember that as a kid reading this book, I really liked it (and tried to write a program to draw it). 2. As you said, about folding paper - well, that really makes me very happy to know. I never made this connection between fractals and folding. Excellent! 3. It seems what I actually drew in this post is the twin-dragon, which is also named the Davis-Knuth dragon. It is constructed from two dragon curves. Thanks! Well, because of your comment I also looked at the dragon curve page on wikipedia. It seems that:

1. Dragon curves may be produced by lsystems (lstrings). On a side note, a version of the book ‘Jurassic Park’ had another level of the dragon curve on the openning page of each chapter. It was drawn by using lsystems. I remember that as a kid reading this book, I really liked it (and tried to write a program to draw it).

2. As you said, about folding paper – well, that really makes me very happy to know. I never made this connection between fractals and folding. Excellent!

3. It seems what I actually drew in this post is the twin-dragon, which is also named the Davis-Knuth dragon. It is constructed from two dragon curves.

Thanks!

]]> By: Keymone http://www.algorithm.co.il/blogs/math/fractals-in-10-minutes-no-3-the-dragon/#comment-75 Keymone Thu, 24 Jan 2008 12:28:29 +0000 http://www.algorithm.co.il/blogs/index.php/programming/python/fractals-in-10-minutes-no-3-the-dragon/#comment-75 actually there are Dragon curves - very interesting fractals simplest way to get them is folding a paper string by half few times curious fact is that 4 Dragon curves can completely fill 2d space without any interference i was playing with .NET some time ago and have a sample program which generates Dragon curve for few steps ahead with specific folding direction - but it's horribly slow because i was using strings to represent fractal :) actually there are Dragon curves – very interesting fractals
simplest way to get them is folding a paper string by half few times
curious fact is that 4 Dragon curves can completely fill 2d space without any interference
i was playing with .NET some time ago and have a sample program which generates Dragon curve for few steps ahead with specific folding direction – but it’s horribly slow because i was using strings to represent fractal :)

]]>