Jump to content

Talk:Regular polygon/Archive 1

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia

This is the current revision of this page, as edited by Lowercase sigmabot III (talk | contribs) at 17:18, 7 August 2024 (Archiving 2 discussion(s) from Talk:Regular polygon) (bot). The present address (URL) is a permanent link to this version.

(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)


Request for suggestions

[edit]

I have made my first 'noticeable' on Wikipedia. That is, not simply running a spell check. Could someone please give me some constructive criticism on how to better improve this article? 69.14.16.239 (talk) 23:52, 7 May 2008 (UTC)[reply]

Sorry, I just realized that I was logged out. I am now logged in with my real screen name.Thestarsprism (talk) 23:54, 7 May 2008 (UTC)[reply]

Angles

[edit]

How do you find the interior and exterior angles of a regular polygon, especcially octogon, nonogon, and hexagon.--User:Rat235478683--

The general formula is already there. I just added a subheading so you can find it. -- Steelpillow (talk) 15:28, 8 May 2008 (UTC)[reply]

Hexagon Formula

[edit]

Can someone fix the hexagon formula? It's showing up as markup rather than a nice formula image and I don't know enough about the markup to know what's wrong. 66.162.50.98 (talk) 21:48, 12 November 2008 (UTC)[reply]

rules

[edit]

I want to know the rules for a regular polygon —Preceding unsigned comment added by 207.118.3.236 (talk) 23:03, 6 April 2009 (UTC)[reply]

Tell us what sort of rules you need, and we will be happy to supply them. Do you mean the methods of construction? Dbfirs 14:48, 7 April 2009 (UTC)[reply]

convex or star

[edit]

The article says that all angles of a polygon must be equal, however, it goes on to say that regular polygons can be convex or star. This is not possible, because star shapes have reflex angles as well as acute angles. Therefore, a star polygon cannot be regular because it has reflex angles. The information stating that a regular polygon can be a star should be removed. —Preceding unsigned comment added by 24.113.98.113 (talk) 02:04, 27 April 2009 (UTC)[reply]

You have a very good point there. I've tried to clarify, but there is probably a better way to do this. Perhaps we should split "regular star polygon" away from the standard definition of regular (convex) polygon. What does anyone else think? Dbfirs 18:17, 27 April 2009 (UTC)[reply]
Regular star polygons are very well defined. All angles are acute. Poinsot defined them in the same paper he described the four regular star polyhedra (the fact that both the regular star polygons and polyhedra have only acute angles even led him to think of them as convex figures, an idea which did not lose favour for over a hundred years). The requirement for equal angles, as stated at the beginning of the lead, is sufficient to ensure that the given equal-sided polygon is regular, whether it is convex or star. No other explanation is needed in the lead, so I have undone the addition.
A polygon which has equal sides and alternating reflex and acute angles is sometimes called a star polygon, but this usage is not well defined. Certainly such a figure cannot be regular. This article is specifically about Regular polygons. A star which is not regular is irrelevant, and consequently is excluded by the definition given in the lead.
As for splitting off the regular stars, that is quite unhelpful. We would then have to split off Regular convex polygon too, and use this article to stitch the subject back together. Urrrgh. You might like to take some time out to contemplate Schläfli symbols - light may then begin to dawn.
-- Cheers, Steelpillow (Talk) 20:36, 27 April 2009 (UTC)[reply]


