HOME
*



picture info

Triaugmented Triangular Prism
The triaugmented triangular prism, in geometry, is a convex polyhedron with 14 equilateral triangles as its faces. It can be constructed from a triangular prism by attaching equilateral square pyramids to each of its three square faces. The same shape is also called the tetrakis triangular prism, tricapped trigonal prism, tetracaidecadeltahedron, or tetrakaidecadeltahedron; these last names mean a polyhedron with 14 triangular faces. It is an example of a deltahedron and of a Johnson solid. The edges and vertices of the triaugmented triangular prism form a maximal planar graph with 9 vertices and 21 edges, called the Fritsch graph. It was used by Rudolf and Gerda Fritsch to show that Alfred Kempe's attempted proof of the four color theorem was incorrect. The Fritsch graph is one of only six graphs in which every neighborhood is a 4- or 5-vertex cycle. The dual polyhedron of the triaugmented triangular prism is an associahedron, a polyhedron with four quadrilateral faces and six ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Deltahedron
In geometry, a deltahedron (plural ''deltahedra'') is a polyhedron whose face (geometry), faces are all equilateral triangles. The name is taken from the Greek language, Greek upper case delta (letter), delta (Δ), which has the shape of an equilateral triangle. There are infinitely many deltahedra, all having an even number of faces by the handshaking lemma. Of these only eight are Convex polyhedron, convex, having 4, 6, 8, 10, 12, 14, 16 and 20 faces. The number of faces, edges, and vertex (geometry), vertices is listed below for each of the eight convex deltahedra. The eight convex deltahedra There are only eight strictly-convex deltahedra: three are regular polyhedra, and five are Johnson solids. The three regular convex polyhedra are indeed Platonic solids. In the 6-faced deltahedron, some vertices have degree 3 and some degree 4. In the 10-, 12-, 14-, and 16-faced deltahedra, some vertices have degree 4 and some degree 5. These five irregular deltahedra belong to the ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Dual Polyhedron
In geometry, every polyhedron is associated with a second dual structure, 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 can also be constructed as 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 corresponding symmetry class. For example, the regular polyhedrathe (convex) Platonic solids and (star) Kepler–Poinsot polyhedraform dual pairs, where the regular tetrahedron is self-dual. The dual of an isogonal polyhedron (one in which any two vertices are equivalent under symmetries of the polyhedron) is an isohedral polyhedron (one in which any two faces are equivalent .., and vice vers ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Dihedral Angle
A dihedral angle is the angle between two intersecting planes or half-planes. In chemistry, it is the clockwise angle between half-planes through two sets of three atoms, having two atoms in common. In solid geometry, it is defined as the union of a line and two half-planes that have this line as a common edge. In higher dimensions, a dihedral angle represents the angle between two hyperplanes. The planes of a flying machine are said to be at positive dihedral angle when both starboard and port main planes (commonly called wings) are upwardly inclined to the lateral axis. When downwardly inclined they are said to be at a negative dihedral angle. Mathematical background When the two intersecting planes are described in terms of Cartesian coordinates by the two equations : a_1 x + b_1 y + c_1 z + d_1 = 0 :a_2 x + b_2 y + c_2 z + d_2 = 0 the dihedral angle, \varphi between them is given by: :\cos \varphi = \frac and satisfies 0\le \varphi \le \pi/2. Alternatively, if an ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Dihedral Group
In mathematics, a dihedral group is the group of symmetries of a regular polygon, which includes rotations and reflections. Dihedral groups are among the simplest examples of finite groups, and they play an important role in group theory, geometry, and chemistry. The notation for the dihedral group differs in geometry and abstract algebra. In geometry, or refers to the symmetries of the -gon, a group of order . In abstract algebra, refers to this same dihedral group. This article uses the geometric convention, . Definition Elements A regular polygon with n sides has 2n different symmetries: n rotational symmetries and n reflection symmetries. Usually, we take n \ge 3 here. The associated rotations and reflections make up the dihedral group \mathrm_n. If n is odd, each axis of symmetry connects the midpoint of one side to the opposite vertex. If n is even, there are n/2 axes of symmetry connecting the midpoints of opposite sides and n/2 axes of symmetry connecting oppo ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

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(3), the group of all isometries that leave the origin fixed, or correspondingly, the group of orthogonal matrices. O(3) itself is a subgroup of the Euclidean group E(3) of all isometries. Symmetry groups of geometric objects are isometry groups. Accordingly, analysis of isometry groups is analysis of possible symmetries. All isometries of a bounded (finite) 3D object have one or more common fixed points. We follow the usual convention by choosing the origin as one of them. The symmetry group of an object is sometimes also called its full symmetry group, as opposed to its proper symmetry group, the intersection of its full symmetry group with E+(3), which consists of all ''direct isometries'', i.e., isometries preserving orientation. For a bounded object, the proper sy ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Cartesian Coordinates
A Cartesian coordinate system (, ) in a plane is a coordinate system that specifies each point uniquely by a pair of numerical coordinates, which are the signed distances to the point from two fixed perpendicular oriented lines, measured in the same unit of length. Each reference coordinate line is called a ''coordinate axis'' or just ''axis'' (plural ''axes'') of the system, and the point where they meet is its ''origin'', at ordered pair . The coordinates can also be defined as the positions of the perpendicular projections of the point onto the two axes, expressed as signed distances from the origin. One can use the same principle to specify the position of any point in three-dimensional space by three Cartesian coordinates, its signed distances to three mutually perpendicular planes (or, equivalently, by its perpendicular projection onto three mutually perpendicular lines). In general, ''n'' Cartesian coordinates (an element of real ''n''-space) specify the point in an ' ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Regular Polygon
In Euclidean geometry, a regular polygon is a polygon that is Equiangular polygon, direct equiangular (all angles are equal in measure) and Equilateral polygon, equilateral (all sides have the same length). Regular polygons may be either convex polygon, convex, star polygon, star or Skew polygon, skew. In the limit (mathematics), limit, a sequence of regular polygons with an increasing number of sides approximates a circle, if the perimeter or area is fixed, or a regular apeirogon (effectively a Line (geometry), straight line), if the edge length is fixed. General properties ''These properties apply to all regular polygons, whether convex or star polygon, star.'' A regular ''n''-sided polygon has rotational symmetry of order ''n''. All vertices of a regular polygon lie on a common circle (the circumscribed circle); i.e., they are concyclic points. That is, a regular polygon is a cyclic polygon. Together with the property of equal-length sides, this implies that every regular p ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Convex Set
In geometry, a subset of a Euclidean space, or more generally an affine space over the reals, is convex if, given any two points in the subset, the subset contains the whole line segment that joins them. Equivalently, a convex set or a convex region is a subset that intersects every line into a single line segment (possibly empty). For example, a solid cube is a convex set, but anything that is hollow or has an indent, for example, a crescent shape, is not convex. The boundary of a convex set is always a convex curve. The intersection of all the convex sets that contain a given subset of Euclidean space is called the convex hull of . It is the smallest convex set containing . A convex function is a real-valued function defined on an interval with the property that its epigraph (the set of points on or above the graph of the function) is a convex set. Convex minimization is a subfield of optimization that studies the problem of minimizing convex functions over convex se ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Augmentation (geometry)
In geometry, a Johnson solid is a strictly convex polyhedron each face of which is a regular polygon. There is no requirement that each face must be the same polygon, or that the same polygons join around each vertex. An example of a Johnson solid is the square-based pyramid with equilateral sides ( ); it has 1 square face and 4 triangular faces. Some authors require that the solid not be uniform (i.e., not Platonic solid, Archimedean solid, uniform prism, or uniform antiprism) before they refer to it as a “Johnson solid”. As in any strictly convex solid, at least three faces meet at every vertex, and the total of their angles is less than 360 degrees. Since a regular polygon has angles at least 60 degrees, it follows that at most five faces meet at any vertex. The pentagonal pyramid () is an example that has a degree-5 vertex. Although there is no obvious restriction that any given regular polygon cannot be a face of a Johnson solid, it turns out that the faces of Johns ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Tammes Problem
In geometry, the Tammes problem is a problem in packing a given number of circles on the surface of a sphere such that the minimum distance between circles is maximized. It is named after the Dutch botanist Pieter Merkus Lambertus Tammes (the nephew of pioneering botanist Jantina Tammes) who posed the problem in his 1930 doctoral dissertation on the distribution of pores on pollen grains.Pieter Merkus Lambertus Tammes (1930): ''On the number and arrangements of the places of exit on the surface of pollen-grains'', University of Groningen Mathematicians independent of Tammes began studying circle packing on the sphere in the early 1940s; it was not until twenty years later that the problem became associated with his name. It can be viewed as a particular special case of the generalized Thomson problem of minimizing the total Coulomb force of electrons in a spherical arrangement. Thus far, solutions have been proven only for small numbers of circles: 3 through 14, and 24. There ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Thomson Problem
The objective of the Thomson problem is to determine the minimum electrostatic potential energy configuration of electrons constrained to the surface of a unit sphere that repel each other with a force given by Coulomb's law. The physicist J. J. Thomson posed the problem in 1904 after proposing an atomic model, later called the plum pudding model, based on his knowledge of the existence of negatively charged electrons within neutrally-charged atoms. Related problems include the study of the geometry of the minimum energy configuration and the study of the large behavior of the minimum energy. Mathematical statement The electrostatic interaction energy occurring between each pair of electrons of equal charges (e_i = e_j = e, with e the elementary charge of an electron) is given by Coulomb's Law, :U_(N)=k_\text. Here, k_\text is the Coulomb constant and r_=, \mathbf_i - \mathbf_j, is the distance between each pair of electrons located at points on the sphere defined by ve ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]