Tiling graph generator - Revision history

Akivela: /* See also */

2012-07-03T15:27:44Z

‎See also

2012-07-03T15:24:14Z

‎See also

2012-05-17T15:25:38Z

2012-04-13T16:05:39Z

2009-11-20T20:33:34Z

2009-01-13T12:26:51Z

‎Hexagonal tiling

2008-10-26T15:44:07Z

2008-10-26T15:43:26Z

2008-10-26T15:38:46Z

2008-10-26T15:37:28Z

@@ Line 57: / Line 57: @@
 == See also ==
-* To visualize the tiling graph, you can try the [[Graph topic panel]] or the [[Processing topic panel]].
+* To visualize the tiling graph, you can try the [[Graph topic panel]] or the [[Processing topic panel]] or the [[D3 graph service module]].
 * To export the graph:
 ** [[GraphML export]]

← Older revision		Revision as of 16:05, 13 April 2012
Line 53:		Line 53:

	[[Image:hexagonal_tiling_example.gif\|center]]		[[Image:hexagonal_tiling_example.gif\|center]]
		+
		+
		+	== See also ==
		+
		+	* To visualize the tiling graph, you can try the [[Graph topic panel]] or the [[Processing topic panel]].
		+	* To export the graph:
		+	** [[GraphML export]]
		+	** [[Graph Modeling Language export]]
		+	** [[GraphXML export]]
		+	** [[Export adjacency matrix]]
		+	** [[Export incidence matrix]]

← Older revision		Revision as of 20:33, 20 November 2009
Line 1:		Line 1:
−	Wandora's tiling graph generator creates simple graphs that resemble regular polygon tilings. Available graph tilings are:	+	Wandora's tiling graph generator creates simple Topic Maps graphs that resemble regular polygon tilings. Available graph tilings are:

	* Square tiling		* Square tiling

@@ Line 41: / Line 41: @@
 Hexagonal tiling generator creates a triangular graph form of given height. Hexagonal tiling is a graph where each node is connected to
-* three other nodes if the node is inside of the graph.
+* three other nodes if the node is inside the graph.
 * two other nodes if the node is on the edge.
 * one other node if the node is one of the three corners of the graph.

@@ Line 7: / Line 7: @@
 Tiling generator starts with option '''File > Generators > Tiling graph generator...'''.
 Tiling graphs can be used to model chemical structures such as [http://en.wikipedia.org/wiki/Graphite graphite], [http://en.wikipedia.org/wiki/Graphene graphene] and [http://en.wikipedia.org/wiki/Carbon_nanotube carbon nanotubes] for example.
 == Square tiling ==

@@ Line 6: / Line 6: @@
 Tiling generator starts with option '''File > Generators > Tiling graph generator...'''.
-Tiling graphs can be used to model chemical structures such as [http://en.wikipedia.org/wiki/Graphite graphite] and [http://en.wikipedia.org/wiki/Carbon_nanotube carbon nanotubes] for example.
+Tiling graphs can be used to model chemical structures such as [http://en.wikipedia.org/wiki/Graphite graphite], [http://en.wikipedia.org/wiki/Graphene graphene] and [http://en.wikipedia.org/wiki/Carbon_nanotube carbon nanotubes] for example.
 To create more complex graph forms you can always cut away needless vertices i.e. remove needless topics in the graph.

@@ Line 7: / Line 7: @@
 Tiling generator starts with option '''File > Generators > Tiling graph generator...'''.
 Tiling graphs can be used to model chemical structures such as [http://en.wikipedia.org/wiki/Graphite graphite] and [http://en.wikipedia.org/wiki/Carbon_nanotube carbon nanotubes] for example.
 == Square tiling ==
-Square tiling is a graph where each vertex is connected to
+Square tiling generator creates a rectangle tiling of given width and height. Square tiling is a graph where each vertex is connected to
 * four other vertices if vertex is inside the graph.
 * three other vertices if vertex is on the edge of the graph.
@@ Line 25: / Line 28: @@
 == Triangular tiling ==
-Triangular tiling is a graph where each vertex is connected to
+Triangular tiling generator creates a triangular graph form of given height. Triangular tiling is a graph where each vertex is connected to
 * six other nodes if vertex is inside the graph.
 * four other nodes if vertex is on the edge of the graph.
@@ Line 40: / Line 43: @@
 == Hexagonal tiling ==
-Hexagonal tiling is a graph where each node is connected to
+Hexagonal tiling generator creates a triangular graph form of given height. Hexagonal tiling is a graph where each node is connected to
 * three other nodes if the node is inside of the graph.
 * two other nodes if the node is on the edge.