I think we're running into a misunderstanding on what we are discussing here. The bottom line is that the icosahedron is the largest possible Platonic solid. You cannot make a larger polyhedron from regular polygons without mixing your polygon types. This is a mathematical fact.You did say regular polygons, which equilateral triangles indisputably are.
By the way, guys, just so that you understand where I'm coming from: I got my inspiration from the larger (larger than C60) fullerenes:
The C540 fullerene looks like it uses only hexagons, which is ideal for our purposes. Note however that this construct uses non-Euclidean geometry so the sum of the interior angles isn't necessarily 360 degrees. All of my earlier comments assume we're talking about Euclidean geometry.By the way, guys, just so that you understand where I'm coming from: I got my inspiration from the larger (larger than C60) fullerenes:
![]()
The C540 fullerene looks like it uses only hexagons, which is ideal for our purposes. Note however that this construct uses non-Euclidean geometry so the sum of the interior angles isn't necessarily 360 degrees. All of my earlier comments assume we're talking about Euclidean geometry.
I don't know enough about non-Euclidean geometry to make a lot of certain statements... for example, I don't know if it is provable or not that a construct larger than the C540 fullerene is possible that only uses hexagons. And all the Euclidean questions remain... do you allow for mixing polygon types? If so, then to prevent the issue of having some tiles with more neighbors than the others, you have to go with triangles as the base tile. And to answer the 'why only move through the sides' question, if it turns out to be impossible to subdivide the faces with equilateral triangles, then each vertex will have different numbers of triangles meeting. In this case, moving 'diagonally' gives you differing amounts of neighbors from tile to tile, which is the problem you wanted to avoid by doing the triangle subdivision in the first place.
I have several colleagues here with math doctorates so I've asked them if it is proved or unproved that you can subdivide regular polygons into equilateral triangles in non-Euclidean space, or if you can make polyhedra arbitrarily large with a single type of regular polygon in non-Euclidean space. Even if the answer to these questions is 'no', it seems like there are enough fullerenes using hexagons that you could get some decent map sizes.
http://antiprism.com has some algorithms and example pictures for generating these kinds of polyhedra, although you may notice that some of them don't provide an equal area per face.
Really? Looking at C540 (the leftmost one in your picture) it doesn't look like there are any, but it can be hard to tell.As far as I know, all of the fullerenes use pentagons (the famous 12 pentagons) in addition to the hexagons.
This thread makes my head spin. There is a reason I do liberal arts and not math.
That would work with movement but I think you still need to have a tessellated surface or else you need to come up with a new system for assigning citizens to work land, and for deciding how much of the surface corresponds to a given terrain type or resource bonus.Tessellation becomes a non-issue as the surface type (2-D, 3-D) dictates the formulas necessary to construct the surface.
Oh yes. The fullerenes in the picture are actually all the same - C960. The figure on the right is just a curved version to make it spherical, which is what we're talking about. Check out the originating link (slightly) for more info.Really? Looking at C540 (the leftmost one in your picture) it doesn't look like there are any, but it can be hard to tell.
There's a formula for evenly distributing points on a sphere, so I'm fairly convinced you can make a map of any large size with hexagons since it corresponds to a non-planar graph where every node has 6 connections, but I didn't want to post it to give readers a break![]()
This would only be cool if you actually died without leaving any other trace of your proof.For this, I have found a truly wonderful proof, but the post is too small to contain it.