Yes, point taken, and I am quite happy with your viewpoint from a mathematical point of view, but could we clarify somehow (not in the way that I attempted) to avoid misunderstanding by non-mathematicians? Perhaps we could just say that, in star polygons, only the acute angles count as internal angles. Dbfirs 13:33, 28 April 2009 (UTC)[reply]
The article begins, "A regular polygon is a polygon which is equiangular (all angles are equal in measure) and equilateral (all sides have the same length). Regular polygons may be convex or star." I do not know how it can be made clearer than that - I can see no room for misunderstanding, provided I suppose that one has read what is written. Whether a polygon is convex or star is neither here nor there in considering whether it is regular, it just happens that all (geometrically) regular polygons may be divided into these two classes. The rest of the article goes on to enlarge on this in detail. (Irregular polygons of any kind, whether star or convex or anything else, are utterly irrelevant to this article.) -- Cheers, Steelpillow (Talk) 15:59, 28 April 2009 (UTC)[reply]
For someone who has never encountered star polygons before I think there is a chance of confusion. With the pentagram there are 10 visible angles, the novice really needs pointing out that only five of these are important. A simple diagram indicating the important angles and edges could clear this up. --Salix (talk): 18:27, 28 April 2009 (UTC)[reply]
For someone who has never encountered star polygons before, the article already links to star polygon in both the lead and in the section on regular stars. The article does not explain what a polygon is, nor does it explain regularity or convexity. Sh why on Earth should one expect it to explain starriness either? It links to the relevant articles for all of these, and that is how it should be. -- Cheers, Steelpillow (Talk) 08:35, 29 April 2009 (UTC)[reply]
What it does not explain is that a two-dimensional representation of a star polygon is misleading because it creates extra angles. For those of us who can imagine a Klein bottle, this is no problem, but the statement that all angles are equal is obviously false for the drawn representation of a star pentagon seen as a pentagram (this was the point raised by 24.113.98.113). Dbfirs 21:14, 29 April 2009 (UTC)[reply]

Area

[edit]

I disagree with the equation stated as the area for a regular polygon:

I believe it is:

I have proved this years ago, tested it many times, found the limit, and even took it to my college professor who agrees with my proof and equation. I can even present my proof if anyone would like. Jeanlovecomputers (talk) 22:22, 29 December 2009 (UTC)[reply]

A quick check of the first equation with the unit square (n = 4, r = √2 / 2) gives
A = 1/2 * 4 * (√2 / 2)^2 * sin ( π / 2)
= 1/2 * 4 * 1/2 * 1 = 1
I.e. correct Your formula gives
A = 1/2 * 4 * (√2 / 2)^2 * sin ( π / 4)
= 1/2 * 4 * 1/2 * (√2 / 2) = √2 / 2
I.e. wrong. You could post your proof if you want but I think the numerical accuracy and correctness of the current formula is pretty clear.--JohnBlackburne (talk) 22:32, 29 December 2009 (UTC)[reply]
I already replied with the same example on my talk page. It resulted in silence, so I guess Jean got the message. Cheers, DVdm (talk) 23:12, 29 December 2009 (UTC)[reply]
Yes I saw after posting as I was sure this had come up before. Can't really think of an easier one to do though than the unit square.
To Jeanlovecomputers have a look at Triangle#Using trigonometry, the current formula can be easily derived from that, a standard (i.e. I learned it at high school) formula, and the picture makes it clearer. --JohnBlackburne (talk) 23:18, 29 December 2009 (UTC)[reply]

Okay, I stand corrected as I look back at my proof. However, I do have a different equation than what is on the page:

Each regular polygon can be divided into triangles, where one side s is a side of the polygon, giving n triangles. This leaves the center angle L and corner angle R:

Because each of these triangles are symmetrical, they can be divided by 2, which will be easier to find their area B:

Using trigonometric functions, we can solve for s and a:

We now substitute s and a into B:

Because we divided by 2 to get the smaller area, we now multiply by 2 and n to get the total area of the regular polygon A:

If r remains the same as n increases, we know that s will eventually lead to 0. In other words, as the number of sides increases to infinity, the regular polygon becomes a circle. We know the area of a circle is:

Stating this, we can take the limit of a regular polygon:

Do you agree with this? I am sorry for my previous false equation. My mistake. Jeanlovecomputers (talk) 00:04, 30 December 2009 (UTC)[reply]

This
Is equivalent to the formula on the page. See Double-angle formula, where there's
which connects them --JohnBlackburne (talk) 00:13, 30 December 2009 (UTC)[reply]
So are we good now? I feel stupid for putting up the wrong equation and not even looking at my own proof beforehand. Jeanlovecomputers (talk) 00:17, 30 December 2009 (UTC)[reply]
We all get it wrong sometimes, so I wouldn't worry about it. Posting here instead of on the page was definitely the right thing to do if you're not sure about it.--JohnBlackburne (talk) 00:24, 30 December 2009 (UTC)[reply]
Minor quibble ;-) - DVdm (talk) 09:26, 30 December 2009 (UTC)[reply]

