I don't see that that would matter - differences like this seem to be
just changing the origin point chosen for the pentagrid - that has no
substantial impact on the associated tiling. For example in the
original article you quoted, it is possible to construct the given
tiling from the given pentagrid (give or take a plane translation) with
no knowledge about where the origin is located. And given /any/ choice
of offsets, we can clearly choose a new origin that "balances" the
offsets so that they sum to zero. And adding 1 to any offset has no
effect on the pentagrid etc..
I believe, just from my understanding of your original linked article,
that there would be one such point in each such polygon. The number of
sides the polygon has is going to correspond to the number of rhombus
tiles that meet at that vertex. E.g. in the png file linked below, the
origin is surrounded by a decagon (10 sides), and in the generated
tiling we see 10 thin rhombuses meeting at the corresponding vertex.
>
> For instance, in this image found online, it seems that only some regions enclosed by
> gridlines end up with a point, but even more confusing is that in the bottom right area
> there is a region that has two points.
>
>
https://i.imgur.com/qrTaZc0.png
>
Yeah, I don't really know what those images are showing with the dots in
diagram (b). Looking at the tiling in (c) it seems to me that there is
a vertex for /every/ polygon in (b), regardless of whether (b) shows a
dot - so I think the dots in (b) are for some different purpose. (Also
the original article seems to clearly imply (to me at least!) that this
is what is intended. Every polygon area is clearly the intersection of
exactly one pentagrid "stripe" of each of the five orientations, which
gives it a unique set of integer "coordinates", i.e. a unique vertex
location. And as the article covered, as you cross one of the bounding
lines to the polygon on the other side of the line, 4 of the coordinates
are unchanged, and the remaining increases or decreases by 1, which
corresponds to a tiling edge that is going to be one of the five unit
orientation vectors (or its negation, which amounts to the same).
> Creating a pentagrid in desmos wasn't too hard, but I'm trying to find an article that
> has a clear explanation/demonstration of how to relate the vertices of the penrose
> tilings to the grid intersections and figuring out the logic behind the way potential
> regular pentagrids (with at most two lines intersecting at any point) match up with
> the complete spectrum of possible penrose tilings.
>
>
https://www.desmos.com/calculator/sfdkriwohe
>
I'd go with your original article, unless something I don't understand
stops that from working. The only vagueness there seems to be deciding
whether the stripe to the left or right of the "zero" line (for a given
family of parallel lines) should be called the "zero" strip. Again,
this hardly affects anything, at most introducing a translation to the
final tiling. I'd go with labelling the zero strips of each colour to
be those containing the graph origin - that seems intuitive.
So in your desmos pentagrid, looking at the graph origin I would say
that belongs to the 0 red strip, and similarly to the 0 blue, green,
orange and purple strips. So it's vertex coordinate (in the tiling
graph) would be
0(e_1) + 0(e_2) + 0(e_3) + 0(e_4) + 0(e_5) = 0
[The vertex is at the origin of the tiling graph, which seems
reasonable, but if we'd decreed the red strip containing the grid origin
was to be labelled (red) strip 1 it would just mean the every tiling
vertex will be translated by a fixed offset, no great shakes...]
And similarly the graph point (x,y)=(3,1) on your desmos page is part of
a grid octagon (just!) having strip coordinates (3,3,2,0,-2)
[corresponding to your red, orange, blue, purple, green strips
respectively], giving a vertex point of
3(e_1) + 3(e_2) + 2(e_3) + 0(e_4) - 2(e_5) = ???
[I'm just too lazy to work this out, but it's a clear and definite point
in the tiling plane...]
Ok, at this point I confess I had a bit of a panic/confusion! I
thought: this doesn't make sense because there will be multiple "strip
coordinates" that map to exactly the same tiling coordinate -
specifically the intersection of all the zero strips has "strip
coordinates" (0,0,0,0,0) which corresponds to a vertex at the (tiling)
origin. BUT ALSO (1,1,1,1,1) in strip coordinates corresponds to a
tiling vertex at
1(e_1) + 1(e_2) + 1(e_3) + 1(e_4) + 1(e_5) = 0 [by symmetry!]
i.e. also a duplicate vertex at the (tiling) origin. Aaaagh! WTF?
But... on reflection I'm worrying about something that never happens:
with the strip labelling I chose, the five "1-strips" (i.e. the strip 1
strips for each colour) have an empty intersection - there's no polygon
in the pentagrid with grid coordinates (1,1,1,1,1) or (2,2,2,2,2) etc..
Problem solved, sort of, I think. :)
Finally, you mention that /every/ tiling of the plane has a
corresponding pentagrid that generates it. The first article you linked
claims that, but it's not obvious to me at all how to prove it, so I
can't say about that! (It's a nice result, assuming that's been proved...)
Mike.