Point groups in three dimensions
In geometry, a point group in three dimensions is an isometry group in three dimensions that leaves the origin fixed, or correspondingly, an isometry group of a sphere. It is a subgroup of the orthogonal group O, the group of all isometries that leave the origin fixed, or correspondingly, the group of orthogonal matrices. O itself is a subgroup of the Euclidean group E of all isometries. Symmetry groups of objects are isometry groups. Accordingly, analysis of isometry groups is analysis of possible symmetries. All isometries of a bounded 3D object have one or more common fixed points. We choose the origin as one of them; the symmetry group of an object is sometimes called full symmetry group, as opposed to its rotation group or proper symmetry group, the intersection of its full symmetry group and the rotation group SO of the 3D space itself. The rotation group of an object is equal to its full symmetry group if and only if the object is chiral; the point groups in three dimensions are used in chemistry to describe the symmetries of a molecule and of molecular orbitals forming covalent bonds, in this context they are called molecular point groups.
Finite Coxeter groups are a special set of point groups generated purely by a set of reflectional mirrors passing through the same point. A rank n Coxeter group is represented by a Coxeter -- Dynkin diagram. Coxeter notation offers a bracketed notation equivalent to the Coxeter diagram, with markup symbols for rotational and other subsymmetry point groups. SO is a subgroup of E +, which consists of i.e. isometries preserving orientation. O is the direct product of SO and the group generated by inversion: O = SO × Thus there is a 1-to-1 correspondence between all direct isometries and all indirect isometries, through inversion. There is a 1-to-1 correspondence between all groups of direct isometries H in O and all groups K of isometries in O that contain inversion: K = H × H = K ∩ SOFor instance, if H is C2 K is C2h, or if H is C3 K is S6. If a group of direct isometries H has a subgroup L of index 2 apart from the corresponding group containing inversion there is a corresponding group that contains indirect isometries but no inversion: M = L ∪ where isometry is identified with A.
An example would be C4 for H and S4 for M. Thus M is obtained from H by inverting the isometries in H ∖ L; this group M is as abstract group isomorphic with H. Conversely, for all isometry groups that contain indirect isometries but no inversion we can obtain a rotation group by inverting the indirect isometries; this is clarifying when see below. In 2D the cyclic group of k-fold rotations Ck is for every positive integer k a normal subgroup of O and SO. Accordingly, in 3D, for every axis the cyclic group of k-fold rotations about that axis is a normal subgroup of the group of all rotations about that axis. Since any subgroup of index two is normal, the group of rotations is normal both in the group obtained by adding reflections in planes through the axis and in the group obtained by adding a reflection plane perpendicular to the axis; the isometries of R3 that leave the origin fixed, forming the group O, can be categorized as follows: SO: identity rotation about an axis through the origin by an angle not equal to 180° rotation about an axis through the origin by an angle of 180° the same with inversion, i.e. respectively: inversion rotation about an axis by an angle not equal to 180°, combined with reflection in the plane through the origin perpendicular to the axis reflection in a plane through the originThe 4th and 5th in particular, in a wider sense the 6th are called improper rotations.
See the similar overview including translations. When comparing the symmetry type of two objects, the origin is chosen for each separately, i.e. they need not have the same center. Moreover, two objects are considered to be of the same symmetry type if their symmetry groups are conjugate subgroups of O. For example, two 3D objects have the same symmetry type: if both have mirror symmetry, but with respect to a different mirror plane if both have 3-fold rotational symmetry, but with respect to a different axis. In the case of multiple mirror planes and/or axes of rotation, two symmetry groups are of the same symmetry type if and only if there is a rotation mapping the whole structure of the first symmetry group to that of the second; the conjugacy definition would allow a mirror image of the structure, but this is not needed, the structure itself is achiral. For example, if a symmetry group contains a 3-fold axis of rotation, it contains rotations in two opposite directions. There are many infinite isometry groups.
We may create non-cyclical abelian groups by adding more rotations around the same axis. There are non-abelian groups generated by rotations around different axes; these are free groups. They will be infinite. All the infinite groups mentioned so far are not closed as topological subgroups of O. We now discuss
Wallpaper group
A wallpaper group is a mathematical classification of a two-dimensional repetitive pattern, based on the symmetries in the pattern. Such patterns occur in architecture and decorative art in textiles and tiles as well as wallpaper. A proof that there were only 17 distinct groups of possible patterns was first carried out by Evgraf Fedorov in 1891 and derived independently by George Pólya in 1924; the proof that the list of wallpaper groups was complete only came after the much harder case of space groups had been done. The seventeen possible wallpaper groups are listed below in § The seventeen groups. Wallpaper groups are two-dimensional symmetry groups, intermediate in complexity between the simpler frieze groups and the three-dimensional space groups. Wallpaper groups categorize patterns by their symmetries. Subtle differences may place similar patterns in different groups, while patterns that are different in style, scale or orientation may belong to the same group. Consider the following examples: Examples A and B have the same wallpaper group.
Example C has a different wallpaper group, called p4g or 4*2. The fact that A and B have the same wallpaper group means that they have the same symmetries, regardless of details of the designs, whereas C has a different set of symmetries despite any superficial similarities. A symmetry of a pattern is, loosely speaking, a way of transforming the pattern so that it looks the same after the transformation. For example, translational symmetry is present when the pattern can be translated some finite distance and appear unchanged. Think of shifting a set of vertical stripes horizontally by one stripe; the pattern is unchanged. Speaking, a true symmetry only exists in patterns that repeat and continue indefinitely. A set of only, five stripes does not have translational symmetry—when shifted, the stripe on one end "disappears" and a new stripe is "added" at the other end. In practice, classification is applied to finite patterns, small imperfections may be ignored. Sometimes two categorizations are meaningful, one based on shapes alone and one including colors.
When colors are ignored there may be more symmetry. In black and white there are 17 wallpaper groups; the types of transformations that are relevant here are called Euclidean plane isometries. For example: If we shift example B one unit to the right, so that each square covers the square, adjacent to it the resulting pattern is the same as the pattern we started with; this type of symmetry is called a translation. Examples A and C are similar. If we turn example B clockwise by 90°, around the centre of one of the squares, again we obtain the same pattern; this is called a rotation. Examples A and C have 90° rotations, although it requires a little more ingenuity to find the correct centre of rotation for C. We can flip example B across a horizontal axis that runs across the middle of the image; this is called a reflection. Example B has reflections across a vertical axis, across two diagonal axes; the same can be said for A. However, example C is different, it only has reflections in vertical directions, not across diagonal axes.
If we flip across a diagonal line, we do not get the same pattern back. This is part of the reason that the wallpaper group of A and B is different from the wallpaper group of C. Another transformation is "Glide", a combination of reflection and translation parallel to the line of reflection. Mathematically, a wallpaper group or plane crystallographic group is a type of topologically discrete group of isometries of the Euclidean plane that contains two linearly independent translations. Two such isometry groups are of the same type if they are the same up to an affine transformation of the plane, thus e.g. a translation of the plane does not affect the wallpaper group. The same applies for a change of angle between translation vectors, provided that it does not add or remove any symmetry. Unlike in the three-dimensional case, we can equivalently restrict the affine transformations to those that preserve orientation, it follows from the Bieberbach theorem that all wallpaper groups are different as abstract groups.
2D patterns with double translational symmetry can be categorized according to their symmetry group type. Isometries of the Euclidean plane fall into four categories. Translations, denoted by Tv, where v is a vector in R2; this has the effect of shifting the plane applying displacement vector v. Rotations, denoted by Rc,θ, where c is a point in the plane, θ is the angle of rotation. Reflections, or mirror isometries, denoted by FL, where L is a line in R2.. This has the effect of reflecting the plane in the line L, called the reflection axis or the associated mirror. Glide reflections, denoted by GL,d, where L is a line in R2 and d is a distance; this is a combination of a reflection in the line L and a translation along L by a distance d. The condition
Triangle
A triangle is a polygon with three edges and three vertices. It is one of the basic shapes in geometry. A triangle with vertices A, B, C is denoted △ A B C. In Euclidean geometry any three points, when non-collinear, determine a unique triangle and a unique plane. In other words, there is only one plane that contains that triangle, every triangle is contained in some plane. If the entire geometry is only the Euclidean plane, there is only one plane and all triangles are contained in it; this article is about triangles in Euclidean geometry, in particular, the Euclidean plane, except where otherwise noted. Triangles can be classified according to the lengths of their sides: An equilateral triangle has all sides the same length. An equilateral triangle is a regular polygon with all angles measuring 60°. An isosceles triangle has two sides of equal length. An isosceles triangle has two angles of the same measure, namely the angles opposite to the two sides of the same length; some mathematicians define an isosceles triangle to have two equal sides, whereas others define an isosceles triangle as one with at least two equal sides.
The latter definition would make all equilateral triangles isosceles triangles. The 45–45–90 right triangle, which appears in the tetrakis square tiling, is isosceles. A scalene triangle has all its sides of different lengths. Equivalently, it has all angles of different measure. Hatch marks called tick marks, are used in diagrams of triangles and other geometric figures to identify sides of equal lengths. A side can be marked with a pattern of short line segments in the form of tally marks. In a triangle, the pattern is no more than 3 ticks. An equilateral triangle has the same pattern on all 3 sides, an isosceles triangle has the same pattern on just 2 sides, a scalene triangle has different patterns on all sides since no sides are equal. Patterns of 1, 2, or 3 concentric arcs inside the angles are used to indicate equal angles. An equilateral triangle has the same pattern on all 3 angles, an isosceles triangle has the same pattern on just 2 angles, a scalene triangle has different patterns on all angles since no angles are equal.
Triangles can be classified according to their internal angles, measured here in degrees. A right triangle has one of its interior angles measuring 90°; the side opposite to the right angle is the longest side of the triangle. The other two sides are called the catheti of the triangle. Right triangles obey the Pythagorean theorem: the sum of the squares of the lengths of the two legs is equal to the square of the length of the hypotenuse: a2 + b2 = c2, where a and b are the lengths of the legs and c is the length of the hypotenuse. Special right triangles are right triangles with additional properties that make calculations involving them easier. One of the two most famous is the 3–4–5 right triangle, where 32 + 42 = 52. In this situation, 3, 4, 5 are a Pythagorean triple; the other one is an isosceles triangle. Triangles that do not have an angle measuring 90° are called oblique triangles. A triangle with all interior angles measuring less than 90° is an acute triangle or acute-angled triangle.
If c is the length of the longest side a2 + b2 > c2, where a and b are the lengths of the other sides. A triangle with one interior angle measuring more than 90° is an obtuse triangle or obtuse-angled triangle. If c is the length of the longest side a2 + b2 < c2, where a and b are the lengths of the other sides. A triangle with an interior angle of 180° is degenerate. A right degenerate triangle has collinear vertices. A triangle that has two angles with the same measure has two sides with the same length, therefore it is an isosceles triangle, it follows that in a triangle where all angles have the same measure, all three sides have the same length, such a triangle is therefore equilateral. Triangles are assumed to be two-dimensional plane figures. In rigorous treatments, a triangle is therefore called a 2-simplex. Elementary facts about triangles were presented by Euclid in books 1–4 of his Elements, around 300 BC; the sum of the measures of the interior angles of a triangle in Euclidean space is always 180 degrees.
This fact is equivalent to Euclid's parallel postulate. This allows determination of the measure of the third angle of any triangle given the measure of two angles. An exterior angle of a triangle is an angle, a linear pair to an interior angle; the measure of an exterior angle of a triangle is equal to the sum of the measures of the two interior angles that are not adjacent to it. The sum of the measures of the three exterior angles of any triangle is 360 degrees. Two triangles are said to be similar if every angle of one triangle has the same measure as the corresponding angle in the other triangle; the corresponding sides of similar triangles have lengths that are in the same proportion, this property is sufficient to establish similarity. Some basic theorems about similar triangles are: If and only if one pair of internal angles of two triangles have the sam
Rhombitrihexagonal tiling
In geometry, the rhombitrihexagonal tiling is a semiregular tiling of the Euclidean plane. There are one triangle, two squares, one hexagon on each vertex, it has Schläfli symbol of rr. John Conway calls it a rhombihexadeltille, it can be considered a cantellated by Norman Johnson's terminology or an expanded hexagonal tiling by Alicia Boole Stott's operational language. There are 3 regular and 8 semiregular tilings in the plane. There is only one uniform coloring in a rhombitrihexagonal tiling. With edge-colorings there is a half symmetry form orbifold notation; the hexagons can be considered as t with two types of edges. It has Coxeter diagram, Schläfli symbol s2; the bicolored square can be distorted into isosceles trapezoids. In the limit, where the rectangles degenerate into edges, a triangular tiling results, constructed as a snub triangular tiling. There is one related 2-uniform tiling; the rhombitrihexagonal tiling is related to the truncated trihexagonal tiling by replacing some of the hexagons and surrounding squares and triangles with dodecagons: The tiling can be replaced by circular edges, centered on the hexagons as a overlapping circles grid.
In quilting it is call Jacks chain. The rhombitrihexagonal tiling can be used as a circle packing, placing equal diameter circles at the center of every point; every circle is in contact with 4 other circles in the packing. The translational lattice domain contains 6 distinct circles. There are eight uniform tilings. Drawing the tiles colored as red on the original faces, yellow at the original vertices, blue along the original edges, there are 8 forms, 7 which are topologically distinct; this tiling is topologically related as a part of sequence of cantellated polyhedra with vertex figure, continues as tilings of the hyperbolic plane. These vertex-transitive figures have reflectional symmetry; the deltoidal trihexagonal tiling is a dual of the semiregular tiling known as the rhombitrihexagonal tiling. Conway calls it a tetrille; the edges of this tiling can be formed by the intersection overlay of the regular triangular tiling and a hexagonal tiling. Each kite face of this tiling has angles 120°, 90°, 60° and 90°.
It is one of only eight tilings of the plane in which every edge lies on a line of symmetry of the tiling. The deltoidal trihexagonal tiling is a dual of the semiregular tiling rhombitrihexagonal tiling, its faces are kites. It is one including the regular duals; this tiling has face transitive variations, that can distort the kites into bilateral trapezoids or more general quadrillaterals. Ignoring the face colors below, the symmetry is p6m, the lower symmetry is p31m with 3 mirrors meeting at a point, 3-fold rotation points; this tiling is related to the trihexagonal tiling by dividing the triangles and hexagons into central triangles and merging neighboring triangles into kites. The deltoidal trihexagonal tiling is a part of a set of uniform dual tilings, corresponding to the dual of the rhombitrihexagonal tiling; this tiling is topologically related as a part of sequence of tilings with face configurations V3.4.n.4, continues as tilings of the hyperbolic plane. These face-transitive figures have reflectional symmetry.
Other deltoidal tilings are possible. Point symmetry allows the plane to be filled by growing kites, with the topology as a square tiling, V4.4.4.4, can be created by crossing string of a dream catcher. Below is an example with dihedral hexagonal symmetry. Another face transitive tiling with kite faces a topological variation of a square tiling and with face configuration V4.4.4.4. It is vertex transitive, with every vertex containing all orientations of the kite face. Tilings of regular polygons List of uniform tilings Branko. C.. Tilings and Patterns. New York: W. H. Freeman. ISBN 0-7167-1193-1. CS1 maint: Multiple names: authors list Williams, Robert; the Geometrical Foundation of Natural Structure: A Source Book of Design. Dover Publications, Inc. ISBN 0-486-23729-X. P40 John H. Conway, Heidi Burgiel, Chaim Goodman-Strass, The Symmetries of Things 2008, ISBN 978-1-56881-220-5 (Chapter 21, Naming Archimedean and Catalan polyhedra and tilings. Weisstein, Eric W. "Uniform tessellation". MathWorld. Weisstein, Eric W. "Semiregular tessellation".
MathWorld. Klitzing, Richard. "2D Euclidean tilings x3o6x - rothat - O8". Keith Critchlow, Order in Space: A design source book, 1970, p. 69-61, Pattern N, Dual p. 77-76, pattern 2 Dale Seymour and Jill Britton, Introduction to Tessellations, 1989, ISBN 978-0866514613, pp. 50–56, dual p. 116
Circle packing
This article describes the packing of circles on surfaces. For the related article on circle packing with a prescribed intersection graph, please see the circle packing theorem. In geometry, circle packing is the study of the arrangement of circles on a given surface such that no overlapping occurs and so that all circles touch one another; the associated packing density, η, of an arrangement is the proportion of the surface covered by the circles. Generalisations can be made to higher dimensions – this is called sphere packing, which deals only with identical spheres. While the circle has a low maximum packing density of 0.9069 on the Euclidean plane, it does not have the lowest possible. The "worst" shape to pack onto a plane is not known, but the smoothed octagon has a packing density of about 0.902414, the lowest maximum packing density known of any centrally-symmetric convex shape. Packing densities of concave shapes such as star polygons can be arbitrarily small; the branch of mathematics known as "circle packing" is concerned with the geometry and combinatorics of packings of arbitrarily-sized circles: these give rise to discrete analogs of conformal mapping, Riemann surfaces and the like.
In two dimensional Euclidean space, Joseph Louis Lagrange proved in 1773 that the highest-density lattice arrangement of circles is the hexagonal packing arrangement, in which the centres of the circles are arranged in a hexagonal lattice, each circle is surrounded by 6 other circles. The density of this arrangement is η h = π 3 6 ≈ 0.9069. Hexagonal packing of equal circles was found to fill a fraction Pi/Sqrt ≃ 0.91 of area—which was proved maximal for periodic packings by Carl Friedrich Gauss in 1831. Axel Thue provided the first proof that this was optimal in 1890, showing that the hexagonal lattice is the densest of all possible circle packings, both regular and irregular. However, his proof was considered by some to be incomplete; the first rigorous proof is attributed to László Fejes Tóth in 1940. At the other extreme, Böröczky demonstrated that arbitrarily low density arrangements of rigidly packed circles exist. There are 11 circle packings based on the 11 uniform tilings of the plane.
In these packings, every circle can be mapped to every other circle by rotations. The hexagonal gaps can be filled by one circle and the dodecagonal gaps can be filled with 7 circles, creating 3-uniform packings; the truncated trihexagonal tiling with both types of gaps can be filled as a 4-uniform packing. The snub hexagonal tiling has two mirror-image forms. A related problem is to determine the lowest-energy arrangement of identically interacting points that are constrained to lie within a given surface; the Thomson problem deals with the lowest energy distribution of identical electric charges on the surface of a sphere. The Tammes problem is a generalisation of this, dealing with maximising the minimum distance between circles on sphere; this is analogous to distributing non-point charges on a sphere. Packing circles in simple bounded shapes is a common type of problem in recreational mathematics; the influence of the container walls is important, hexagonal packing is not optimal for small numbers of circles.
There are a range of problems which permit the sizes of the circles to be non-uniform. One such extension is to find the maximum possible density of a system with two specific sizes of circle. Only nine particular radius ratios permit compact packing, when every pair of circles in contact is in mutual contact with two other circles. For seven of these radius ratios a compact packing is known that achieves the maximum possible packing fraction for mixtures of discs with that radius ratio. All nine have ratio-specific packings denser than the uniform triangular packing, as do some radius ratios without compact packingsIt is known that if the radius ratio is above 0.742, a binary mixture cannot pack better than uniformly-sized discs. Upper bounds for the density that can be obtained in such binary packings at smaller ratios have been obtained. Quadrature amplitude modulation is based on packing circles into circles within a phase-amplitude space. A modem transmits data as a series of points in a 2-dimensional phase-amplitude plane.
The spacing between the points determines the noise tolerance of the transmission, while the circumscribing circle diameter determines the transmitter power required. Performance is maximized when the constellation of code points are at the centres of an efficient circle packing. In practice, suboptimal rectangular packings are used to simplify decoding. Circle packing has become an essential tool in origami design, as each appendage on an origami figure requires a circle of paper. Robert J. Lang has used the mathematics of circle packing to develop computer programs that aid in the design of complex origami figures. Apollonian gasket Circle packing in a square Circle packing in a circle Inversive distance Kepler conjecture Malfatti circles Packing problem Wells D; the Penguin Dictionary of Curious and Interesting Geometry. New York: Penguin Books. Pp. 30–31, 167. ISBN 0-14-011813-6. Stephenson, Kenneth. "Circle Packing: A Mathematical Tale". Notices of the American Mathematical Society. 50
Rhombille tiling
In geometry, the rhombille tiling known as tumbling blocks, reversible cubes, or the dice lattice, is a tessellation of identical 60° rhombi on the Euclidean plane. Each rhombus has two 120 ° angles. Sets of three rhombi meet at their 120° angles and sets of six rhombi meet at their 60° angles; the rhombille tiling can be seen as a subdivision of a hexagonal tiling with each hexagon divided into three rhombi meeting at the center point of the hexagon. This subdivision represents a regular compound tiling, it can be seen as a subdivision of four hexagonal tilings with each hexagon divided into 12 rhombi. The diagonals of each rhomb are in the ratio 1:√3; this is the dual tiling of the trihexagonal kagome lattice. As the dual to a uniform tiling, it is one of eleven possible Laves tilings, in the face configuration for monohedral tilings it is denoted, it is one of 56 possible isohedral tilings by quadrilaterals, one of only eight tilings of the plane in which every edge lies on a line of symmetry of the tiling.
It is possible to embed the rhombille tiling into a subset of a three-dimensional integer lattice, consisting of the points with |x + y + z| ≤ 1, in such a way that two vertices are adjacent if and only if the corresponding lattice points are at unit distance from each other, more such that the number of edges in the shortest path between any two vertices of the tiling is the same as the Manhattan distance between the corresponding lattice points. Thus, the rhombille tiling can be viewed as an example of an infinite unit distance graph and partial cube; the rhombille tiling can be interpreted as an isometric projection view of a set of cubes in two different ways, forming a reversible figure related to the Necker Cube. In this context it is known as the "reversible cubes" illusion. In the M. C. Escher artworks Metamorphosis I, Metamorphosis II, Metamorphosis III Escher uses this interpretation of the tiling as a way of morphing between two- and three-dimensional forms. In another of his works, Escher played with the tension between the two-dimensionality and three-dimensionality of this tiling: in it he draws a building that has both large cubical blocks as architectural elements and an upstairs patio tiled with the rhombille tiling.
A human figure descends from the patio past the cubes, becoming more stylized and two-dimensional as he does so. These works involve only a single three-dimensional interpretation of the tiling, but in Convex and Concave Escher experiments with reversible figures more and includes a depiction of the reversible cubes illusion on a flag within the scene; the rhombille tiling is used as a design for parquetry and for floor or wall tiling, sometimes with variations in the shapes of its rhombi. It appears in ancient Greek floor mosaics from Delos and from Italian floor tilings from the 11th century, although the tiles with this pattern in Siena Cathedral are of a more recent vintage. In quilting, it has been known since the 1850s as the "tumbling blocks" pattern, referring to the visual dissonance caused by its doubled three-dimensional interpretation; as a quilting pattern it has many other names including cubework, heavenly stairs, Pandora's box. It has been suggested that the tumbling blocks quilt pattern was used as a signal in the Underground Railroad: when slaves saw it hung on a fence, they were to box up their belongings and escape.
See Quilts of the Underground Railroad. In these decorative applications, the rhombi may appear in multiple colors, but are given three levels of shading, brightest for the rhombs with horizontal long diagonals and darker for the rhombs with the other two orientations, to enhance their appearance of three-dimensionality. There is a single known instance of implicit rhombille and trihexagonal tiling in English heraldry – in the Geal/e arms; the rhombille tiling may be viewed as the result of overlaying two different hexagonal tilings, translated so that some of the vertices of one tiling land at the centers of the hexagons of the other tiling. Thus, it can be used to define block cellular automata in which the cells of the automaton are the rhombi of a rhombille tiling and the blocks in alternating steps of the automaton are the hexagons of the two overlaid hexagonal tilings. In this context, it is called the "Q*bert neighborhood", after the video game Q*bert which featured an isometric view of a pyramid of cubes as its playing field.
The Q*bert neighborhood may be used to support universal computation via a simulation of billiard ball computers. In condensed matter physics, the rhombille tiling is known as the dice lattice, diced lattice, or dual kagome lattice, it is one of several repeating structures used to investigate Ising models and related systems of spin interactions in diatomic crystals, it has been studied in percolation theory. The rhombille tiling has *632 symmetry, but vertices can be colored with alternating colors on the inner points leading to a *333 symmetry; the rhombille tiling is the dual of the trihexagonal tiling, as such is part of a set of uniform dual tilings. It is a part of a sequence of rhombic polyhedra and tilings with Coxeter group symmetry, starting from the cube, which can be seen as a rhombic hexahedron where the rhombi are squares; the nth element in this sequence has a face configuration of V3.n.3.n. The rhombille tiling is one of many different ways of tiling the plane by congruent rhombi.
Others include a diagonally flattened variation of the square tiling, the tiling used by the Miura-ori folding pattern, the Penrose tiling which
Dual polyhedron
In geometry, any polyhedron is associated with a second dual figure, where the vertices of one correspond to the faces of the other and the edges between pairs of vertices of one correspond to the edges between pairs of faces of the other. Such dual figures remain combinatorial or abstract polyhedra, but not all are geometric polyhedra. Starting with any given polyhedron, the dual of its dual is the original polyhedron. Duality preserves the symmetries of a polyhedron. Therefore, for many classes of polyhedra defined by their symmetries, the duals belong to a symmetric class. Thus, the regular polyhedra – the Platonic solids and Kepler–Poinsot polyhedra – form dual pairs, where the regular tetrahedron is self-dual; the dual of an isogonal polyhedron, having equivalent vertices, is one, isohedral, having equivalent faces. The dual of an isotoxal polyhedron is isotoxal. Duality is related to reciprocity or polarity, a geometric transformation that, when applied to a convex polyhedron, realizes the dual polyhedron as another convex polyhedron.
There are many kinds of duality. The kinds most relevant to elementary polyhedra are polar reciprocity and topological or abstract duality; the duality of polyhedra is defined in terms of polar reciprocation about a concentric sphere. Here, each vertex is associated with a face plane so that the ray from the center to the vertex is perpendicular to the plane, the product of the distances from the center to each is equal to the square of the radius. In coordinates, for reciprocation about the sphere x 2 + y 2 + z 2 = r 2, the vertex is associated with the plane x 0 x + y 0 y + z 0 z = r 2; the vertices of the dual are the poles reciprocal to the face planes of the original, the faces of the dual lie in the polars reciprocal to the vertices of the original. Any two adjacent vertices define an edge, these will reciprocate to two adjacent faces which intersect to define an edge of the dual; this dual pair of edges are always orthogonal to each other. If r 0 is the radius of the sphere, r 1 and r 2 the distances from its centre to the pole and its polar, then: r 1.
R 2 = r 0 2 For the more symmetrical polyhedra having an obvious centroid, it is common to make the polyhedron and sphere concentric, as in the Dorman Luke construction described below. However, it is possible to reciprocate a polyhedron about any sphere, the resulting form of the dual will depend on the size and position of the sphere; the choice of center for the sphere is sufficient to define the dual up to similarity. If multiple symmetry axes are present, they will intersect at a single point, this is taken to be the centroid. Failing that, a circumscribed sphere, inscribed sphere, or midsphere is used. If a polyhedron in Euclidean space has an element passing through the center of the sphere, the corresponding element of its dual will go to infinity. Since Euclidean space never reaches infinity, the projective equivalent, called extended Euclidean space, may be formed by adding the required'plane at infinity'; some theorists prefer to say that there is no dual. Meanwhile, Wenninger found a way to represent these infinite duals, in a manner suitable for making models.
The concept of duality here is related to the duality in projective geometry, where lines and edges are interchanged. Projective polarity works well enough for convex polyhedra, but for non-convex figures such as star polyhedra, when we seek to rigorously define this form of polyhedral duality in terms of projective polarity, various problems appear. Because of the definitional issues for geometric duality of non-convex polyhedra, Grünbaum argues that any proper definition of a non-convex polyhedron should include a notion of a dual polyhedron. Any convex polyhedron can be distorted into a canonical form, in which a unit midsphere exists tangent to every edge, such that the average position of the points of tangency is the center of the sphere; this form is unique up to congruences. If we reciprocate such a canonical polyhedron about its midsphere, the dual polyhedron will share the same edge-tangency points and so must be canonical, it is the canonical dual, the two together form a canonical dual pair.
When a pair of polyhedra cannot be obtained by reciprocation from each other, they may be called duals of each other as long as the vertices of one correspond to the faces of the other, the edges of one correspond to the edges of the other, in an incidence-preserving way. Such pairs of polyhedra are abstractly dual; the vertices and edges of a convex polyhedron form a graph, embedded on a topological sphere, the surface of the polyhedron. The same graph can be projected to form