Question

[edit]

I'm asking this question after an argument in real life: how is the area of a star polygon defined? In the pentagram, is the central pentagon part of the pentagram? Or should it be counted twice in the area? It gets worse for heptagrams (7/3). 4 T C 12:24, 31 December 2009 (UTC)[reply]

I don't know there is a standard definition. Looking at Area it mentions a "region bounded by a closed curve", and there are various curves you could use here. I would go with the area of the pentagon + 5 triangles, but you can make a case for counting the pentagon twice or not at all. Really up to you. --JohnBlackburne (talk) 12:38, 31 December 2009 (UTC)[reply]
It depends on one's area (sorry) of interest. For example if I were cutting one out of plywood, I would count the centre once. But the nearest thing to a standard definition in mathematics is the generalisation of what we now call simplicial decomposition (i.e. dividing into triangles) that Cayley made about 150 years ago when he first figured out how density works: this method ends up counting it twice. But even this method runs into trouble with the volumes of non-orientable polyhedra. With respect to a "region bounded by a closed curve", the real difficulty is to understand what we mean by "bounded by" in such circumstances. BTW, if anybody can provide a respectable reference for not counting the central pentagon at all (effectively treating the figure as an embedding of a Möbius band), I would be most interested. -- Cheers, Steelpillow (Talk) 21:35, 31 December 2009 (UTC)[reply]
The only references I've seen (I just Googled 'pentagram area') treat the pentagram as a whole, i.e. the area is everything inside the outer boundary. But if you were to argue that the internal boundary was also an edge, and edges have to separate filled and unfilled regions, then you could say the centre must be unfilled and so not part of an area. Alternately use the winding number to argue it must be counted twice. As the original poster noted start polygons with 7 or more vertices can have higher winding numbers which makes both calculations far more complicated. --John Blackburne (wordsdeeds) 22:15, 31 December 2009 (UTC)[reply]
Cayley's (density) method is simple to use for any regular polygon, whether convex or star. For any {n} or {n/q}, mark the centre P. Draw rays from P to the two ends A, B of an edge. The area of the polygon is then just n times the area of the triangle ABP (where the angle APB = 360 deg * q / n). -- Cheers, Steelpillow (Talk) 20:27, 1 January 2010 (UTC)[reply]

Area Formula

[edit]

This method has been moved here from the article octagon. It needs some re-writing, then it could possibly go in this article? Dbfirs 21:34, 24 January 2010 (UTC)[reply]

Any regular polygon can be divided into numbers of equal right-angled triangles, so the area can also be calculated more simply, in the case of a polygon with an even number of sides, by taking the distance between any two opposite sides (A), dividing by two and then multiplying by the length of one side(B), divided by four and then multiplying by twice the total of the number of sides (N) as follows:

((A/2) * (B/4)) * 2N or just ABN/4

This works for any regular polygon by just changing the value of N provided that n is even. (For regular polygons with an uneven number of sides A is calculated as the distance between the point of one angle to the mid point of the side opposite.) diameter of the incircle.

