Geodesic Sphere Topology

I thought I’d create an implementation of this description of a hex-based geodesic sphere to see what I thought of it, and it seems that I rather like it :slight_smile: This algorithm uses no memory at all, and calculates adjacencies on the fly when required.

By way of a brief explanation:

The constructor for NewGeodesicSphereTopology takes a “size factor” which describes the length in hexes of one of the triangles in the icosahedron. With a size factor of 1, there are in fact no hexes, as the vertices of the icosahedron are of course pentagons.

I’ve described the shape unfolded from the icosahedron in terms of 5 “patches”. Vertex 0 is the “North Pole” and 11 is the “South Pole”, with odd indices in between being the northern “tropics” and the evens being the southern.

Here’s the gist of the code. fixed a small bug

Cas :slight_smile:

*lcass rubs his head :-
Ow. I really should learn geometry to a decent standard , 3d programming hurts the mind :0
However this is very impressive even if my mighty brain cannot handle it.

thanks for sharing! :slight_smile: