Search results
Results from the WOW.Com Content Network
In geometry, a hendecagon (also undecagon [1] [2] or endecagon [3]) or 11-gon is an eleven-sided polygon. (The name hendecagon, from Greek hendeka "eleven" and –gon "corner", is often preferred to the hybrid undecagon, whose first part is formed from Latin undecim "eleven". [4])
These segments are called its edges or sides, and the points where two of the edges meet are the polygon's vertices (singular: vertex) or corners. The word polygon comes from Late Latin polygōnum (a noun), from Greek πολύγωνον ( polygōnon/polugōnon ), noun use of neuter of πολύγωνος ( polygōnos/polugōnos , the masculine ...
Hexagram – star polygon with 6 sides Star of David (example) Heptagram – star polygon with 7 sides; Octagram – star polygon with 8 sides Star of Lakshmi (example) Enneagram - star polygon with 9 sides; Decagram - star polygon with 10 sides; Hendecagram - star polygon with 11 sides; Dodecagram - star polygon with 12 sides; Apeirogon ...
As with all odd regular polygons and star polygons whose orders are not products of distinct Fermat primes, the regular hendecagrams cannot be constructed with compass and straightedge. [4] However, Hilton & Pedersen (1986) describe folding patterns for making the hendecagrams {11/3}, {11/4}, and {11/5} out of strips of paper. [5]
In geometry, a polygon (/ ˈ p ɒ l ɪ ɡ ɒ n /) is a plane figure made up of line segments connected to form a closed polygonal chain. The segments of a closed polygonal chain are called its edges or sides. The points where two edges meet are the polygon's vertices or corners. An n-gon is a polygon with n sides; for example, a triangle is a 3 ...
3.11 Other. 3.12 Regular and ... A polytope is a geometric object with flat sides, which exists in any general number of dimensions. The following list of polygons, ...
The 5 Platonic solids are called a tetrahedron, hexahedron, octahedron, dodecahedron and icosahedron with 4, 6, 8, 12, and 20 sides respectively. The regular hexahedron is a cube . Table of polyhedra
A triangulated polygon with 11 vertices: 11 sides and 8 diagonals form 9 triangles. Every simple polygon can be partitioned into non-overlapping triangles by a subset of its diagonals. When the polygon has n {\displaystyle n} sides, this produces n − 2 {\displaystyle n-2} triangles, separated by n − 3 {\displaystyle n-3} diagonals.