how is a regular polygon similar/different from a polygon?
598810
a regular polygon has the same angles and sides while a irregular one has different sides and angles.
214123
they say no two snowflakes are alike, but they are usually hexagonal in shape, although some can be three sided, 12 sided, or just plain irregular\n\nfor more info into how many shapes check:
99265
I asked that same question to my teacher last time. She told me that I have to Seperated the shape into different common shapes. (for example like lets say I wanted to seperate a "square" into some common shapes I could turn it into two seperate triangles or four different triangles. Well Just try to use the formulas you know for the areas of the different disected figures you get.
777666
Well, each angle has whatever value it happens to have. The only limitation is that the values can't be negative or greater than 360 degrees, and the total for all of the angles must be the appropriate value for a polygon with that number of sides (180 degrees for a triangle, 360 for a quadrilateral, 540 for a pentagon, etc. ... in general, 180 (n-2), where n is the number of sides).\n\nBecause you say it is a concave polygon, you are indicating that at least one angle exceeds 180 degrees. Obviously, this can't be a triangle (since the sum of ALL the angles of a triangle equals 180 degrees). But it can be any other polygon. The fact that one angle exceeds 180 degrees does not change the criteria given above (each angle greater than 0 and less than 360, and the sum of the angles being appropriate for the number of sides of the polygon).
795034
a cube isa rectangular solid whose l=w=h\n\n2.circle is the locus ofa moving point always equidistant from a fixed point\n\n3.A cylinder is similar to a prism, but its two bases are circles, not polygons. Also, the sides of a cylinder are curved, not flat.\n\n4.a rectangle is a parallelogram whose angles are 90*\n\nnow that you knowwhat these are you can figure out the usage
917271
click here:http://en.wikipedia.org/wiki/Polygon
464336
HEPTAGON - a seven-sided polygon.\n\nTRIANGULAR PYRAMID - a pyramid with a triangular base and 3 triangular faces.\n\nSCALENE TRIANGLE - a triangle none of whose sides have equal length. The angles don't have the same measures, too.\n\nISOSCELES TRIANGLE - a triangle 2 of whose sides have equal measures. Therefore, the angles opposite the congruent sides have equal measures also.\n\nEQUILATERAL TRIANGLE - a triangle all of whose sides have equal measures. The angles have equal measures, too.\n\nRIGHT TRIANGLE - a triangle 1 of whose angles has a measure of 90 degrees. The other 2 angles have measures that are less than 90 degrees. The side opposite the 90-degree angle is the longest side and is called the hypotenuse. The other sides are called legs.\n\nSPHERE - is shaped like a ball (round).\n\nCONE - it is a pyramid with a circular base.\n\nDECAGON - a polygon with 10 sides.\n\nDODECAGON - a polygon with 12 sides.
1085259
You need to get a little more specific in terms of what kind of "3d equivalent" you want.  Two kinds of 3d solids you can form easily from 2d polygons (closed shapes made of line segments) are prisms and pyramids.  You make a prism of any 2d shape by taking 2 copies of the flat shape, one above the other, and connecting the corresponding vertices (corners) with edges (lines).  From this perspective, a cube, is a square prism.  A triangular prism looks a little like a tent, with two triangles (top and bottom) and three rectangles or squares around the sides.  To make a pyramid, choose any 2d shape as the base, and then a point above the base as the top, and radiate edges down from the top to all the base's corners.  There are other "3d equivalents", so if you're thinking of something else, let me/us know.\n\nYou also need to be more specific about what kind(s) of sides interest you: edges (1d lines) or faces (2d flat surfaces).  The "sides" of a 2d shape are all edges, but 3d shapes like cubes have both edges and faces (a cube has 12 edges and 6 faces).  Any prism made from a polygon with N "sides" (edges) will have 3N edges (N on the top, N on the bottom, and N more connecting top and bottom) and N+2 faces (N around the sides plus top and bottom).  Any pyramid made from a polygon with N "sides" (edges) will have 2N edges (N around the base and N more reaching up to the top point) and N+1 faces (N around the sides plus the base).\n\nDoes this do it?
794439
how many sides does the polygon have u have to find how many side polygon is it then online look up whats that shape total degree like triangle always = to 180 then u would do 108(5) subtract from the total degree of polygon
159025
Polygon Rotation\n\nDescription\n\nThis article demonstrates how to rotate a polygon about its center. The polygon is a square, which is drawn using the Polygon() Win32 API function. All components on the form are created at runtime.\n\nPolygonRotation.cpp\n\n#include <vcl.h>\n#pragma hdrstop\n\n#include "PolygonRotate.h"\n#include &ltmath.h>\n//---------------------------------------------------------------------------\n#pragma package(smart_init)\n#pragma resource "*.dfm"\nTForm1 *Form1;\n\nint  X_old;\nint  Y_old;\n\nPOINT Poly1a[5]  = {{100, 100}, {300, 100}, {300, 300}, {100, 300}, {100,100}};\nPOINT *pPoly1a   = Poly1a;\n\nPOINT Poly1b[5]  = {{500, 100}, {700, 100}, {700, 300}, {500, 300}, {500,100}};\nPOINT *pPoly1b   = Poly1b;\n\nPOINT Poly2a[5];\nPOINT* pPoly2a = Poly2a;\n\nPOINT Poly2b[5];\nPOINT* pPoly2b = Poly2b;\n\n\n//---------------------------------------------------------------------------\n__fastcall TForm1::TForm1(TComponent* Owner)\n        : TForm(Owner)\n{\n    Position = poScreenCenter;\n    Width = 800;\n    Height = 600;\n    Color = (TColor)0xabcdef;  // Cream\n}\n//---------------------------------------------------------------------------\n\nvoid Translate(POINT* pin, POINT* pout, long DX, long DY)\n{\n    for (int i = 0; i < 5; i++)\n    {\n        (pout+i)->x = (pin+i)->x + DX;\n        (pout+i)->y = (pin+i)->y + DY;\n    }\n}\n\nvoid Rotate(POINT* pin, POINT* pout, float Alpha, long xr, long yr,\n            int NumberOfPoints)\n{\n//Rotate Polygon about a given point P whose coordinates are (xr, yr)\n\n   // Degrees to radians\n   float const K = -0.01745329;  // 2*3.141592653/360\n\n    for (int i = 0; i < NumberOfPoints; i++)\n    {\n        (pout+i)->x = (long)(xr + (((pin+i)->x - xr) * cos(K*Alpha))\n                                - (((pin+i)->y - yr) * sin(K*Alpha)));\n\n        (pout+i)->y = (long)(yr + (((pin+i)->x - xr) * sin(K*Alpha))\n                                + (((pin+i)->y - yr) * cos(K*Alpha)));\n    }\n}\n//---------------------------------------------------------------------------\n\nvoid Translate(POINT* pin, POINT* pout, long xt, long yt,\n               int NumberOfPoints)\n{\n//Tanslate Polygon\n\n    for (int i = 0; i< NumberOfPoints; i++)\n    {\n        (pout+i)->x = (long)((pin+i)->x + xt);\n\n        (pout+i)->y = (long)((pin+i)->y + yt);\n    }\n}\n//---------------------------------------------------------------------------\n\nvoid __fastcall TForm1::FormMouseDown(TObject *Sender, TMouseButton Button,\n      TShiftState Shift, int X, int Y)\n{\n       X_old = X;\n       Y_old = Y;\n}\n//---------------------------------------------------------------------------\n\nvoid __fastcall TForm1::FormMouseMove(TObject *Sender, TShiftState Shift,\n      int X, int Y)\n{\n\n       if (X_old != X)\n       {\n           // Convert X mouse movement into polygon rotation\n           Rotate(pPoly1a, pPoly2a, X, 200, 200, 5);\n           Polygon(Canvas->Handle, pPoly2a, 5);     //Win32 API\n       }\n\n       if (Y_old != Y)\n       {\n           // Convert Y mouse movement into polygon rotation           \n           Rotate(pPoly1b, pPoly2b, Y, 600, 200, 5);\n           Polygon(Canvas->Handle, pPoly2b, 5);     //Win32 API\n       }\n\n       X_old = X;\n       Y_old = Y;\n}\n//---------------------------------------------------------------------------\n\nPolygonRotation.h\n\n#ifndef PolygonRotateH\n#define PolygonRotateH\n//---------------------------------------------------------------------------\n#include <Classes.hpp>\n#include <Controls.hpp>\n#include <StdCtrls.hpp>\n#include <Forms.hpp>\n#include <ExtCtrls.hpp>\n//---------------------------------------------------------------------------\nclass TForm1 : public TForm\n{\n__published:// IDE-managed Components\n        void __fastcall FormMouseDown(TObject *Sender, TMouseButton Button,\n          TShiftState Sh
642032
The only regular polygons that can tessellate are triangles, squares, and hexagons. There are other polygons that can tesselate, and I believe there are 12 or so patterns that can repeatedly and uniformly tessellate using regular polygons.
561130
a cone is like a ice crea cone.vertices are the tips...like the pointy end of the cone. the face of a cone is the bottom part...a flat surface.  edges..well they explain themselves. they are the rims. like around the bottom of the cone\n\nstop asking people to do your homewkr for you kid
685476
As I understand from your question, a point fill set will be one that contains ONLY regular (or suicide) polygons. I am assuming that each polygon will have a vertex affixed to the so-said point. And that a complete set will be one of having the vertices (i.e. interior angles at each vertex-on-point) add to a circle (360 degrees).\n\nIf such are the conditions, then the triangle would have a "vertex-on-point" angle of 60 degrees; while the pentagon will possess 108 degrees. This brings to a total of 168 degrees and a remaining of 192 degrees to fill up.\n\nConsidering this, it is impossible to obtain a single regular polygon with such an interior angle.\n\nNow to consider multiple polygons to fill up this space..\n\nThe regular polygon with the least number of sides is an equilateral triangle (already in question). This has 60 degrees for its interior angle, also its angle of vertex-on-point.\n\nYou'll realise as you increase the number of sides, the interior angles will be as follows:\n n -->> angle (in degrees)\n==========================\n 3 -->> 60\n 4 -->> 90\n 5 -->> 108\n 6 -->> 120\n 7 -->> 128.6\n 8 -->> 135\n 9 -->> 140\n 10 -->> 144\nand so on..\n\nAs you'll realise, the trend is that the angle sizes increase with the number of sides.\n\nNotice how from these figures that it is impossible to obtain a combination that totals to 192 degrees? (Note: I've not worked on this conjecture to prove that it holds true for all of n)\n\nSo since that there is no such single polygon with an angle-on-point value of 192 and that no multiple combinations of polygons can add up to that figure, does this hold true that a point fill set cannot have both a triangle and a pentagon? I think so.\n\nI sincerely hope that the above has helped in aiding your understanding of the question.
366847
An eleven sided polygon is called a hendecagon or also an undecagon.\n\nHendecagon is derived from the Greek word hendeca meaning eleven.
943665
this is impossible to answer, there are many shapes that could be made this way.  do you have any other information like right angles or angles at corners?
266464
http://www.mathleague.com/help/geometry/polygons.htm
210942
() vs )(\n\nhow would something be quasi concave