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
Geometry
Geometry is a branch of mathematics concerned with questions of shape, relative position of figures, the properties of space. A mathematician who works in the field of geometry is called a geometer. Geometry arose independently in a number of early cultures as a practical way for dealing with lengths and volumes. Geometry began to see elements of formal mathematical science emerging in the West as early as the 6th century BC. By the 3rd century BC, geometry was put into an axiomatic form by Euclid, whose treatment, Euclid's Elements, set a standard for many centuries to follow. Geometry arose independently in India, with texts providing rules for geometric constructions appearing as early as the 3rd century BC. Islamic scientists expanded on them during the Middle Ages. By the early 17th century, geometry had been put on a solid analytic footing by mathematicians such as René Descartes and Pierre de Fermat. Since and into modern times, geometry has expanded into non-Euclidean geometry and manifolds, describing spaces that lie beyond the normal range of human experience.
While geometry has evolved throughout the years, there are some general concepts that are more or less fundamental to geometry. These include the concepts of points, planes, surfaces and curves, as well as the more advanced notions of manifolds and topology or metric. Geometry has applications to many fields, including art, physics, as well as to other branches of mathematics. Contemporary geometry has many subfields: Euclidean geometry is geometry in its classical sense; the mandatory educational curriculum of the majority of nations includes the study of points, planes, triangles, similarity, solid figures and analytic geometry. Euclidean geometry has applications in computer science and various branches of modern mathematics. Differential geometry uses techniques of linear algebra to study problems in geometry, it has applications in physics, including in general relativity. Topology is the field concerned with the properties of geometric objects that are unchanged by continuous mappings. In practice, this means dealing with large-scale properties of spaces, such as connectedness and compactness.
Convex geometry investigates convex shapes in the Euclidean space and its more abstract analogues using techniques of real analysis. It has close connections to convex analysis and functional analysis and important applications in number theory. Algebraic geometry studies geometry through the use of multivariate polynomials and other algebraic techniques, it has applications including cryptography and string theory. Discrete geometry is concerned with questions of relative position of simple geometric objects, such as points and circles, it shares many principles with combinatorics. Computational geometry deals with algorithms and their implementations for manipulating geometrical objects. Although being a young area of geometry, it has many applications in computer vision, image processing, computer-aided design, medical imaging, etc; the earliest recorded beginnings of geometry can be traced to ancient Mesopotamia and Egypt in the 2nd millennium BC. Early geometry was a collection of empirically discovered principles concerning lengths, angles and volumes, which were developed to meet some practical need in surveying, construction and various crafts.
The earliest known texts on geometry are the Egyptian Rhind Papyrus and Moscow Papyrus, the Babylonian clay tablets such as Plimpton 322. For example, the Moscow Papyrus gives a formula for calculating the volume of a truncated pyramid, or frustum. Clay tablets demonstrate that Babylonian astronomers implemented trapezoid procedures for computing Jupiter's position and motion within time-velocity space; these geometric procedures anticipated the Oxford Calculators, including the mean speed theorem, by 14 centuries. South of Egypt the ancient Nubians established a system of geometry including early versions of sun clocks. In the 7th century BC, the Greek mathematician Thales of Miletus used geometry to solve problems such as calculating the height of pyramids and the distance of ships from the shore, he is credited with the first use of deductive reasoning applied to geometry, by deriving four corollaries to Thales' Theorem. Pythagoras established the Pythagorean School, credited with the first proof of the Pythagorean theorem, though the statement of the theorem has a long history.
Eudoxus developed the method of exhaustion, which allowed the calculation of areas and volumes of curvilinear figures, as well as a theory of ratios that avoided the problem of incommensurable magnitudes, which enabled subsequent geometers to make significant advances. Around 300 BC, geometry was revolutionized by Euclid, whose Elements considered the most successful and influential textbook of all time, introduced mathematical rigor through the axiomatic method and is the earliest example of the format still used in mathematics today, that of definition, axiom and proof. Although most of the contents of the Elements were known, Euclid arranged them into a single, coherent logical framework; the Elements was known to all educated people in the West until the middle of the 20th century and its contents are still taught in geometry classes today. Archimedes of Syracuse used the method of exhaustion to calculate the area under the arc of a parabola with the summation of an infinite series, gave remarkably accurate approximations of Pi.
He studied the sp
Orbifold notation
In geometry, orbifold notation is a system, invented by William Thurston and popularized by the mathematician John Conway, for representing types of symmetry groups in two-dimensional spaces of constant curvature. The advantage of the notation is that it describes these groups in a way which indicates many of the groups' properties: in particular, it describes the orbifold obtained by taking the quotient of Euclidean space by the group under consideration. Groups representable in this notation include the point groups on the sphere, the frieze groups and wallpaper groups of the Euclidean plane, their analogues on the hyperbolic plane; the following types of Euclidean transformation can occur in a group described by orbifold notation: reflection through a line translation by a vector rotation of finite order around a point infinite rotation around a line in 3-space glide-reflection, i.e. reflection followed by translation. All translations which occur are assumed to form a discrete subgroup of the group symmetries being described.
Each group is denoted in orbifold notation by a finite string made up from the following symbols: positive integers 1, 2, 3, … the infinity symbol, ∞ the asterisk, * the symbol o, called a wonder and a handle because it topologically represents a torus closed surface. Patterns repeat by two translation; the symbol ×, called a miracle and represents a topological crosscap where a pattern repeats as a mirror image without crossing a mirror line. A string written in boldface represents a group of symmetries of Euclidean 3-space. A string not written in boldface represents a group of symmetries of the Euclidean plane, assumed to contain two independent translations; each symbol corresponds to a distinct transformation: an integer n to the left of an asterisk indicates a rotation of order n around a gyration point an integer n to the right of an asterisk indicates a transformation of order 2n which rotates around a kaleidoscopic point and reflects through a line an × indicates a glide reflection the symbol ∞ indicates infinite rotational symmetry around a line.
By abuse of language, we might say that such a group is a subgroup of symmetries of the Euclidean plane with only one independent translation. The frieze groups occur in this way; the exceptional symbol o indicates that there are two linearly independent translations. An orbifold symbol is called good if it is not one of the following: p, pq, *p, *pq, for p,q>=2, p≠q. An object is chiral; the corresponding orbifold is non-orientable otherwise. The Euler characteristic of an orbifold can be read from its Conway symbol; each feature has a value: n without or before an asterisk counts as n − 1 n n after an asterisk counts as n − 1 2 n asterisk and × count as 1 o counts as 2. Subtracting the sum of these values from 2 gives the Euler characteristic. If the sum of the feature values is 2, the order is infinite, i.e. the notation represents a wallpaper group or a frieze group. Indeed, Conway's "Magic Theorem" indicates that the 17 wallpaper groups are those with the sum of the feature values equal to 2.
Otherwise, the order is 2 divided by the Euler characteristic. The following groups are isomorphic: 1* and *11 22 and 221 *22 and *221 2* and 2*1; this is. The symmetry of a 2D object without translational symmetry can be described by the 3D symmetry type by adding a third dimension to the object which does not add or spoil symmetry. For example, for a 2D image we can consider a piece of carton with that image displayed on one side, thus we have n• and *n•. The bullet is added on one- and two-dimensional groups to imply the existence of a fixed point. A 1D image can be drawn horizontally on a piece of carton, with a provision to avoid additional symmetry with respect to the line of the image, e.g. by drawing a horizontal bar under the image. Thus the discrete symmetry groups in one dimension are *•, *1•, ∞• and *∞•. Another way of constructing a 3D object from a 1D or 2D object for describing the symmetry is taking the Cartesian product of the object and an asymmetric 2D or 1D object, respectively.
*Schönflies's point group notation is extended here as infinite cases of the equivalent dihedral points symmetries §The diagram shows one fundamental domain in yellow, with reflection lines in blue, glide reflection lines in dashed green, translation normals in red, 2-fold gyration points as small green squares. A first few hyperbolic groups, ordered by their Euler characteristic are: Mutation of orbifolds Fibrifold notation - an extension of orbifold notation for 3d space groups John H. Conway, Olaf Delgado Friedrichs, Daniel H. Huson, W
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
Wythoff symbol
In geometry, the Wythoff symbol represents a Wythoff construction of a uniform polyhedron or plane tiling, from a Schwarz triangle. It was first used by Coxeter, Longuet-Higgins and Miller in their enumeration of the uniform polyhedra. A Wythoff symbol consists of a vertical bar, it represents one uniform polyhedron or tiling, although the same tiling/polyhedron can have different Wythoff symbols from different symmetry generators. For example, the regular cube can be represented by 3 | 4 2 with Oh symmetry, 2 4 | 2 as a square prism with 2 colors and D4h symmetry, as well as 2 2 2 | with 3 colors and D 2 h symmetry. With a slight extension, Wythoff's symbol can be applied to all uniform polyhedra. However, the construction methods do not lead to all uniform tilings in Euclidean or hyperbolic space. In three dimensions, Wythoff's construction begins by choosing a generator point on the triangle. If the distance of this point from each of the sides is non-zero, the point must be chosen to be an equal distance from each edge.
A perpendicular line is dropped between the generator point and every face that it does not lie on. The three numbers in Wythoff's symbol, p, q and r, represent the corners of the Schwarz triangle used in the construction, which are π / p, π / q and π / r radians respectively; the triangle is represented with the same numbers, written. The vertical bar in the symbol specifies a categorical position of the generator point within the fundamental triangle according to the following: p | q r indicates that the generator lies on the corner p, p q | r indicates that the generator lies on the edge between p and q, p q r | indicates that the generator lies in the interior of the triangle. In this notation the mirrors are labeled by the reflection-order of the opposite vertex; the p, q, r values are listed before the bar. The one impossible symbol | p q r implies the generator point is on all mirrors, only possible if the triangle is degenerate, reduced to a point; this unused symbol is therefore arbitrarily reassigned to represent the case where all mirrors are active, but odd-numbered reflected images are ignored.
The resulting figure has rotational symmetry only. The generator point can either be off each mirror, activated or not; this distinction creates 8 possible forms, neglecting one where the generator point is on all the mirrors. The Wythoff symbol is functionally similar to the more general Coxeter-Dynkin diagram, in which each node represents a mirror and the arcs between them – marked with numbers – the angles between the mirrors. A node is circled. There are seven generator points with each set of p, q, r: There are three special cases: p q | – This is a mixture of p q r | and p q s |, containing only the faces shared by both. | p q r – Snub forms are given by this otherwise unused symbol. | p q r s – A unique snub form for U75 that isn't Wythoff-constructible. There are 4 symmetry classes of reflection on the sphere, three in the Euclidean plane. A few of the infinitely many such patterns in the hyperbolic plane are listed. Point groups: dihedral symmetry, p = 2, 3, 4 … tetrahedral symmetry octahedral symmetry icosahedral symmetry Euclidean groups: *442 symmetry: 45°-45°-90° triangle *632 symmetry: 30°-60°-90° triangle *333 symmetry: 60°-60°-60° triangleHyperbolic groups: *732 symmetry *832 symmetry *433 symmetry *443 symmetry *444 symmetry *542 symmetry *642 symmetry...
The above symmetry groups only include the integer solutions on the sphere. The list of Schwarz triangles includes rational numbers, determine the full set of solutions of nonconvex uniform polyhedra. In the tilings above, each triangle is a fundamental domain, colored by and odd reflections. Selected tilings created by the Wythoff con
Cairo pentagonal tiling
In geometry, the Cairo pentagonal tiling is a dual semiregular tiling of the Euclidean plane. It is given its name, it is one of 15 known monohedral pentagon tilings. It is called MacMahon's net after Percy Alexander MacMahon and his 1921 publication New Mathematical Pastimes. Conway calls it a 4-fold pentille; as a 2-dimensional crystal net, it shares a special feature with the honeycomb net. Both nets are examples of standard realization, the notion introduced by M. Kotani and T. Sunada for general crystal nets; these are not regular pentagons: their sides are not equal, their angles in sequence are 120°, 120°, 90°, 120°, 90°. It is represented by with face configuration V3.3.4.3.4. It is similar to the prismatic pentagonal tiling with face configuration V3.3.3.4.4, which has its right angles adjacent to each other. The Cairo pentagonal tiling has two lower symmetry forms given as monohedral pentagonal tilings types 4 and 8: It is the dual of the snub square tiling, made of two squares and three equilateral triangles around each vertex.
This tiling can be seen as the union of two perpendicular hexagonal tilings, flattened by a ratio of 3. Each hexagon is divided into four pentagons; the two hexagons can be distorted to be concave, leading to concave pentagons. Alternately one of the hexagonal tilings can remain regular, the second one stretched and flattened by 3 in each direction, intersecting into 2 forms of pentagons; as a dual to the snub square tiling the geometric proportions are fixed for this tiling. However it can be adjusted to other geometric forms with the same topological connectivity and different symmetry. For example, this rectangular tiling is topologically identical. Truncating the 4-valence nodes creates a form related to the Goldberg polyhedra, can be given the symbol 2,1; the pentagons are truncated into heptagons. The dual 2,1 has all triangle, related to the geodesic polyhedra, it can be seen as a snub square tiling with its squares replaced by 4 triangles. The Cairo pentagonal tiling is similar to the prismatic pentagonal tiling with face configuration V3.3.3.4.4, two 2-uniform dual tilings and 2 3-uniform duals which mix the two types of pentagons.
They are drawn here with k-isohedral pentagons. The Cairo pentagonal tiling is in a sequence of dual snub polyhedra and tilings with face configuration V3.3.4.3.n. It is in a sequence of dual snub polyhedra and tilings with face configuration V3.3.n.3.n. Tilings of regular polygons List of uniform tilings Grünbaum, 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. p. 38. ISBN 0-486-23729-X. Wells, The Penguin Dictionary of Curious and Interesting Geometry. London: Penguin, p. 23, 1991. Keith Critchlow, Order in Space: A design source book, 1970, p. 77-76, pattern 3 Weisstein, Eric W. "Cairo Tessellation". MathWorld