Talk:L-system: Difference between revisions

 

: There are at least 11 tasks that can (or must) be solved by an L-system, "rounded" variants not counting: (Cantor set, fractal tree, Koch curve, Dragon curve, Sierpiński triangle, Sierpiński carpet, Sierpiński square, Sierpiński curve, Peano curve, Hilbert curve, Penrose tiling), and a several that there are not (yet), i.e. Sphinx, Gosper, Pentaplexity, Lace and of course, model of plants. The idea is the same as writing programs with similar functionallity: The first time you create a single, monolithic solution. The second one you start to identify common code and proceed to separate the generic part of the particular part, in the same file, class or whatever it is. After three o more times you decide to definitivly separate the code and to change the generic part to another file (e.g. helper functions, classes, etc). At the end it becames part of your own private, job or public library. The intened purpose of this task is to contains this "library". [[User:Laurence|Laurence]] ([[User talk:Laurence|talk]]) 22:48, 13 April 2024 (UTC)