Neusis constructionIn geometry, the neusis (νεῦσις; ; plural: neuseis) is a geometric construction method that was used in antiquity by Greek mathematicians. The neusis construction consists of fitting a line element of given length (a) in between two given lines (l and m), in such a way that the line element, or its extension, passes through a given point P. That is, one end of the line element has to lie on l, the other end on m, while the line element is "inclined" towards P.
Uniform polytopeIn 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.
Dual polygonIn geometry, polygons are associated into pairs called duals, where the vertices of one correspond to the edges of the other. Regular polygons are self-dual. The dual of an isogonal (vertex-transitive) polygon is an isotoxal (edge-transitive) polygon. For example, the (isogonal) rectangle and (isotoxal) rhombus are duals. In a cyclic polygon, longer sides correspond to larger exterior angles in the dual (a tangential polygon), and shorter sides to smaller angles.
Isotoxal figureIn geometry, a polytope (for example, a polygon or a polyhedron) or a tiling is isotoxal () or edge-transitive if its symmetries act transitively on its edges. Informally, this means that there is only one type of edge to the object: given two edges, there is a translation, rotation, and/or reflection that will move one edge to the other while leaving the region occupied by the object unchanged. An isotoxal polygon is an even-sided i.e. equilateral polygon, but not all equilateral polygons are isotoxal.
Skew polygonIn 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.
DigonIn geometry, a digon is a polygon with two sides (edges) and two vertices. Its construction is degenerate in a Euclidean plane because either the two sides would coincide or one or both would have to be curved; however, it can be easily visualised in elliptic space. A regular digon has both angles equal and both sides equal and is represented by Schläfli symbol {2}. It may be constructed on a sphere as a pair of 180 degree arcs connecting antipodal points, when it forms a lune. The digon is the simplest abstract polytope of rank 2.
HeptagonIn geometry, a heptagon or septagon is a seven-sided polygon or 7-gon. The heptagon is sometimes referred to as the septagon, using "sept-" (an elision of septua-, a Latin-derived numerical prefix, rather than hepta-, a Greek-derived numerical prefix; both are cognate) together with the Greek suffix "-agon" meaning angle. A regular heptagon, in which all sides and all angles are equal, has internal angles of 5π/7 radians (128 degrees). Its Schläfli symbol is {7}.
Constructible polygonIn mathematics, a constructible polygon is a regular polygon that can be constructed with compass and straightedge. For example, a regular pentagon is constructible with compass and straightedge while a regular heptagon is not. There are infinitely many constructible polygons, but only 31 with an odd number of sides are known. Some regular polygons are easy to construct with compass and straightedge; others are not.
Angle trisectionAngle trisection is a classical problem of straightedge and compass construction of ancient Greek mathematics. It concerns construction of an angle equal to one third of a given arbitrary angle, using only two tools: an unmarked straightedge and a compass. In 1837, Pierre Wantzel proved that the problem, as stated, is impossible to solve for arbitrary angles. However, some special angles can be trisected: for example, it is trivial to trisect a right angle (that is, to construct an angle of 30 degrees).
Truncation (geometry)In geometry, a truncation is an operation in any dimension that cuts polytope vertices, creating a new facet in place of each vertex. The term originates from Kepler's names for the Archimedean solids. In general any polyhedron (or polytope) can also be truncated with a degree of freedom as to how deep the cut is, as shown in Conway polyhedron notation truncation operation. A special kind of truncation, usually implied, is a uniform truncation, a truncation operator applied to a regular polyhedron (or regular polytope) which creates a resulting uniform polyhedron (uniform polytope) with equal edge lengths.
