In geometry, a dodecagon, or 12-gon, is any twelve-sided polygon.
A regular dodecagon is a figure with sides of the same length and internal angles of the same size. It has twelve lines of reflective symmetry and rotational symmetry of order 12. A regular dodecagon is represented by the Schläfli symbol {12} and can be constructed as a truncated hexagon, t{6}, or a twice-truncated triangle, tt{3}. The internal angle at each vertex of a regular dodecagon is 150°.
The area of a regular dodecagon of side length a is given by:
And in terms of the apothem r (see also inscribed figure), the area is:
In terms of the circumradius R, the area is:
The span S of the dodecagon is the distance between two parallel sides and is equal to twice the apothem. A simple formula for area (given side length and span) is:
This can be verified with the trigonometric relationship:
The perimeter of a regular dodecagon in terms of circumradius is:
The perimeter in terms of apothem is:
This coefficient is double the coefficient found in the apothem equation for area.
As 12 = 22 × 3, regular dodecagon is constructible using compass-and-straightedge construction:
Coxeter states that every zonogon (a 2m-gon whose opposite sides are parallel and of equal length) can be dissected into m(m-1)/2 parallelograms.
In particular this is true for regular polygons with evenly many sides, in which case the parallelograms are all rhombi. For the regular dodecagon, m=6, and it can be divided into 15: 3 squares, 6 wide 30° rhombs and 6 narrow 15° rhombs. This decomposition is based on a Petrie polygon projection of a 6-cube, with 15 of 240 faces. The sequence OEIS sequence defines the number of solutions as 908, including up to 12-fold rotations and chiral forms in reflection.
One of the ways the mathematical manipulative pattern blocks are used is in creating a number of different dodecagons. They are related to the rhombic dissections, with 3 60° rhombi merged into hexagons, half-hexagon trapezoids, or divided into 2 equilateral triangles.
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.
In geometry, a uniform polytope of dimension three or higher is a vertex-transitive polytope bounded by uniform facets. The uniform polytopes in two dimensions are the regular polygons (the definition is different in 2 dimensions to exclude vertex-transitive even-sided polygons that alternate two different lengths of edges). This is a generalization of the older category of semiregular polytopes, but also includes the regular polytopes. Further, star regular faces and vertex figures (star polygons) are allowed, which greatly expand the possible solutions.
In geometry, a uniform polyhedron has regular polygons as faces and is vertex-transitive (i.e., there is an isometry mapping any vertex onto any other). It follows that all vertices are congruent. Uniform polyhedra may be regular (if also face- and edge-transitive), quasi-regular (if also edge-transitive but not face-transitive), or semi-regular (if neither edge- nor face-transitive). The faces and vertices need not be convex, so many of the uniform polyhedra are also star polyhedra.
In geometry, a skew polygon is a polygon whose vertices are not all coplanar. Skew polygons must have at least four vertices. The interior surface (or area) of such a polygon is not uniquely defined. Skew infinite polygons (apeirogons) have vertices which are not all colinear. A zig-zag skew polygon or antiprismatic polygon has vertices which alternate on two parallel planes, and thus must be even-sided. Regular skew polygons in 3 dimensions (and regular skew apeirogons in two dimensions) are always zig-zag.
Ce cours entend exposer les fondements de la géométrie à un triple titre :
1/ de technique mathématique essentielle au processus de conception du projet,
2/ d'objet privilégié des logiciels de concept
Squall is a scalable online query engine that runs complex analytics in a cluster using skew-resilient, adaptive operators. Online processing implies that results are incrementally built as the input arrives, and it is ubiquitous for many applications such ...
Recently, we have proposed a novel family of bivariate, non-separable splines. These splines, called "hexsplines" have been designed to deal with hexagonally sampled data. Incorporating the shape of the Voronoi cell of a hexagonal lattice, they preserve th ...
NuHAG2003
, ,
Although the grain refinement of yellow gold alloys with Jr has been used in industry and known for nearly half a century, the basic mechanism is still unknown. The present contribution shows that the mechanism is the same as that evidenced recently in Al- ...