Polygons are unbounded because they close on themselves in a circuit. An infinite polygon goes on forever, making it unbounded. A skew polygon has three dimensions of zig-zagging and a spherical polygon, on the sphere surface, is a circuit of corners and sides.
REal answers
NO, a circle is not a polygon. A polygon is composed of a finite set of straight line segments, and a circle has NO straight line segments.
A
A semi-regular tessellation is using multiple copies of two (or more) regular polygons so as to cover a plane without gaps or overlaps. The different shapes have sides of the same length and the shapes meet at vertices in the same (or exact reverse) order.The image used with this question:http://file2.answcdn.com/answ-cld/image/upload/w_300,h_115,c_fill,g_face:center,q_60,f_jpg/v1401482497/u6cbkstcqpiibq3485hr.pnguses a regular quadrilateral (a square) and an equilateral triangle. At each vertex, these two shapes, starting with the shape at the top, meet in the following order: TSTTS ot STTST.
This is false. Every rectangle is a parallelogram, but the converse (your statement) is not true. Imagine the set of all quadrilaterals (4 sided polygons). Within that set would be sets of kites, parallelograms, and other quadrilaterals. Within the parallelogram set, would be rectangles, rhombuses and other parallelograms. Then if a rhombus is also a rectangle, it would be a square, that would be the intersection of the set of rectangles and set of rhombuses. Hope this helps.
REal answers
A set of polygons might have such shapes in it. Certainly the set of all polygons does. So does the set of all polygons with fewer than 5 sides. Many other examples could be given. I am avoiding the use of the word "group", because it has a technical meaning in modern algebra.
Infinitely many. Polygons with 6 or more sides can have 3 pairs of parallel lines. Polygons with 7 or more sides can have a set of three parallel lines.
,
generalization
Assuming its sides are all straight, divide the area into a set of individual triangles &/or other polygons, determine the area of each element then sum these.
No. While some probably don't, you can't apply such a sweeping generalization to all tourists. Tourists are people, and they each have their own set of thoughts, concerns, and opinions.
When polygons are set out on a plane they must not overlap and have no gaps
All sorts of polygons can create tessellations. See attached link for some examples: http://http://en.wikipedia.org/wiki/Tessellation
For a set with a finite number, n, of elements, the number of subsets in 2^n. This includes the null set and the set itself. Things get a bit complicated if the original set has infinitely many elements. It is still 2^k but the complications arise because of infinities and transfinite numbers.
The answer depends on which of the infinitely many possible polygons you consider to be the set of 20.
Theory is an abstract generalization that systematically explains how phenomena is interrelated, consisting of concepts and a set of propositions.