The problem is not only do you need to know N, you need to know A and B too. And if you don't know them you have to calculate them. They are related by trigonometry to each other and the circumradius through the right angled triangles you mention, so it's not too difficult, but you end up with the current formula, i.e. it's no more simple.--JohnBlackburnewordsdeeds 21:46, 24 January 2010 (UTC)[reply]
Yes, I agree as a mathematician that it needs two measurements and so is "less elegant", but for finding the area of a regular polygon in the real world (outside our mathematical world of roots and trigonometry), this method is so much simpler that it is worth recording in any regular polygon article that might be read by a non-mathematician. Dbfirs 21:52, 24 January 2010 (UTC)[reply]
One flaw in your formula: it only works for polygons with an even number of sides, so it's also not as general. But even without this concern I think the current formula, which gives the area in terms of one easily measured quantity, is preferable.--JohnBlackburnewordsdeeds 22:55, 24 January 2010 (UTC)[reply]
Yes, I'm checking the version claimed for odd n before I post it anywhere. Of course the standard formula is preferable for mathematicians, but have you tried asking engineers, or the general public, which they prefer? I'm not proposing to give it status equal to that of the standard formula, but, for many readers, this simple "measure and multiply" formula is the only one that they will feel confident to use. Dbfirs 00:21, 25 January 2010 (UTC)[reply]
It's not my formula, by the way, it was posted by anon editor 88.105.90.141, and is the only contribution to Wikipedia from that IP address. I wonder who it was. I think I've seen something similar before (many years ago), but I hadn't remembered the details. I wonder if it is published anywhere. It would be good to find a general proof - I've only proved it so far for specific even values of n. Now that I'm awake, I realise it is trivial! Dbfirs 00:25, 25 January 2010 (UTC)[reply]
...(later) ... Now that I've checked, I realise that you are right (of course). This is really just another way of expressing the perimeter formula, and the anon's adjustment for odd n is not correct. I've altered the statememt above, but this means that this is not a useful general formula for odd n, and we already have the perimeter version, so it is probably not worth adding as a method for a general polygon. (Possibly we could express the formula in terms of the "in-radius", but I now share your doubts over whether it is worth the effort for any odd n.) The simplified formulae for even n are worth adding to the specific articles (as I've already done with hexagon, octagon, decagon & dodecagon. Dbfirs 01:33, 25 January 2010 (UTC)[reply]
Indeed, this ABN/4 for an octagon (and for any even-numbered regular polygon) is just a trivial special case of the general formula in the section Regular polygon#Area: A=1/2 Nsa with s=B and A=2a. I don't think these a need for this in this article. DVdm (talk) 08:31, 25 January 2010 (UTC)[reply]
Agreed. I hadn't realised that we already have it in this article in an alternative form. I moved it from Octagon because it was inappropriate there ( - too general). I've just adapted it for specific even-n polygons where it provides a simple calculation of area from two easy measurements, but this is the limit of its usefulness. Dbfirs 09:13, 25 January 2010 (UTC)[reply]

Edge vs. side

[edit]

