|
Ideal Polyhedron
In three-dimensional hyperbolic geometry, an ideal polyhedron is a convex polyhedron all of whose vertices are ideal points, points "at infinity" rather than interior to three-dimensional hyperbolic space. It can be defined as the convex hull of a finite set of ideal points. An ideal polyhedron has ideal polygons as its faces, meeting along lines of the hyperbolic space. The Platonic solids and Archimedean solids have ideal versions, with the same combinatorial structure as their more familiar Euclidean versions. Several uniform hyperbolic honeycombs divide hyperbolic space into cells of these shapes, much like the familiar division of Euclidean space into cubes. However, not all polyhedra can be represented as ideal polyhedra – a polyhedron can be ideal only when it can be represented in Euclidean geometry with all its vertices on a circumscribed sphere. Using linear programming, it is possible to test whether a polyhedron has an ideal version, in polynomial time. Every tw ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Regular Octahedron
In geometry, a regular octahedron is a Platonic solid composed of eight equilateral triangles, four of which meet at each vertex. Regular octahedra occur in nature as crystal structures. An octahedron, more generally, can be any eight-sided polyhedron; many types of irregular octahedra also exist. A regular octahedron is convex, meaning that for any two points within it, the line segment connecting them lies entirely within it. It is one of the eight convex deltahedra because all of the faces are equilateral triangles. It is a composite polyhedron made by attaching two equilateral square pyramids. Its dual polyhedron is the cube, and they have the same three-dimensional symmetry groups, the octahedral symmetry \mathrm_\mathrm . A regular octahedron is a special case of an octahedron, any eight-sided polyhedron. It is the three-dimensional case of the more general concept of a cross-polytope. As a Platonic solid The regular octahedron is one of the Platonic solids, a s ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Linear Programming
Linear programming (LP), also called linear optimization, is a method to achieve the best outcome (such as maximum profit or lowest cost) in a mathematical model whose requirements and objective are represented by linear function#As a polynomial function, linear relationships. Linear programming is a special case of mathematical programming (also known as mathematical optimization). More formally, linear programming is a technique for the mathematical optimization, optimization of a linear objective function, subject to linear equality and linear inequality Constraint (mathematics), constraints. Its feasible region is a convex polytope, which is a set defined as the intersection (mathematics), intersection of finitely many Half-space (geometry), half spaces, each of which is defined by a linear inequality. Its objective function is a real number, real-valued affine function, affine (linear) function defined on this polytope. A linear programming algorithm finds a point in the po ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Miquel's Six Circles Theorem
Miquel's theorem is a result in geometry, named after Auguste Miquel, concerning the intersection of three circles, each drawn through one vertex of a triangle and two points on its adjacent sides. It is one of several results concerning circles in Euclidean geometry due to Miquel, whose work was published in Liouville's newly founded journal ''Journal de mathématiques pures et appliquées''. Formally, let ''ABC'' be a triangle, with arbitrary points ''A´'', ''B´'' and ''C´'' on sides ''BC'', ''AC'', and ''AB'' respectively (or their extensions). Draw three circumcircles (Miquel's circles) to triangles ''AB´C´'', ''A´BC´'', and ''A´B´C''. Miquel's theorem states that these circles intersect in a single point ''M'', called the Miquel point. In addition, the three angles ''MA´B'', ''MB´C'' and ''MC´A'' (green in the diagram) are all equal, as are the three supplementary angles ''MA´C'', ''MB´A'' and ''MC´B''. - Wells refers to Miquel's theorem as the pivot theorem ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Simple Polytope
In geometry, a -dimensional simple polytope is a -dimensional polytope each of whose vertices are adjacent to exactly edges (also facets). The vertex figure of a simple -polytope is a -simplex. Simple polytopes are topologically dual to simplicial polytopes. The family of polytopes which are both simple and simplicial are simplices or two-dimensional polygons. A ''simple polyhedron'' is a three-dimensional polyhedron whose vertices are adjacent to three edges and three faces. The dual to a simple polyhedron is a ''simplicial polyhedron'', in which all faces are triangles. Examples Three-dimensional simple polyhedra include the prisms (including the cube), the regular tetrahedron and dodecahedron, and, among the Archimedean solids, the truncated tetrahedron, truncated cube, truncated octahedron, truncated cuboctahedron, truncated dodecahedron, truncated icosahedron, and truncated icosidodecahedron. They also include the Goldberg polyhedra and fullerenes, including the ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Truncation (geometry)
In geometry, a truncation is an operation in any dimension that cuts polytope vertices, creating a new Facet (geometry), facet in place of each vertex. The term originates from Kepler's names for the Archimedean solids. Uniform truncation 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. There are no degrees of freedom, and it represents a fixed geometric, just like the regular polyhedra. In general all single ringed uniform polytopes have a uniform truncation. For example, the icosidodecahedron, represented as Schläfli symbols r or \begin 5 \\ 3 \end, and Coxeter-Dynkin diagram or has a uniform truncation, the truncate ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Tetrakis Hexahedron
In geometry, a tetrakis hexahedron (also known as a tetrahexahedron, hextetrahedron, tetrakis cube, and kiscube) is a Catalan solid. Its dual is the truncated octahedron, an Archimedean solid. It can be called a disdyakis hexahedron or hexakis tetrahedron as the dual of an omnitruncated tetrahedron, and as the barycentric subdivision of a tetrahedron. As a Kleetope The name "tetrakis" is used for the Kleetopes of polyhedra with square faces. Hence, the tetrakis hexahedron can be considered as a cube with square pyramids covering each square face, the Kleetope of the cube. The resulting construction can be either convex or non-convex, depending on the square pyramids' height. For the convex result, it comprises twenty-four isosceles triangles. A non-convex form of this shape, with equilateral triangle faces, has the same surface geometry as the regular octahedron, and a paper octahedron model can be re-folded into this shape. This form of the tetrakis hexahedron was illustr ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
K-vertex-connected Graph
In graph theory, a connected Graph (discrete mathematics), graph is said to be -vertex-connected (or -connected) if it has more than Vertex (graph theory), vertices and remains Connectivity (graph theory), connected whenever fewer than vertices are removed. The vertex-connectivity, or just connectivity, of a graph is the largest for which the graph is -vertex-connected. Definitions A graph (other than a complete graph) has connectivity ''k'' if ''k'' is the size of the smallest subset of vertices such that the graph becomes disconnected if you delete them. In complete graphs, there is no subset whose removal would disconnect the graph. Some sources modify the definition of connectivity to handle this case, by defining it as the size of the smallest subset of vertices whose deletion results in either a disconnected graph or a single vertex. For this variation, the connectivity of a complete graph K_n is n-1. An equivalent definition is that a graph with at least two vertic ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Triakis Tetrahedron
In geometry, a triakis tetrahedron (or tristetrahedron, or kistetrahedron) is a solid constructed by attaching four triangular pyramids onto the triangular faces of a regular tetrahedron, a Kleetope of a tetrahedron. This replaces the equilateral triangular faces of the regular tetrahedron with three Isosceles triangle, isosceles triangles at each face, so there are twelve in total; eight vertices and eighteen edges form them. This interpretation is also expressed in the name, triakis, which is used for Kleetopes of polyhedra with triangular faces. The triakis tetrahedron is a Catalan solid, the dual polyhedron of a truncated tetrahedron, an Archimedean solid with four hexagonal and four triangular faces, constructed by cutting off the vertices of a regular tetrahedron; it shares the same Tetrahedral symmetry, symmetry of full tetrahedral \mathrm_\mathrm . Each dihedral angle between triangular faces is \arccos(-7/11) \approx 129.52^\circ. Unlike its dual, the truncated tetrahed ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Rhombic Dodecahedron
In geometry, the rhombic dodecahedron is a Polyhedron#Convex_polyhedra, convex polyhedron with 12 congruence (geometry), congruent rhombus, rhombic face (geometry), faces. It has 24 edge (geometry), edges, and 14 vertex (geometry), vertices of 2 types. As a Catalan solid, it is the dual polyhedron of the cuboctahedron. As a parallelohedron, the rhombic dodecahedron can be used to Honeycomb (geometry), tesselate its copies in space creating a rhombic dodecahedral honeycomb. There are some variations of the rhombic dodecahedron, one of which is the Bilinski dodecahedron. There are some stellations of the rhombic dodecahedron, one of which is the Escher's solid. The rhombic dodecahedron may also appear in nature (such as in the garnet crystal), the architectural philosophies, practical usages, and toys. As a Catalan solid Metric properties The rhombic dodecahedron is a polyhedron with twelve rhombus, rhombi, each of which long face-diagonal length is exactly \sqrt times the sho ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Catalan Solid
The Catalan solids are the dual polyhedron, dual polyhedra of Archimedean solids. The Archimedean solids are thirteen highly-symmetric polyhedra with regular faces and symmetric vertices. The faces of the Catalan solids correspond by duality to the vertices of Archimedean solids, and vice versa. One way to construct the Catalan solids is by using the Dorman Luke construction. The Catalan solids are face-transitive or ''isohedral'' meaning that their faces are symmetric to one another, but they are not vertex-transitive because their vertices are not symmetric. Their dual, the Archimedean solids, are vertex-transitive but not face-transitive. Each Catalan solid has constant dihedral angles, meaning the angle between any two adjacent faces is the same. Additionally, two Catalan solids, the rhombic dodecahedron and rhombic triacontahedron, are edge-transitive, meaning their edges are symmetric to each other. Some Catalan solids were discovered by Johannes Kepler during his study of ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Isogonal Figure
In geometry, a polytope (e.g. a polygon or polyhedron) or a Tessellation, tiling is isogonal or vertex-transitive if all its vertex (geometry), vertices are equivalent under the Symmetry, symmetries of the figure. This implies that each vertex is surrounded by the same kinds of face (geometry), face in the same or reverse order, and with the same Dihedral angle, angles between corresponding faces. Technically, one says that for any two vertices there exists a symmetry of the polytope Map (mathematics), mapping the first isometry, isometrically onto the second. Other ways of saying this are that the automorphism group, group of automorphisms of the polytope ''Group action#Remarkable properties of actions, acts transitively'' on its vertices, or that the vertices lie within a single ''symmetry orbit''. All vertices of a finite -dimensional isogonal figure exist on an n-sphere, -sphere. The term isogonal has long been used for polyhedra. Vertex-transitive is a synonym borrowed fro ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Half-space (geometry)
In geometry, a half-space is either of the two parts into which a plane divides the three-dimensional Euclidean space. If the space is two-dimensional, then a half-space is called a ''half-plane'' (open or closed). A half-space in a one-dimensional space is called a ''half-line'' or ray''.'' More generally, a half-space is either of the two parts into which a hyperplane divides an n-dimensional space. That is, the points that are not incident to the hyperplane are partitioned into two convex sets (i.e., half-spaces), such that any subspace connecting a point in one set to a point in the other must intersect the hyperplane. A half-space can be either ''open'' or ''closed''. An open half-space is either of the two open sets produced by the subtraction of a hyperplane from the affine space. A closed half-space is the union of an open half-space and the hyperplane that defines it. The open (closed) ''upper half-space'' is the half-space of all (''x''1, ''x''2, ..., ''x''''n'') suc ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
