Tiling graph generator
From WandoraWiki
(Difference between revisions)
(→Triangular tiling) |
(→Square tiling) |
||
| Line 9: | Line 9: | ||
== Square tiling == | == Square tiling == | ||
| − | Square tiling is a graph where | + | 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. | |
| − | + | ||
[[Image:square_tiling_dialog.gif|center]] | [[Image:square_tiling_dialog.gif|center]] | ||
| + | |||
Gives a graph topic map | Gives a graph topic map | ||
Revision as of 18:23, 26 October 2008
Wandora's tiling graph generator creates simple 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....
Square tiling
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
To create other graph forms than rectangles, create first large rectangular graph, select nodes in Wandora's graph view and remove selected topics. The idea is to cut away useless topics.
Triangular tiling
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
Hexagonal tiling
