Concept

Octadecagon

Related concepts (13)
2 31 polytope
DISPLAYTITLE:2 31 polytope In 7-dimensional geometry, 231 is a uniform polytope, constructed from the E7 group. Its Coxeter symbol is 231, describing its bifurcating Coxeter-Dynkin diagram, with a single ring on the end of the 2-node branch. The rectified 231 is constructed by points at the mid-edges of the 231. These polytopes are part of a family of 127 (or 27−1) convex uniform polytopes in 7-dimensions, made of uniform polytope facets and vertex figures, defined by all permutations of rings in this Coxeter-Dynkin diagram: .
3 21 polytope
DISPLAYTITLE:3 21 polytope In 7-dimensional geometry, the 321 polytope is a uniform 7-polytope, constructed within the symmetry of the E7 group. It was discovered by Thorold Gosset, published in his 1900 paper. He called it an 7-ic semi-regular figure. Its Coxeter symbol is 321, describing its bifurcating Coxeter-Dynkin diagram, with a single ring on the end of one of the 3-node sequences. The rectified 321 is constructed by points at the mid-edges of the 321. The birectified 321 is constructed by points at the triangle face centers of the 321.
Neusis construction
In 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.
Nonagon
In geometry, a nonagon (ˈnɒnəgɒn) or enneagon (ˈɛniəɡɒn) is a nine-sided polygon or 9-gon. The name nonagon is a prefix hybrid formation, from Latin (nonus, "ninth" + gonon), used equivalently, attested already in the 16th century in French nonogone and in English from the 17th century. The name enneagon comes from Greek enneagonon (εννεα, "nine" + γωνον (from γωνία = "corner")), and is arguably more correct, though less common than "nonagon". A regular nonagon is represented by Schläfli symbol {9} and has internal angles of 140°.
Digon
In 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.
Constructible polygon
In 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 trisection
Angle 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.
Geometry
Geometry (; ) is a branch of mathematics concerned with properties of space such as the distance, shape, size, and relative position of figures. Geometry is, along with arithmetic, one of the oldest branches of mathematics. A mathematician who works in the field of geometry is called a geometer. Until the 19th century, geometry was almost exclusively devoted to Euclidean geometry, which includes the notions of point, line, plane, distance, angle, surface, and curve, as fundamental concepts.
Isogonal figure
In geometry, a polytope (e.g. a polygon or polyhedron) or a tiling is isogonal or vertex-transitive if all its vertices are equivalent under the symmetries of the figure. This implies that each vertex is surrounded by the same kinds of face in the same or reverse order, and with the same angles between corresponding faces. Technically, one says that for any two vertices there exists a symmetry of the polytope mapping the first isometrically onto the second.

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.