Concept

Dihedron

A dihedron is a type of polyhedron, made of two polygon faces which share the same set of n edges. In three-dimensional Euclidean space, it is degenerate if its faces are flat, while in three-dimensional spherical space, a dihedron with flat faces can be thought of as a lens, an example of which is the fundamental domain of a lens space L(p,q). Dihedra have also been called bihedra, flat polyhedra, or doubly covered polygons. As a spherical tiling, a dihedron can exist as nondegenerate form, with two n-sided faces covering the sphere, each face being a hemisphere, and vertices on a great circle. It is regular if the vertices are equally spaced. The dual of an n-gonal dihedron is an n-gonal hosohedron, where n digon faces share two vertices. A dihedron can be considered a degenerate prism whose two (planar) n-sided polygon bases are connected "back-to-back", so that the resulting object has no depth. The polygons must be congruent, but glued in such a way that one is the mirror image of the other. This applies only if the distance between the two faces is zero; for a distance larger than zero, the faces are infinite polygons (a bit like the apeirogonal hosohedron's digon faces, having a width larger than zero, are infinite stripes). Dihedra can arise from Alexandrov's uniqueness theorem, which characterizes the distances on the surface of any convex polyhedron as being locally Euclidean except at a finite number of points with positive angular defect summing to 4pi. This characterization holds also for the distances on the surface of a dihedron, so the statement of Alexandrov's theorem requires that dihedra be considered as convex polyhedra. Some dihedra can arise as lower limit members of other polyhedra families: a prism with digon bases would be a square dihedron, and a pyramid with a digon base would be a triangular dihedron. A regular dihedron, with Schläfli symbol {n,2}, is made of two regular polygons, each with Schläfli symbol {n}.

About this result
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.

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.