Learn how to generate a hexagonal grid, create walls, connect the hexagonal cells and render the cells in this Processing tutorial, using the Java programming language.

A visual study of the Icosahedron inside an Octahedron - and the remaining tetrahedral modules

The tetrahedral modules:

Buckminster Fuller came up with these modules and called them "S modules" or "S quanta modules".

Here is a helpful summary:

This is the other part I made for my hexagon info booklet: Tiling of the hexagon - the hexagon grid...

For this visualization I also used transparent foil layers.

Learn how to explore a hexagonal grid and find a goal point with greedy best first search in this pathfinding tutorial. You will use Processing and Java to code the greedy best first search pathfinding algorithm and create a graphical demo so you can see it in action.

The greedy best first search algorithm will explore the nodes closest to the goal point first. This means it is capable of finding the goal quickly when exploring less complex maps. However it doesn’t always pick the shortest path, since it will pick the first path it stumbles across.

This icosahedron net is really cool, as it is just like a "string of triangles" you can just roll up to form the icosahedron.

Result:

- - -- ---

The hexagon grid is really helpful for drawing equilateral triangles.

- - -- ---

It reminds me of this:

Diffraction - Source: German PDF [found at TU-dresden website]

...