#triangle grid

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

The A-star pathfinding algorithm finds the shortest path from a start node to a goal node in a node graph (assuming the path exists). It does this using two heuristics.

The first heuristic measures the distance from the current node to the start node. The second heuristic measures the distance from the current node to the goal node. The combined scores of these two heuristics can be used to steer the A-star algorithm towards optimal nodes.

Uncovered Treasure designed by Ben Parker | reverse engineered | folded by

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

In geometry, a triangular grid is formed by tiling a plane with equilateral triangles, where each cell has exactly 3 neighbours. The triangles used to form the grid must be equilateral, meaning all sides are equal in length and all angles are 60 degrees.

Because the internal angle of the equilateral triangle is 60 degrees, 6 triangles at a point occupy a full 360 degrees. The triangular tiling has Schläfli symbol of {3,6}.

A triangular grid, is also known as triangular tessellation. It is also one of the three regular tilings of the Euclidean plane. It is the only such tiling where the constituent shapes are not parallelogons.

Triangle grid with connected rendered lines and circles only

Triangle grid with connected rendered lines only

Custom Grid- Triangle

Whirls designed by Joel Cooper | crease pattern | folded by