Tiling graph generator
From WandoraWiki
(Difference between revisions)
(→Square tiling) |
(→See also) |
||
| (9 intermediate revisions by one user not shown) | |||
| 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 6: | Line 6: | ||
Tiling generator starts with option '''File > Generators > Tiling graph generator...'''. | 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. |
== Square tiling == | == 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. | * four other vertices if vertex is inside the graph. | ||
* three other vertices if vertex is on the edge of the graph. | * three other vertices if vertex is on the edge of the graph. | ||
| Line 25: | Line 25: | ||
== Triangular tiling == | == 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. | * six other nodes if vertex is inside the graph. | ||
* four other nodes if vertex is on the edge of the graph. | * four other nodes if vertex is on the edge of the graph. | ||
| Line 40: | Line 40: | ||
== Hexagonal tiling == | == 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 | + | * three other nodes if the node is inside the graph. |
* two other nodes if the node is on the edge. | * 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. | * one other node if the node is one of the three corners of the graph. | ||
| 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]] or the [[D3 graph service module]]. | ||
| + | * To export the graph: | ||
| + | ** [[GraphML export]] | ||
| + | ** [[Graph Modeling Language export]] | ||
| + | ** [[GraphXML export]] | ||
| + | ** [[Export adjacency matrix]] | ||
| + | ** [[Export incidence matrix]] | ||
| + | * [[Cylinder graph generator]] | ||
| + | * [[Lattice graph generator]] | ||
Latest revision as of 18:27, 3 July 2012
Wandora's tiling graph generator creates simple Topic Maps graphs that resemble regular polygon tilings. Available graph tilings are:
- Square tiling
- Triangular tiling
- Hexagonal tiling
Tiling generator starts with option File > Generators > Tiling graph generator.... Tiling graphs can be used to model chemical structures such as graphite, graphene and carbon nanotubes for example.
Contents |
[edit] Square tiling
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.
- two other vertices if vertex is one of the four corners of the graph.
Gives a graph topic map
[edit] Triangular tiling
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.
- two other nodes if the vertex is one of the three corners of the graph.
gives you a graph
[edit] Hexagonal tiling
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 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.
gives you a graph
[edit] See also
- 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:
- Cylinder graph generator
- Lattice graph generator
