Recent changes to L-system

L-system modified by erana256

erana256 — Thu, 09 Jan 2014 15:51:50 -0000

--- v22
+++ v23
@@ -28,7 +28,7 @@
 Binary override :
 -----------------

-With the substitution of the above XX and YY classes, the first linked in your binary is executed in real-time on your box. This means your linker overrides with the first symbols found. If you use eg. gcc or ld with -L. -lc -lm libraries, lm is parsed first in the binary and thus the executed real-time code.
+With the substitution of the above XX and YY classes, the first linked in your binary is executed in real-time on your box. This means your linker overrides with the first symbols found. If you use eg. gcc or ld with -L. -lc -lm libraries, lm is parsed first in the binary and thus the first executed real-time code.

 The Parser:
 -----------

L-system modified by erana256

erana256 — Thu, 09 Jan 2014 15:50:35 -0000

--- v21
+++ v22
@@ -25,6 +25,11 @@

 . You can make a superclass for XX or YY with template parameters to provide for a functor (lindemayer_axiom subclass of lindemayer_system class) which occurs in the chaotic process to run an L-system. The transform() method iterates over the axioms (axioms might need to be re-sorted while running.) The lindemayer_leaf.* files describe a simple axiomatic system by running on a vector of axioms called _axioms.

+Binary override :
+-----------------
+
+With the substitution of the above XX and YY classes, the first linked in your binary is executed in real-time on your box. This means your linker overrides with the first symbols found. If you use eg. gcc or ld with -L. -lc -lm libraries, lm is parsed first in the binary and thus the executed real-time code.
+
 The Parser:
 -----------

L-system modified by erana256

erana256 — Mon, 23 Dec 2013 21:00:53 -0000

--- v20
+++ v21
@@ -32,3 +32,8 @@
 can be patternised and give more or less entropy.

 Local maxima/minima can be seen as tree branches where e.g. the longest ot highest reaching branch is the global maximum/minimum (cfr. neural network theory.)
+
+Plant technology:
+-----------------
+
+See http://algorithmicbotany.org/papers/abop/abop.pdf for a book about L-systems in nature.

L-system modified by erana256

erana256 — Mon, 23 Dec 2013 14:41:58 -0000

--- v19
+++ v20
@@ -30,3 +30,5 @@

 There's an orphan fork process list which can be called to make a parser parse. The thing is that the L-system provides for a super system which can strengthen the compile time features of a parser. The L-system can be combined with other AI or Complex systems so it can learn instead of just iterate. Note that an L-system can attract such as the Lorentz attractor that display a sink and source (deque push_front and deque push_back) and that the numbers generated (e.g. from a string to integer/float, such as the libc atof and atoi functions) 
 can be patternised and give more or less entropy.
+
+Local maxima/minima can be seen as tree branches where e.g. the longest ot highest reaching branch is the global maximum/minimum (cfr. neural network theory.)

L-system modified by erana256

erana256 — Mon, 23 Dec 2013 14:39:53 -0000

--- v18
+++ v19
@@ -24,3 +24,9 @@
 . override the lindemayer_util.h classes to make a transform() method in the lindemayer_*.* for using an approach to parsing, e.g. AI or Adaptive systems.

 . You can make a superclass for XX or YY with template parameters to provide for a functor (lindemayer_axiom subclass of lindemayer_system class) which occurs in the chaotic process to run an L-system. The transform() method iterates over the axioms (axioms might need to be re-sorted while running.) The lindemayer_leaf.* files describe a simple axiomatic system by running on a vector of axioms called _axioms.
+
+The Parser:
+-----------
+
+There's an orphan fork process list which can be called to make a parser parse. The thing is that the L-system provides for a super system which can strengthen the compile time features of a parser. The L-system can be combined with other AI or Complex systems so it can learn instead of just iterate. Note that an L-system can attract such as the Lorentz attractor that display a sink and source (deque push_front and deque push_back) and that the numbers generated (e.g. from a string to integer/float, such as the libc atof and atoi functions) 
+can be patternised and give more or less entropy.

L-system modified by erana256

erana256 — Mon, 23 Dec 2013 14:31:59 -0000

--- v17
+++ v18
@@ -16,7 +16,7 @@
 The L-system such as the leaf can be made with the lindemayer_stack and/or deque to functionally operate on e,g, a visual (such as cairo or SDL.)
 With a Turtle Graphics package we can draw trees such as in the pictures above, turtle graphics are a 2D Visual solution to drawing L-systems. Note that 3D can be drawn using randomised axioms which draw a leaf or tree that has small deviations of the plant's structure. The bend is just another (random) axiom, thus we can also picture gnarly trees.
 A gnarly tree is called a fractal, here's a list of systems that are fractals :
-http://en.wikipedia.org/wiki/List_of_fractals_by_Hausdorff_dimension
+https://en.wikipedia.org/wiki/List_of_fractals_by_Hausdorff_dimension

 Again, how we can do L-systems:

L-system modified by erana256

erana256 — Mon, 23 Dec 2013 14:31:33 -0000

