L-system generator - Revision history

Akivela: /* Additional notes */

2013-09-16T18:47:15Z

‎Additional notes

Akivela: /* Examples */

2013-09-16T18:40:23Z

‎Examples

Akivela at 18:32, 16 September 2013

2013-09-16T18:32:41Z

Akivela: /* Examples */

2013-04-27T18:58:12Z

‎Examples

Akivela: /* Examples */

2013-04-27T18:54:51Z

‎Examples

Akivela at 09:07, 16 November 2012

2012-11-16T09:07:43Z

Akivela at 09:06, 16 November 2012

2012-11-16T09:06:51Z

Akivela at 09:01, 16 November 2012

2012-11-16T09:01:18Z

Akivela at 09:00, 16 November 2012

2012-11-16T09:00:04Z

Akivela at 08:59, 16 November 2012

2012-11-16T08:59:24Z

@@ Line 209: / Line 209: @@
 ** The L-system interpretation allows only binary associations. You can't generate hyperedges -- associations with three players, for example.
 ** The L-system interpretation supports only 23 [A-V] different "static" topics.
-* L-system generator creates numbered topics and numbering starts always from 0. Thus, L-systems generates same topics and associations created during previous round. This feature may confuse user if he/she tries L-system generator many times consequently without resetting Wandora's topic maps. To avoid L-system interference user has to initialize Wandora between L-system generations with '''File > New Project''' option or use separate topic map layers for each L-system.
+* L-system generator creates numbered topics and numbering starts always from 0. Thus, L-systems generates same topics and associations created during previous round. This feature may confuse the user if she tries the L-system generator many times consequently without resetting Wandora's topic maps. To avoid L-system interference the user has to initialize Wandora between L-system generations with '''File > New Project''' option or create new topic map layer for each L-system.
-** User should not see this as a bug but a feature as it allows user to apply several different L-systems consequently to one topic map.
+** The user should not see this as a bug but a feature as it allows the user to apply several different L-systems consequently to one topic map.
-* It was expressed above that used interpretation of L-system does not use any external coordinate system to place nodes and edges of the generated graph. Now, watching nicely rendered graph examples above may suggest something very different. Example graphs look carefully rendered. However, the carefully rendered look was achieved using Wandora's [[Graph topic panel]]. The panel has it's own mechanism to unwrap and clear up complex graphs. Although mechanism results topologically similar graphs, it is very likely that user trying out example L-systems perceives small variations in his/her renderings.
+* It was expressed above that used interpretation of the L-system does not use any external coordinate system to place nodes and edges of the generated graph. Now, watching nicely rendered graph examples above may suggest something very different. Example graphs look carefully rendered. However, the carefully rendered look was achieved using Wandora's [[Graph topic panel]]. The panel has it's own mechanism to unwrap and clear up complex graphs. Although the mechanism results topologically similar graphs, it is very likely that trying out provided example L-systems generates different renderings.

@@ Line 96: / Line 96: @@
 == Examples ==
-Next table illustrates the interpretation of L-system generated strings. Left column presents L-system generated string and right column graph that is created when string is parsed. In this example we are not interested in actual L-systems that generate left column strings. Graph circles represent topics. Number (or letter) in circle is topic's identity. Lines between circles represent associations. Notice that same graph is generated by several different strings. Table doesn't list all strings generating the right column graph.
+Next table illustrates the interpretation of the L-system generated strings. Left column presents the L-system generated string and right column the graph that is created when the string is parsed. In this example we are not interested in the actual L-systems that generate the left column strings. Graph circles represent topics. A number (or letter) in the circle is topic's identity. Lines between the circles represent associations. Notice that same graph can be generated with several different strings. The table doesn't list all possible strings that could generate the right column graph.
 {| border="1" cellpadding="4"

@@ Line 1: / Line 1: @@
-[http://en.wikipedia.org/wiki/L-systems L-systems] are generally known as iterative computational methods used to generate self-similar fractals, usually plants and other biological organisms. Wandora's L-system generator is used to construct [http://en.wikipedia.org/wiki/Graph_%28mathematics%29 graphs] and more specifically [http://en.wikipedia.org/wiki/Topic_maps topic map] graphs. Wandora's L-system generator is divided into two parts: a string generator and a string interpreter. The string generator builds an L-system string using given initiator and rules and the string interpreter builds a graph out of the created L-system string.
+[http://en.wikipedia.org/wiki/L-systems L-systems] are generally known as iterative computational methods used to generate self-similar fractals, usually plants and other biological organisms. Wandora's L-system generator is used to construct [http://en.wikipedia.org/wiki/Graph_%28mathematics%29 graphs] and more specifically [http://en.wikipedia.org/wiki/Topic_maps topic map] graphs. Wandora's L-system generator is divided into two parts: a string generator and a string interpreter. The string generator builds an L-system string using a given initiator and rules and the string interpreter builds a graph out of the created L-system string.
-Wandora's L-system generator starts with menu option '''File > Generate > L-system generator...'''. Option opens a dialog with two tabs: '''L-system''' and '''Parser'''. By default the L-system tab is active. L-system tab is used to enter actual L-system to the string generator. Below is a snapshot of L-system tab view in Wandora. Tab contains also drop-down-selector to select ready-made L-systems. User can also store his/her own L-system by clicking '''new''' button. Wandora stores L-systems to [[Wandora options|options]].
+Wandora's L-system generator starts with a menu option '''File > Generate > L-system generator...'''. The menu option opens a dialog with two tabs: '''L-system''' and '''Parser'''. By default the L-system tab is active. The L-system tab is used to enter actual L-system to the string generator. Below is a snapshot of the L-system tab view. The tab contains also a drop-down-selector to select ready-made L-systems. The user can also store his/her own L-system by clicking a '''new''' button. Wandora stores L-systems to the [[Wandora options|options]].
@@ Line 7: / Line 7: @@
-L-system contains
+An L-system contains
 * An initiator
 * One or more rules
-Initiator is the first line in the L-system. It is usually an alphabet or a set of alphabets. Initiator initializes the L-system string. For example, the screen capture above has an L-system with initiator '''x'''.
+The initiator is first line in the L-system. It is usually an alphabet or a set of alphabets. The initiator initializes the L-system string. For example, the screen capture above has an L-system with initiator '''x'''.
-Remaining lines in L-system are rules for L-system. L-system rules have always two parts: Predecessor and successor. L-system rule is executed whenever L-system generated string contains predecessor. Predecessor is replaced by a successor string during the rule execution. For example, the screen capture L-system above contains a rule where predecessor is '''x''' and successor '''a[xx]'''. Wandora assumes predecessor and successor are separated with '''-->'''.
+Remaining lines in the L-system are rules. The L-system rules have always two parts: a predecessor and a successor. The L-system rule is executed whenever L-system generated string contains the predecessor. The predecessor is replaced by the successor string during the rule execution. For example, the screen capture L-system above contains a rule where the predecessor is '''x''' and the successor '''a[xx]'''. Wandora assumes the predecessor and the successor are separated with '''-->'''.
-L-system execution continues limited time. Each execution step is called an iteration. A text field below the L-system text area contains a number of L-system iterations. As the L-system string may grow very rapidly, we suggest you not to use more than 10 iterations unless you are sure about the outcome of the L-system.
+L-system execution continues limited time. Each execution step is called an iteration. A text field below the L-system text area contains a number representing the L-system iterations. As the L-system string may grow very rapidly, we suggest you not to use more than 10 iterations unless you are sure about the outcome of the L-system.
 Looking at the screen capture above and it's L-system, the initiator string is changed step by step:
@@ Line 29: / Line 29: @@
 As you may notice, the string grows very rapidly.
-L-system itself carries no interpretation of the generated string. Generated strings are semantic free, you could say. This reflects to Wandora's L-system generator feature too. The L-system string generation is separated from the interpretation. The interpretation is handled by a special L-system string parser that reads the generated string and interprets each token in the string. You can also use the parser independently of the L-system string generation by selecting the Parser tab. You can parse hand-made L-system string with the parser, for example.
+L-system itself carries no interpretation of the generated string. The generated strings are semantic free, you could say. This reflects to Wandora's L-system generator feature too. The L-system string generation is separated from the interpretation. The interpretation is handled by a special L-system string parser that reads the generated string and interprets each token in the string. You can also use the parser independently of the L-system string generation by selecting the Parser tab. You can parse the hand-made L-system string with the parser, for example.
 == L-system string interpretation ==
-Typically L-system string is interpreted as turtle commands such as move forward, draw line, and turn left or right. However, such interpretation has an implicit assumption of external environment where you can express ideas of left and right direction. If you think of plain graphs, there is no such external world we could refer. Turtle command "turn left" has no meaning in a plain graph as we have no external coordinate system outside the graph. Thus Wandora interprets the L-system string little different compared to the turtle interpretation. The vocabulary and it's interpretation are explained in the table below.
+Typically the L-system string is interpreted as a set of turtle commands such as move forward, draw line, and turn left or right. However, such interpretation has an implicit assumption of external environment where you can express ideas of left and right direction. If you think of plain graphs, there is no such external world we could refer. Turtle command "turn left" has no meaning in a plain graph as we have no external coordinate system outside the graph. Wandora interprets the L-system string little different compared to the turtle interpretation. The vocabulary and it's interpretation is explained in the table below.
-General principle is that each alphabet in the vocabulary creates a topic i.e. a node in the graph and associates it with some other topics, usually at least the previously created topic. An association is a graph edge in the topic map world. When a topic (excluding named topics) is created, a global variable called topic counter is increased by one. When L-system string parsing starts, topic counter is 0. Topic counter is used to derive topic's identity. Thus, topic is merged with existing topic with the same topic counter number.
+General principle is that each alphabet in the vocabulary creates a topic i.e. a node in the graph and associates it with some other topics, usually at least the previously created topic. An association is a graph edge in the topic map world. When a topic (excluding named topics) is created, a global variable called ''topic counter'' is increased by one. When L-system string parsing starts, the ''topic counter'' is 0. The ''topic counter'' is used to derive topic's identity. Thus, a topic is merged with an existing topic with the same ''topic counter'' number.
-Different parenthesis are used to control branching in the graph. Branching means that at least first topic in the branch is associated to the "body". Branch typically ends (closes) somewhere in the string and graph generation returns to the "body".
+Different parenthesis are used to control graph branching. Branching means that at least the first topic in the branch is associated to the "body". A branch typically ends (closes) somewhere in the string and the graph generation returns to the "body".
-Capital alphabets are used to create named topics. Named topic has strong identity. This means that named topic is always same. Named topics allow you to refer same topic everywhere in the L-system string.
+Capital alphabets are used to create ''named topics''. The ''named topic'' has strong identity. This means that the ''named topic'' is always same. The ''named topics'' allow you to refer same topic everywhere in the L-system string.
-Coloring of associations and topics refers association and topic typing. When we say a topic is colored by '''e''' then topic is typed by a topic derived from alphabet '''e'''. Same applies to associations. When association is colored by '''e''' then the association type topic is derived from alphabet '''e'''.
+Coloring of associations and topics refers association and topic typing. When we say a topic is colored by '''e''' then the topic is typed by a topic derived from alphabet '''e'''. Same applies to associations. When an association is colored by '''e''' then the association type topic is derived from alphabet '''e'''.

@@ Line 96: / Line 96: @@
 == Examples ==
-Next table illustrates the interpretation of L-system generated strings. Left column presents L-system generated string and right column graph that is created when string is parsed. In this example we are not interested in actual L-systems that generate left column strings. Graph circles represent topics. Number (or letter) in circle is topic's identity. Lines between circles represent associations. Notice that different strings may generate identical graph.
+Next table illustrates the interpretation of L-system generated strings. Left column presents L-system generated string and right column graph that is created when string is parsed. In this example we are not interested in actual L-systems that generate left column strings. Graph circles represent topics. Number (or letter) in circle is topic's identity. Lines between circles represent associations. Notice that same graph is generated by several different strings. Table doesn't list all strings generating the right column graph.
 {| border="1" cellpadding="4"

@@ Line 96: / Line 96: @@
 == Examples ==
-Next table illustrates the interpretation of L-system generated strings. Left column presents L-system generated string and right column graph that is created when string is parsed. In this example we are not interested in actual L-systems that generate left column strings. Notice that different strings may generate identical graph. Graph circles represent topics. Number (or letter) in circle is topic's identity. Lines between circles represent associations. Notice there may be several different L-system strings that generate identical graph structures.
+Next table illustrates the interpretation of L-system generated strings. Left column presents L-system generated string and right column graph that is created when string is parsed. In this example we are not interested in actual L-systems that generate left column strings. Graph circles represent topics. Number (or letter) in circle is topic's identity. Lines between circles represent associations. Notice that different strings may generate identical graph.
 {| border="1" cellpadding="4"

← Older revision		Revision as of 09:07, 16 November 2012
Line 1:		Line 1:
	[http://en.wikipedia.org/wiki/L-systems L-systems] are generally known as iterative computational methods used to generate self-similar fractals, usually plants and other biological organisms. Wandora's L-system generator is used to construct [http://en.wikipedia.org/wiki/Graph_%28mathematics%29 graphs] and more specifically [http://en.wikipedia.org/wiki/Topic_maps topic map] graphs. Wandora's L-system generator is divided into two parts: a string generator and a string interpreter. The string generator builds an L-system string using given initiator and rules and the string interpreter builds a graph out of the created L-system string.		[http://en.wikipedia.org/wiki/L-systems L-systems] are generally known as iterative computational methods used to generate self-similar fractals, usually plants and other biological organisms. Wandora's L-system generator is used to construct [http://en.wikipedia.org/wiki/Graph_%28mathematics%29 graphs] and more specifically [http://en.wikipedia.org/wiki/Topic_maps topic map] graphs. Wandora's L-system generator is divided into two parts: a string generator and a string interpreter. The string generator builds an L-system string using given initiator and rules and the string interpreter builds a graph out of the created L-system string.

−	Wandora's L-system generator starts with '''File > Generate > L-system generator...'''. Option opens a dialog with two tabs: '''L-system''' and '''Parser'''. By default the L-system tab is active. L-system tab is used to enter actual L-system to the string generator. Below is a snapshot of L-system tab view in Wandora. Tab contains also drop-down-selector to select ready-made L-systems. User can also store his/her own L-system by clicking '''new''' button. Wandora stores L-systems to [[Wandora options\|options]].	+	Wandora's L-system generator starts with menu option '''File > Generate > L-system generator...'''. Option opens a dialog with two tabs: '''L-system''' and '''Parser'''. By default the L-system tab is active. L-system tab is used to enter actual L-system to the string generator. Below is a snapshot of L-system tab view in Wandora. Tab contains also drop-down-selector to select ready-made L-systems. User can also store his/her own L-system by clicking '''new''' button. Wandora stores L-systems to [[Wandora options\|options]].

← Older revision		Revision as of 09:06, 16 November 2012
Line 1:		Line 1:
	[http://en.wikipedia.org/wiki/L-systems L-systems] are generally known as iterative computational methods used to generate self-similar fractals, usually plants and other biological organisms. Wandora's L-system generator is used to construct [http://en.wikipedia.org/wiki/Graph_%28mathematics%29 graphs] and more specifically [http://en.wikipedia.org/wiki/Topic_maps topic map] graphs. Wandora's L-system generator is divided into two parts: a string generator and a string interpreter. The string generator builds an L-system string using given initiator and rules and the string interpreter builds a graph out of the created L-system string.		[http://en.wikipedia.org/wiki/L-systems L-systems] are generally known as iterative computational methods used to generate self-similar fractals, usually plants and other biological organisms. Wandora's L-system generator is used to construct [http://en.wikipedia.org/wiki/Graph_%28mathematics%29 graphs] and more specifically [http://en.wikipedia.org/wiki/Topic_maps topic map] graphs. Wandora's L-system generator is divided into two parts: a string generator and a string interpreter. The string generator builds an L-system string using given initiator and rules and the string interpreter builds a graph out of the created L-system string.

−	Wandora's L-system generator starts with '''File > Generate > L-system generator...'''. Option opens a dialog with two tabs: '''L-system''' and '''Parser'''. By default the L-system tab is active. L-system tab is used to enter actual L-system to the string generator. Below is a snapshot of L-system tab view in Wandora. Tab contains also drop-down-selector to select ready-made L-systems. User can also store his/her own L-system by clicking '''new''' button. Wandora stores ~~user~~ L-systems to [[Wandora options\|options]].	+	Wandora's L-system generator starts with '''File > Generate > L-system generator...'''. Option opens a dialog with two tabs: '''L-system''' and '''Parser'''. By default the L-system tab is active. L-system tab is used to enter actual L-system to the string generator. Below is a snapshot of L-system tab view in Wandora. Tab contains also drop-down-selector to select ready-made L-systems. User can also store his/her own L-system by clicking '''new''' button. Wandora stores L-systems to [[Wandora options\|options]].

← Older revision		Revision as of 09:01, 16 November 2012
Line 7:		Line 7:


−	L-system contains ~~in Wandora~~	+	L-system contains

	* An initiator		* An initiator

← Older revision		Revision as of 09:00, 16 November 2012
Line 1:		Line 1:
−	[http://en.wikipedia.org/wiki/L-systems L-systems] are generally known as iterative computational methods used to generate self-similar fractals, usually plants and other biological organisms. Wandora's L-system generator is used to construct graphs and more specifically [http://en.wikipedia.org/wiki/Topic_maps topic map] graphs. Wandora's L-system generator is divided into two parts: a string generator and a string interpreter. The string generator builds an L-system string using given initiator and rules and the string interpreter builds a graph out of the created L-system string.	+	[http://en.wikipedia.org/wiki/L-systems L-systems] are generally known as iterative computational methods used to generate self-similar fractals, usually plants and other biological organisms. Wandora's L-system generator is used to construct [http://en.wikipedia.org/wiki/Graph_%28mathematics%29 graphs] and more specifically [http://en.wikipedia.org/wiki/Topic_maps topic map] graphs. Wandora's L-system generator is divided into two parts: a string generator and a string interpreter. The string generator builds an L-system string using given initiator and rules and the string interpreter builds a graph out of the created L-system string.

	Wandora's L-system generator starts with '''File > Generate > L-system generator...'''. Option opens a dialog with two tabs: '''L-system''' and '''Parser'''. By default the L-system tab is active. L-system tab is used to enter actual L-system to the string generator. Below is a snapshot of L-system tab view in Wandora. Tab contains also drop-down-selector to select ready-made L-systems. User can also store his/her own L-system by clicking '''new''' button. Wandora stores user L-systems to [[Wandora options\|options]].		Wandora's L-system generator starts with '''File > Generate > L-system generator...'''. Option opens a dialog with two tabs: '''L-system''' and '''Parser'''. By default the L-system tab is active. L-system tab is used to enter actual L-system to the string generator. Below is a snapshot of L-system tab view in Wandora. Tab contains also drop-down-selector to select ready-made L-systems. User can also store his/her own L-system by clicking '''new''' button. Wandora stores user L-systems to [[Wandora options\|options]].

← Older revision		Revision as of 08:59, 16 November 2012
Line 1:		Line 1:
−	[http://en.wikipedia.org/wiki/L-systems L-systems] are generally known as iterative computational methods used to generate self-similar fractals, usually plants and other biological organisms. Wandora's L-system generator is used to construct topic map graphs. Wandora's L-system generator is divided into two parts: a string generator and a string interpreter. The string generator builds an L-system string using given initiator and rules and the string interpreter builds a graph out of the created L-system string.	+	[http://en.wikipedia.org/wiki/L-systems L-systems] are generally known as iterative computational methods used to generate self-similar fractals, usually plants and other biological organisms. Wandora's L-system generator is used to construct graphs and more specifically [http://en.wikipedia.org/wiki/Topic_maps topic map] graphs. Wandora's L-system generator is divided into two parts: a string generator and a string interpreter. The string generator builds an L-system string using given initiator and rules and the string interpreter builds a graph out of the created L-system string.

	Wandora's L-system generator starts with '''File > Generate > L-system generator...'''. Option opens a dialog with two tabs: '''L-system''' and '''Parser'''. By default the L-system tab is active. L-system tab is used to enter actual L-system to the string generator. Below is a snapshot of L-system tab view in Wandora. Tab contains also drop-down-selector to select ready-made L-systems. User can also store his/her own L-system by clicking '''new''' button. Wandora stores user L-systems to [[Wandora options\|options]].		Wandora's L-system generator starts with '''File > Generate > L-system generator...'''. Option opens a dialog with two tabs: '''L-system''' and '''Parser'''. By default the L-system tab is active. L-system tab is used to enter actual L-system to the string generator. Below is a snapshot of L-system tab view in Wandora. Tab contains also drop-down-selector to select ready-made L-systems. User can also store his/her own L-system by clicking '''new''' button. Wandora stores user L-systems to [[Wandora options\|options]].