|
Alexandrov's Uniqueness Theorem
Alexandrov's theorem on polyhedra is a rigidity theorem in mathematics, describing three-dimensional convex polyhedra in terms of the distances between points on their surfaces. It implies that convex polyhedra with distinct shapes from each other also have distinct metric spaces of surface distances, and it characterizes the metric spaces that come from the surface distances on polyhedra. It is named after Soviet mathematician Aleksandr Danilovich Aleksandrov, who published it in the 1940s. Statement of the theorem The surface of any convex polyhedron in Euclidean space forms a metric space, in which the distance between two points is measured by the length of the shortest path from one point to the other along the surface. Within a single shortest path, distances between pairs of points equal the distances between corresponding points of a line segment of the same length; a path with this property is known as a geodesic. This property of polyhedral surfaces, that every pair of ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Rigidity (mathematics)
In mathematics, a rigid collection ''C'' of mathematical objects (for instance sets or functions) is one in which every ''c'' ∈ ''C'' is uniquely determined by less information about ''c'' than one would expect. The above statement does not define a mathematical property; instead, it describes in what sense the adjective "rigid" is typically used in mathematics, by mathematicians. __FORCETOC__ Examples Some examples include: #Harmonic functions on the unit disk are rigid in the sense that they are uniquely determined by their boundary values. #Holomorphic functions are determined by the set of all derivatives at a single point. A smooth function from the real line to the complex plane is not, in general, determined by all its derivatives at a single point, but it is if we require additionally that it be possible to extend the function to one on a neighbourhood of the real line in the complex plane. The Schwarz lemma is an example of such a rigidity theorem. #By the f ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Homeomorphism
In mathematics and more specifically in topology, a homeomorphism ( from Greek roots meaning "similar shape", named by Henri Poincaré), also called topological isomorphism, or bicontinuous function, is a bijective and continuous function between topological spaces that has a continuous inverse function. Homeomorphisms are the isomorphisms in the category of topological spaces—that is, they are the mappings that preserve all the topological properties of a given space. Two spaces with a homeomorphism between them are called homeomorphic, and from a topological viewpoint they are the same. Very roughly speaking, a topological space is a geometric object, and a homeomorphism results from a continuous deformation of the object into a new shape. Thus, a square and a circle are homeomorphic to each other, but a sphere and a torus are not. However, this description can be misleading. Some continuous deformations do not produce homeomorphisms, such as the deformation ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Max Dehn
Max Wilhelm Dehn (November 13, 1878 – June 27, 1952) was a German mathematician most famous for his work in geometry, topology and geometric group theory. Dehn's early life and career took place in Germany. However, he was forced to retire in 1935 and eventually fled Germany in 1939 and emigrated to the United States.The story of his travel in 1940 from Norway via Stockholm, Moscow, trans-Siberian train, Vladivostok, Japan to San Francisco is described in Dehn was a student of David Hilbert, and in his habilitation in 1900 Dehn resolved Hilbert's third problem, making him the first to resolve one of Hilbert's problems, Hilbert's well-known 23 problems. Dehn's doctoral students include Ott-Heinrich Keller, Ruth Moufang, and Wilhelm Magnus; he also mentored mathematician Peter Nemenyi and the artists Dorothea Rockburne and Ruth Asawa. Biography Dehn was born to a family of Jewish origin in Hamburg, Imperial Germany. He studied the foundations of geometry with David Hilbert, Hil ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Cauchy's Theorem (geometry)
Cauchy's theorem is a theorem in geometry, named after Augustin-Louis Cauchy, Augustin Cauchy. It states that convex polytopes in three dimensions with congruence (geometry), congruent corresponding faces must be congruent to each other. That is, any Net (polyhedron), polyhedral net formed by unfolding the faces of the polyhedron onto a flat surface, together with gluing instructions describing which faces should be connected to each other, uniquely determines the shape of the original polyhedron. For instance, if six squares are connected in the pattern of a cube, then they must form a cube: there is no convex polyhedron with six square faces connected in the same way that does not have the same shape. This is a fundamental result in rigidity theory (structural), rigidity theory: one consequence of the theorem is that, if one makes a physical model of a convex polyhedron by connecting together rigid plates for each of the polyhedron faces with flexible hinges along the polyhedron ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Pseudo-polynomial Time
In computational complexity theory, a numeric algorithm runs in pseudo-polynomial time if its running time is a polynomial in the ''numeric value'' of the input (the largest integer present in the input)—but not necessarily in the ''length'' of the input (the number of bits required to represent it), which is the case for polynomial time algorithms.Michael R. Garey and David S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, 1979. In general, the numeric value of the input is exponential in the input length, which is why a pseudo-polynomial time algorithm does not necessarily run in polynomial time with respect to the input length. An NP-complete problem with known pseudo-polynomial time algorithms is called weakly NP-complete. An NP-complete problem is called strongly NP-complete if it is proven that it cannot be solved by a pseudo-polynomial time algorithm unless . The strong/weak kinds of NP-hardness are defined ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Algorithm
In mathematics and computer science, an algorithm () is a finite sequence of Rigour#Mathematics, mathematically rigorous instructions, typically used to solve a class of specific Computational problem, problems or to perform a computation. Algorithms are used as specifications for performing calculations and data processing. More advanced algorithms can use Conditional (computer programming), conditionals to divert the code execution through various routes (referred to as automated decision-making) and deduce valid inferences (referred to as automated reasoning). In contrast, a Heuristic (computer science), heuristic is an approach to solving problems without well-defined correct or optimal results.David A. Grossman, Ophir Frieder, ''Information Retrieval: Algorithms and Heuristics'', 2nd edition, 2004, For example, although social media recommender systems are commonly called "algorithms", they actually rely on heuristics as there is no truly "correct" recommendation. As an e ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Square Pyramid
In geometry, a square pyramid is a Pyramid (geometry), pyramid with a square base and four triangles, having a total of five faces. If the Apex (geometry), apex of the pyramid is directly above the center of the square, it is a ''right square pyramid'' with four isosceles triangles; otherwise, it is an ''oblique square pyramid''. When all of the pyramid's edges are equal in length, its triangles are all equilateral triangle, equilateral. It is called an ''equilateral square pyramid'', an example of a Johnson solid. Square pyramids have appeared throughout the history of architecture, with examples being Egyptian pyramids and many other similar buildings. They also occur in chemistry in Square pyramidal molecular geometry, square pyramidal molecular structures. Square pyramids are often used in the construction of other polyhedra. Many mathematicians in ancient times discovered the formula for the volume of a square pyramid with different approaches. Special cases Right squar ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Kleetope
In geometry and polyhedral combinatorics, the Kleetope of a polyhedron or higher-dimensional convex polytope is another polyhedron or polytope formed by replacing each facet of with a pyramid. In some cases, the pyramid is chosen to have regular sides, often producing a non-convex polytope; alternatively, by using sufficiently shallow pyramids, the results may remain convex. Kleetopes are named after Victor Klee,. although the same concept was known under other names long before the work of Klee. Examples In each of these cases, the Kleetope is formed by attaching pyramids onto each face of the original polyhedron. These examples can be seen from the Platonic solids: * The triakis tetrahedron is the Kleetope of a tetrahedron, the triakis octahedron is the Kleetope of an octahedron, and the triakis icosahedron is the Kleetope of an icosahedron. These Kleetopes are formed by adding a triangular pyramid to each face of them. * The tetrakis hexahedron is the Kleetope of the cube, f ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Regular Icosahedron
The regular icosahedron (or simply ''icosahedron'') is a convex polyhedron that can be constructed from pentagonal antiprism by attaching two pentagonal pyramids with Regular polygon, regular faces to each of its pentagonal faces, or by putting points onto the cube. The resulting polyhedron has 20 equilateral triangles as its faces, 30 edges, and 12 vertices. It is an example of a Platonic solid and of a deltahedron. The icosahedral graph represents the Skeleton (topology), skeleton of a regular icosahedron. Many polyhedra are constructed from the regular icosahedron. A notable example is the stellation of regular icosahedron, which consists of 59 polyhedrons. The great dodecahedron, one of the Kepler–Poinsot polyhedra, is constructed by either stellation or faceting. Some of the Johnson solids can be constructed by removing the pentagonal pyramids. The regular icosahedron's dual polyhedron is the regular dodecahedron, and their relation has a historical background on the c ... [...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] |
Deltahedron
A deltahedron is a polyhedron whose faces are all equilateral triangles. The deltahedron was named by Martyn Cundy, after the Greek capital letter delta resembling a triangular shape Δ. Deltahedra can be categorized by the property of convexity. The simplest convex deltahedron is the regular tetrahedron, a pyramid with four equilateral triangles. There are eight convex deltahedra, which can be used in the applications of chemistry as in the polyhedral skeletal electron pair theory and chemical compounds. There are infinitely many concave deltahedra. Strictly convex deltahedron A polyhedron is said to be ''convex'' if a line between any two of its vertices lies either within its interior or on its boundary, and additionally, if no two faces are coplanar (lying in the same plane) and no two edges are collinear (segments of the same line), it can be considered as being strictly convex. Of the eight convex deltahedra, three are Platonic solids and five are Johnson solids. Th ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Dihedron
A dihedron (pl. dihedra) is a type of polyhedron, made of two polygon faces which share the same set of ''n'' edges. In three-dimensional Euclidean space, it is degenerate if its faces are flat, while in three-dimensional spherical space, a dihedron with flat faces can be thought of as a lens, an example of which is the fundamental domain of a lens space L(''p'',''q''). Dihedra have also been called bihedra, flat polyhedra, or doubly covered polygons. As a spherical tiling, a dihedron can exist as nondegenerate form, with two ''n''-sided faces covering the sphere, each face being a hemisphere, and vertices on a great circle. It is regular if the vertices are equally spaced. The dual of an ''n''-gonal dihedron is an ''n''-gonal hosohedron, where ''n'' digon faces share two vertices. As a flat-faced polyhedron A dihedron can be considered a degenerate prism whose two (planar) ''n''-sided polygon bases are connected "back-to-back", so that the resulting object has no depth. The ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
