Talk:Euclidean tilings by convex regular polygons

message: Shouldn't this be "Tilings by regular polygons" or even "Plane tilings by regular polygons"? Melchoir 01:18, 9 October 2005 (UTC)
thread_title:  Title 

message: I cleaned up the article and removed the cleanup tag.  There are still a number of topics discussed in Grünbaum and Shephard which could perhaps be discussed on this page but aren't yet:
*More on k-uniform (and k-isohedral, k-isotoxal) tilings, with additional examples and something on the Krötenheerdt tilings; equitransitive tilings.
*Non-edge-to-edge tilings: equitransitive unilateral tilings by squares; the problem of tiling the plane with exactly one square of each integer edge length.
*Star polygons, both in the style of Kepler (Grünbaum and Shephard section 2.5, the lists there being incomplete) and as hollow self-intersecting polygons (section 12.3); I shouldn't make the call as to notability of the former, having published regarding them.
*The duals of the uniform tilings (Laves tilings).
*Archimedean and uniform colourings of tilings.
Joseph Myers 00:41, 6 October 2005 (UTC)
thread_title:  Cleanup and topics not covered 

message: The following proves there are infinitely many tilings made out of regular polygons:
*A hexagon is always interchangeable with a flat pyramid (6 triangles meeting at a vertex)
*A dodecagon is always interchangeable with a flat cupola (a hexagon surrounded by squares on each edge and triangles at each vertex)
But, is the following question known:
How many tilings of regular polygons are there that don't contain in them any flat pyramid or flat cupola?? Georgia guy (talk) 22:55, 10 October 2010 (UTC)
replies: text: Still infinitely many (even uncountably many), even if you require the polygons to meet edge-to-edge, because you can tile the plane by any sequence of square strips and equilateral triangle strips. —David Eppstein (talk) 22:59, 10 October 2010 (UTC)
thread_title:  How many?? 

message: The references for this page have long included a link to a 1989 paper of mine. Since that source is difficult to access, I have added a direct link from that reference to my web page from which one can download a copy of the paper. I hope doing so this is not a violation of Wikipedia rules. I was not the person who originally added this link (which I'm sure would be a violation), I only added the link from that reference to my page. Chaveyd (talk) 05:53, 26 June 2013 (UTC)
replies: text: It seems unproblematic to me but I fixed the formatting. —David Eppstein (talk) 06:09, 26 June 2013 (UTC)
thread_title:  Added Reference link 

message: Hello fellow Wikipedians,
I have just modified one external link on Euclidean tilings by convex regular polygons. Please take a moment to review my edit. If you have any questions, or need the bot to ignore the links, or the page altogether, please visit this simple FaQ for additional information. I made the following changes:
*Added archive https://web.archive.org/web/20150630004622/http://www2.math.uu.se/research/pub/Lenngren1.pdf to http://www2.math.uu.se/research/pub/Lenngren1.pdf
When you have finished reviewing my changes, you may follow the instructions on the template below to fix any issues with the URLs.
Cheers.—InternetArchiveBot (Report bug) 07:16, 27 December 2017 (UTC)
thread_title:  External links modified 

message: The section about "Archimedean, uniform or semiregular tilings" have a sub page where it lists those examples, but for the "k-uniform tilings" section all examples are listed here, making it a huge article. Surely this should be improved by a sub-page too? Rixn99 (talk) 08:50, 16 December 2018 (UTC)
thread_title:  Sub page for "k-uniform tilings" too? 

message: Tomruen: credit for my initiative is very kindly appreciated. Also please kindly change your .svg's so they reflect the uniformity. Some of your tilings, for example, are only red and no other color. Thanks for your consideration!
P.S. Please allot a consistent, markedly different, color for every planigon/semiplanigon. When the uniformity is higher than the number of planigons (vertex types), please use darker shades to denote secondary polygons.
Edit: sorry ClueBot NG, but I did not know this was vandalism. Tomruen overwrote my images first.
User:Harry Princeton
:I don't think duals belong in this article. It is already pretty huge. There are already images online here User:Tomruen/uniform_tilings if we have sources to defend them in an article possibly elsewhere. I agree having different colors for each shape is nice, while my SVG are colored by the number of sides alone. Tom Ruen (talk) 22:13, 25 June 2019 (UTC)
replies: text: I continue to think this article is already much too big to include the duals, but here's an adjusted graphic from the scattered unlabeled one. I grouped rows by sides, and put the unusable orange triangles ones on the bottom. Tom Ruen (talk) 19:15, 13 July 2019 (UTC)
thread_title:  Dual uniform tilings

message: Tomruen, I am not sure if http://probabilitysports.com/tilings.html is a verifiable source for enumerating Euclidean uniform tilings (particularly, 4-uniform and 5-uniform). Indeed, it is a strong source, but I want to be careful, since it's the only one and it is not explicitly published.  — Preceding unsigned comment added by Harry Princeton (talk • contribs) 00:11, 21 July 2019 (UTC)
thread_title:  [[Wikipedia:Verifiability|Verifiability]]