--- v16
+++ v17
@@ -15,6 +15,9 @@

 The L-system such as the leaf can be made with the lindemayer_stack and/or deque to functionally operate on e,g, a visual (such as cairo or SDL.)
 With a Turtle Graphics package we can draw trees such as in the pictures above, turtle graphics are a 2D Visual solution to drawing L-systems. Note that 3D can be drawn using randomised axioms which draw a leaf or tree that has small deviations of the plant's structure. The bend is just another (random) axiom, thus we can also picture gnarly trees.
+A gnarly tree is called a fractal, here's a list of systems that are fractals :
+http://en.wikipedia.org/wiki/List_of_fractals_by_Hausdorff_dimension
+

 Again, how we can do L-systems:
 -------------------------------

L-system modified by erana256

erana256 — Mon, 23 Dec 2013 14:22:07 -0000

--- v15
+++ v16
@@ -20,4 +20,4 @@
 -------------------------------
 . override the lindemayer_util.h classes to make a transform() method in the lindemayer_*.* for using an approach to parsing, e.g. AI or Adaptive systems.

-. You can make a superclass for XX or YY with template parameters to provide for a functor (axiom subclass of lindemayer_system class) which occurs in the chaotic process to run an L-system. The transform() method iterates over the axioms (axioms might need to be re-sorted while running.) The lindemayer_leaf.* files describe a simple axiomatic system by running on a vector of axioms called _axioms.
+. You can make a superclass for XX or YY with template parameters to provide for a functor (lindemayer_axiom subclass of lindemayer_system class) which occurs in the chaotic process to run an L-system. The transform() method iterates over the axioms (axioms might need to be re-sorted while running.) The lindemayer_leaf.* files describe a simple axiomatic system by running on a vector of axioms called _axioms.

L-system modified by erana256

erana256 — Mon, 23 Dec 2013 14:20:58 -0000

--- v14
+++ v15
@@ -20,5 +20,4 @@
 -------------------------------
 . override the lindemayer_util.h classes to make a transform() method in the lindemayer_*.* for using an approach to parsing, e.g. AI or Adaptive systems.

-. You can make a superclass for XX or YY with template parameters to provide for a functor (axiom subclass of lindemayer_system class) which occurs in the chaotic process to run an 
-L-system. The transform() method iterates over the axioms (axioms might need to be re-sorted while running.)
+. You can make a superclass for XX or YY with template parameters to provide for a functor (axiom subclass of lindemayer_system class) which occurs in the chaotic process to run an L-system. The transform() method iterates over the axioms (axioms might need to be re-sorted while running.) The lindemayer_leaf.* files describe a simple axiomatic system by running on a vector of axioms called _axioms.

L-system modified by erana256

erana256 — Mon, 23 Dec 2013 14:18:33 -0000

--- v13
+++ v14
@@ -10,16 +10,15 @@
 How we can do L-systems:
 ------------------------

-The deque inside the lindemayer_system.* files can be used for eg a bubble sort algorithm which propagates by sorting numbers or strings. If you use the numbers of a semi-sorted list of numbers you can allaborate on fitness for each energy of the numbers (energy of a matrix.)
-By using a GA (genetic algorithm) this is clear.
+The deque inside the lindemayer_system.* files can be used for eg a bubble sort algorithm which propagates by sorting numbers or strings. If you use the numbers of a semi-sorted list of numbers you can elaborate on fitness for each energy of the numbers (energy of a matrix.)
+By using a GA (genetic algorithm) this is also correct.

-The L-system such as the leaf can be made with the lindemayer_stack and deque to functionally operate on e,g, a visual (such as cairo or SDL.)
+The L-system such as the leaf can be made with the lindemayer_stack and/or deque to functionally operate on e,g, a visual (such as cairo or SDL.)
+With a Turtle Graphics package we can draw trees such as in the pictures above, turtle graphics are a 2D Visual solution to drawing L-systems. Note that 3D can be drawn using randomised axioms which draw a leaf or tree that has small deviations of the plant's structure. The bend is just another (random) axiom, thus we can also picture gnarly trees.

 Again, how we can do L-systems:
 -------------------------------
-. override the lindemayer_util.h classes to make a transform() method in the lindemayer_*.* for using an approach to parsing, e.g. AI or Adaptive systems
+. override the lindemayer_util.h classes to make a transform() method in the lindemayer_*.* for using an approach to parsing, e.g. AI or Adaptive systems.

 . You can make a superclass for XX or YY with template parameters to provide for a functor (axiom subclass of lindemayer_system class) which occurs in the chaotic process to run an 
-L-system.
-
-. With a Turtle Graphics package we can draw trees such as in the pictures above, turtle graphics are a 2D Visual solution to drawing L-systems. Note that 3D can be drawn using randomised axioms which draw a leaf or tree that has small deviations of the plant's structure. The bend is just another (random) axiom, thus we can also picture gnarly trees.
+L-system. The transform() method iterates over the axioms (axioms might need to be re-sorted while running.)