Ed's Big Plans

Computing for Science and Awesome

Archive for the ‘Graph’ tag

A Tessellation (1-, 2-, 3- unit length edges)

without comments

Here’s a neat tiling I saw on the ground recently.

A plantless pot.It's Lucky! :DThe ground.

This tiling happens to be a solution that ensures that graph nodes are regularly spaced 1-, 2-, or 3- unit lengths apart.

1-, 2-, 3- units.

If we re-orient all of the tiles in the same direction, the nodes then become two unit lengths apart — and the graph becomes homomorphic with a hexagonal tiling.

2-, 2-, 2- units.1-, 1-, 1- unit.

I’ll let you know if I find an application to the 1-, 2-, 3- hop pattern.

Eddie Ma

February 18th, 2013 at 6:56 pm

Posted in Algorithms

Tagged with , , ,