I've noticed a little disagreement in terminology (and even stuck my nose in). According to edge (geometry) the sides of a polygon are called edges. This is certainly a true statement about polytopes and I point out that all the references in that article are from "polytope land". However, the common term for polygons is side, as is used throughout this article (except for a section dealing with polytopes). One talks about an n-sided polygon and even the polytope guys and gals don't call them n-edged polygons (or at least I hope they don't). Edge may be the more proper term from the polytope point of view, but by WP:COMMONNAME we should be using side in an article about polygons. Our job as editors does not involve correcting common usage, we just report on it. Bill Cherowitzo (talk) 04:23, 4 February 2014 (UTC)[reply]

Agree, and "side" is consisent with the notation used in the table. - DVdm (talk) 07:55, 4 February 2014 (UTC)[reply]
For a polyhedron, the sides of the polygonal faces are called edges, but I agree that "sides" is the usual term in two dimemsions. Dbfirs 09:02, 4 February 2014 (UTC)[reply]
In polytope land it is more correct to say that "the edges of a polygon are commonly called sides". Likewise the faces of a polyhedron are also commonly called sides. When bouncing between dimensions this creates ambiguity. It all boils down to the issue of whether one is talking about 1-dimensional elements or (n−1)-dimensional elements of an n-dimensional figure. In higher dimensions there is a certain amount of disagreement on how to resolve this, not properly reflected in the polytope article. When discussing the one we talk of edges or (line) segments, when discussing the other we may talk of sides, facets or various other things. I agree that all this is out of place in the present article, except in any brief discussion of the polygon as a 2-dimensional polytope. — Cheers, Steelpillow (Talk) 10:05, 4 February 2014 (UTC)[reply]

Show with root for 7 and 9

[edit]

cos(pi/7) and cos (pi/9) can be showed with root, because we need only solve 3-degree formula, not greater then 4, why the list doesn't show with root?

See DVdm's comments for Area Table above. Dbfirs 08:25, 17 April 2014 (UTC)[reply]

100,000

[edit]

What is a 100,000 sided polygon?--90.217.236.77 (talk) 21:00, 31 May 2011 (UTC)[reply]

An almostcirclegon. DVdm (talk) 17:18, 4 November 2011 (UTC)[reply]
I learned it as a closenufegon but maybe it's different in Europe. JayBeeEye (talk) 04:06, 5 November 2011 (UTC)[reply]
I would expect decakismyriagon, as that's how 105 goes in Ancient Greek. {106}, {107}, and {108} would thus be hecatontakismyriagon, chiliakismyriagon, and myriakismyriagon respectively. However, at this point, I doubt there is any point to these names, or if anyone has ever mentioned (let alone used) them. Double sharp (talk) 08:45, 15 February 2015 (UTC)[reply]
(Caveat: the prefixes for numbers above 104 are just from Archimedes' system.) Double sharp (talk) 10:46, 15 February 2015 (UTC)[reply]

Large numbers of sides

[edit]

Names and other vital statistics of a good few polygons with some large numbers of sides are given in this article, but are unsupported by the sources. The approximations in the Table of Areas in apricular appear to be explicit WP:OR, calculated by the editor from a piece of software. Most of these larger side numbers are also non-notable. Is there any valid reason to keep any of this higher-numbered stuff? — Cheers, Steelpillow (Talk) 08:39, 17 April 2014 (UTC)[reply]

If the names are unsourced and challenged, they can of course go. I think that the table has merit. The correctness of the values as calculated by Maple can be verified and thus satisfy wp:V. The values are not really calculated from a piece of software, but by one. The table has been sitting here for quite a while and I think there's a consensus to keep it—see wp:CALC and previous discussion here on talk in section #Area table. - DVdm (talk) 09:13, 17 April 2014 (UTC)[reply]
The table is interesting in that it shows the approach to the limit, and the calculations are easily verified. I'd be more inclined to delete shapes like the Heptacontagon. Dbfirs 09:19, 17 April 2014 (UTC)[reply]
It is rather wide, but will print at 60% scaling. I have little interest in it, but if its value is showing its relation to π, it might fit better on an article like Area of regular polygons. Tom Ruen (talk) 18:58, 14 February 2015 (UTC)[reply]
What criteria are being used to justify stats for polygons above the commonplace? I removed those above 12 sides and got reverted. I can see absolutely nothing of encyclopedic value in the restored stats, nor is there any citation of a reliable source to support their value. If none can be produced then the stats have to go, per WP:UNDUE if nothing else. — Cheers, Steelpillow (Talk) 17:19, 14 February 2015 (UTC)[reply]
See previous section. - DVdm (talk) 17:25, 14 February 2015 (UTC)[reply]
This discussion is now merged into one section. The "it's been here a while" argument is futile. #Area table did not address the issue that I raise here. That a calculation may be correct or an editor may opine that it is interesting does not make it encyclopedic. In short, no good reason has been advanced to keep any of it, let alone the trivia I hoovered up. — Cheers, Steelpillow (Talk) 20:27, 14 February 2015 (UTC)[reply]
My 2c:
  • This is the article on regular polygons, the naming of polygons should therefore be discussed in polygon, not here.
  • The large table in section "Regular convex polygons" does not add anything to the article. The Schläfli symbols are nicely illustrated in the color image on the side and once you know how the first 12 go, it's easy to figure out the rest. The shapes are illustrated in the infobox at the top – beyond the dodecagon they are insdistinguishable from a circle on normal displays anyways. The names can also be found in the bottom table. The table could therefore be completely culled from the article without loss.
  • The large table in section "Area" tries to achieve too much. Two tables, one with exact values for select regular polygons (say up to 12 or 16) and one table with numerical values (say up to 10 and then in powers of 10) would serve the purpose better. In addition it would solve the oversize problem.
Last year I completely rewrote the corresponding article Regelmäßiges Polygon in the German Wikipedia. Maybe you can find inspiration there (sorry for my shameless canvassing). Best wishes, --Quartl (talk) 08:59, 17 February 2015 (UTC)[reply]
That makes a great deal of sense to me. Any well-supported objections? — Cheers, Steelpillow (Talk) 19:20, 17 February 2015 (UTC)[reply]
OK, I removed the large table. (A little off topic, but answering your question: at that size I can just about tell that they're not circles until the hexadecagon, and if I squint really hard the icosagon. But that may be because of my screen resolution.)
Splitting the oversized table sounds like a good idea, although personally I'd be slightly inclined in the large table to keep a link to every polygon we have an article on. This is because we've just removed the table which links to all the names, and because pretty much all our large polygon articles are primarily focused on the regular ones. (Of course we should still have exact values for selected regular polygons.) Double sharp (talk) 10:08, 18 February 2015 (UTC)[reply]
Many thanks. Please note that neither the deleted table nor the remaining table contains links to every existing polygon article. For example icositetragon is missing in both. The navibox at the bottom is presumably complete with this regard. If you really want to include links to all polygon articles in the body of the article how about a multi-column bulleted list? Best wishes, --Quartl (talk) 11:24, 18 February 2015 (UTC)[reply]
I think that listing them in the article purely to provide links is a mistake. Any such list needs to both be informative and to have what one might call a natural scope. A simple list of commonly named polygons in this article fulfils neither requirement. — Cheers, Steelpillow (Talk) 16:34, 18 February 2015 (UTC)[reply]
Well, the current scope is that we have articles on them, so they are surely notable. Any suggestions for a better scope? Best wishes, --Quartl (talk) 17:03, 18 February 2015 (UTC)[reply]
No. And that is precisely the problem. They add nothing to an article on the regularity of polygons, the list belongs elsewhere - where they might have some relevant notability. — Cheers, Steelpillow (Talk) 17:11, 18 February 2015 (UTC)[reply]
Completely fine with me, it was just a suggestion of mine. Best wishes, --Quartl (talk) 17:52, 18 February 2015 (UTC)[reply]
The 24-gon was in the deleted table. But you're right: I didn't notice the navbox was at the bottom at first, and since it is there I do not think we have to specify all the names in the remaining table anymore. Double sharp (talk) 05:10, 19 February 2015 (UTC)[reply]
Ok, I deleted the column and formatted the headers to save some space. The oversize problem should be fixed now. Best wishes, --Quartl (talk) 08:41, 19 February 2015 (UTC)[reply]
Looks good. The removal of the names will probably make it more stable too. - DVdm (talk) 11:45, 19 February 2015 (UTC)[reply]

Interior angles

[edit]

The measure of an interior angle of a regular n-gon is an integer number of degrees if and only if n divides 360. There are only 22 such n, namely, 3, 4, 5, 6, 8, 9, 10, 12, 15, 18, 20, 24, 30, 36, 40, 45, 60, 72, 90, 120, 180, and 360. For those values of n, the measures of the interior angles are 60°, 90°, 108°, 120°, 135°, 140°, 144°, 150°, 156°, 160°, 162°, 165°, 168°, 170°, 171°, 172°, 174°, 175°, 176°, 177°, 178°, and 179° respectively. GeoffreyT2000 (talk) 16:35, 18 April 2015 (UTC)[reply]

Assessment comment

[edit]

The comment(s) below were originally left at Talk:Regular polygon/Comments, and are posted here for posterity. Following several discussions in past years, these subpages are now deprecated. The comments may be irrelevant or outdated; if so, please feel free to remove this section.

This article jumps into complexities too quickly. It needs refocussing with a gentler start and a section on History, e.g. geometric construction by the Greeks, constructing the heptagon, Poinsot's study of regular star polygons (in the same paper where he describes the regular star polyhedra). That table of area results should go - all we need is the general method and a couple of worked examples. More pictures too, especially of star polygons. -- Steelpillow 22:37, 8 June 2007 (UTC)[reply]

PS1234 (talk) 09:14, 14 March 2014 (UTC)[reply]

=== A regular polygon , one side as base of polygon ===

H = height of regular polygon , W = width of regular polygon , r = circumradius of regular polygon , n= number of sides of regular polygon

H =  2r•cos2(Π/2n) if n mod 2 = 1 , 2r•cos(Π/n) if n mod 2 = 0
W = 2r•cos(Π/2n) if n mod 2 = 1 , 2r•cos(Π/n) if n mod 2 = n mod 4 = 0 , 2r if n mod 2 = 0

Last edited at 14:23, 14 March 2014 (UTC). Substituted at 02:33, 5 May 2016 (UTC)