|
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 given polyhedron has an ideal version, in polynomial time. Eve ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Hyperbolic Octahedron
Hyperbolic is an adjective describing something that resembles or pertains to a hyperbola (a curve), to hyperbole (an overstatement or exaggeration), or to hyperbolic geometry. The following phenomena are described as ''hyperbolic'' because they manifest hyperbolas, not because something about them is exaggerated. * Hyperbolic angle, an unbounded variable referring to a hyperbola instead of a circle * Hyperbolic coordinates, location by geometric mean and hyperbolic angle in quadrant I *Hyperbolic distribution, a probability distribution characterized by the logarithm of the probability density function being a hyperbola * Hyperbolic equilibrium point, a fixed point that does not have any center manifolds * Hyperbolic function, an analog of an ordinary trigonometric or circular function * Hyperbolic geometric graph, a random network generated by connecting nearby points sprinkled in a hyperbolic space * Hyperbolic geometry, a non-Euclidean geometry * Hyperbolic group, a finitely ... [...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 affine 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. A half-space may be specified by a linear inequality, derived from the linear equation that specifies the defin ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
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] |
Ideal Triangle
In hyperbolic geometry an ideal triangle is a hyperbolic triangle whose three vertices all are ideal points. Ideal triangles are also sometimes called ''triply asymptotic triangles'' or ''trebly asymptotic triangles''. The vertices are sometimes called ideal vertices. All ideal triangles are congruent. Properties Ideal triangles have the following properties: * All ideal triangles are congruent to each other. * The interior angles of an ideal triangle are all zero. * An ideal triangle has infinite perimeter. * An ideal triangle is the largest possible triangle in hyperbolic geometry. In the standard hyperbolic plane (a surface where the constant Gaussian curvature is −1) we also have the following properties: * Any ideal triangle has area π. Distances in an ideal triangle * The inscribed circle to an ideal triangle has radius r=\ln\sqrt = \frac \ln 3 = \operatorname\frac = 2 \operatorname(2- \sqrt) = = \operatorname\frac\sqrt = \operatorname\frac\sqrt ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Simplicial Polytope
In geometry, a simplicial polytope is a polytope whose facets are all simplices. For example, a ''simplicial polyhedron'' in three dimensions contains only triangular facesPolyhedra, Peter R. Cromwell, 1997. (p.341) and corresponds via Steinitz's theorem to a maximal planar graph. They are topologically dual to simple polytopes. Polytopes which are both simple and simplicial are either simplices or two-dimensional polygons. Examples Simplicial polyhedra include: * Bipyramids * Gyroelongated dipyramids *Deltahedra (equilateral triangles) ** Platonic *** tetrahedron, octahedron, icosahedron ** Johnson solids: ***triangular bipyramid, pentagonal bipyramid, snub disphenoid, triaugmented triangular prism, gyroelongated square dipyramid * Catalan solids: ** triakis tetrahedron, triakis octahedron, tetrakis hexahedron, disdyakis dodecahedron, triakis icosahedron, pentakis dodecahedron, disdyakis triacontahedron Simplicial tilings: * Regular: ** triangular tiling *Laves tilings: ... [...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 polyhedron 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] |
K-vertex-connected Graph
In graph theory, a connected graph is said to be -vertex-connected (or -connected) if it has more than vertices and remains 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. Complete graphs are not included in this version of the definition since they cannot be disconnected by deleting vertices. The complete graph with ''n'' vertices has connectivity ''n'' − 1, as implied by the first definition. An equivalent definition is that a graph with at least two vertices is ''k''-connected if, for every pair of its vertices, it is possible to find ''k'' vertex-independent paths connecting these vertices; see Menger's theorem . This definition produces the same ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Triakis Tetrahedron
In geometry, a triakis tetrahedron (or kistetrahedron) is a Catalan solid with 12 faces. Each Catalan solid is the dual of an Archimedean solid. The dual of the triakis tetrahedron is the truncated tetrahedron. The triakis tetrahedron can be seen as a tetrahedron with a triangular pyramid added to each face; that is, it is the Kleetope of the tetrahedron. It is very similar to the net for the 5-cell, as the net for a tetrahedron is a triangle with other triangles added to each edge, the net for the 5-cell a tetrahedron with pyramids attached to each face. This interpretation is expressed in the name. The length of the shorter edges is that of the longer edges. If the triakis tetrahedron has shorter edge length 1, it has area and volume . Cartesian coordinates Cartesian coordinates for the 8 vertices of a triakis tetrahedron centered at the origin, are the points (±5/3, ±5/3, ±5/3) with an even number of minus signs, along with the points (±1, ±1, ±1) with an odd numb ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Rhombic Dodecahedron
In geometry, the rhombic dodecahedron is a convex polyhedron with 12 congruent rhombic faces. It has 24 edges, and 14 vertices of 2 types. It is a Catalan solid, and the dual polyhedron of the cuboctahedron. Properties The rhombic dodecahedron is a zonohedron. Its polyhedral dual is the cuboctahedron. The long face-diagonal length is exactly times the short face-diagonal length; thus, the acute angles on each face measure arccos(), or approximately 70.53°. Being the dual of an Archimedean polyhedron, the rhombic dodecahedron is face-transitive, meaning the symmetry group of the solid acts transitively on its set of faces. In elementary terms, this means that for any two faces A and B, there is a rotation or reflection of the solid that leaves it occupying the same region of space while moving face A to face B. The rhombic dodecahedron can be viewed as the convex hull of the union of the vertices of a cube and an octahedron. The 6 vertices where 4 rhombi meet correspond t ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
