|
Bilinski Dodecahedron
In geometry, the Bilinski dodecahedron is a Convex set, convex polyhedron with twelve Congruence (geometry), congruent golden rhombus faces. It has the same topology as the face-transitive rhombic dodecahedron, but a different geometry. It is a parallelohedron, a polyhedron that can Honeycomb (geometry), tile space with translated copies of itself. History This shape appears in a 1752 book by John Lodge Cowley, labeled as the dodecarhombus. It is named after Stanko Bilinski, who rediscovered it in 1960. Bilinski himself called it the rhombic dodecahedron of the second kind.. Bilinski's discovery corrected a 75-year-old omission in Evgraf Fedorov's classification of convex polyhedra with congruent Rhombus, rhombic faces. Definition and properties Definition The Bilinski dodecahedron is formed by gluing together twelve Congruence (geometry), congruent Golden rhombus, golden rhombi. These are Rhombus, rhombi whose diagonals are in the golden ratio: :\varphi = \approx 1.618~034 . T ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Stanko Bilinski
Stanko Bilinski (22 April 1909 in Našice – 6 April 1998 in Zagreb) was a Croatian mathematician and academician. He was a professor at the University of Zagreb and a fellow of the Croatian Academy of Sciences and Arts. In 1960, he discovered a rhombic dodecahedron of the second kind, the Bilinski dodecahedron In geometry, the Bilinski dodecahedron is a Convex set, convex polyhedron with twelve Congruence (geometry), congruent golden rhombus faces. It has the same topology as the face-transitive rhombic dodecahedron, but a different geometry. It is a .... Like the standard rhombic dodecahedron, this convex polyhedron has 12 congruent rhombus sides, but they are differently shaped and arranged. Bilinski's discovery corrected a 75-year-old omission in Evgraf Fedorov's classification of convex polyhedra with congruent rhombic faces.. References Further reading * * 1909 births 1998 deaths Croatian mathematicians Academic staff of the University of Zagreb Membe ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Golden Rhombus
In geometry, a golden rhombus is a rhombus whose diagonals are in the golden ratio: : = \varphi = \approx 1.618~034 Equivalently, it is the Varignon parallelogram formed from the edge midpoints of a golden rectangle. Rhombi with this shape form the faces of several notable polyhedra. The golden rhombus should be distinguished from the two rhombi of the Penrose tiling, which are both related in other ways to the golden ratio but have different shapes than the golden rhombus. Angles (See the characterizations and the basic properties of the general rhombus for angle properties.) The internal supplementary angles of the golden rhombus are:. See in particular table 1, p. 188. *Acute angle: \alpha=2\arctan ; :by using the arctangent addition formula (see inverse trigonometric functions): :\alpha=\arctan=\arctan=\arctan2\approx63.43495^\circ. : *Obtuse angle: \beta=2\arctan\varphi=\pi-\arctan2\approx116.56505^\circ, :which is also the dihedral angle of the dodecahedron. ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Zonohedron
In geometry, a zonohedron is a convex polyhedron that is point symmetry, centrally symmetric, every face of which is a polygon that is centrally symmetric (a zonogon). Any zonohedron may equivalently be described as the Minkowski addition, Minkowski sum of a set of line segments in three-dimensional space, or as a three-dimensional Projection (mathematics), projection of a hypercube. Zonohedra were originally defined and studied by Evgraf Stepanovich Fyodorov, E. S. Fedorove, a Russian Crystallography, crystallographer. More generally, in any dimension, the Minkowski sum of line segments forms a polytope known as a zonotope. Zonohedra that tile space The original motivation for studying zonohedra is that the Voronoi diagram of any Lattice (group), lattice forms a convex uniform honeycomb in which the cells are zonohedra. Any zonohedron formed in this way can Honeycomb (geometry), tessellate 3-dimensional space and is called a primary parallelohedron. Each primary parallelohedron ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Affine Transformation
In Euclidean geometry, an affine transformation or affinity (from the Latin, '' affinis'', "connected with") is a geometric transformation that preserves lines and parallelism, but not necessarily Euclidean distances and angles. More generally, an affine transformation is an automorphism of an affine space (Euclidean spaces are specific affine spaces), that is, a function which maps an affine space onto itself while preserving both the dimension of any affine subspaces (meaning that it sends points to points, lines to lines, planes to planes, and so on) and the ratios of the lengths of parallel line segments. Consequently, sets of parallel affine subspaces remain parallel after an affine transformation. An affine transformation does not necessarily preserve angles between lines or distances between points, though it does preserve ratios of distances between points lying on a straight line. If is the point set of an affine space, then every affine transformation on can ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Space-filling Polyhedron
In geometry, a space-filling polyhedron is a polyhedron that can be used to fill all of three-dimensional space via translations, rotations and/or reflections, where ''filling'' means that; taken together, all the instances of the polyhedron constitute a partition of three-space. Any periodic tiling or honeycomb of three-space can in fact be generated by translating a primitive cell polyhedron. If a polygon can tile the plane, its prism is space-filling; examples include the cube, triangular prism, and the hexagonal prism. Any parallelepiped tessellates Euclidean 3-space, as do the five parallelohedra including the cube, hexagonal prism, truncated octahedron, and rhombic dodecahedron. Other space-filling polyhedra include the pyramid, plesiohedra and stereohedra, polyhedra whose tilings have symmetries taking every tile to every other tile, including the gyrobifastigium, the triakis truncated tetrahedron, and the trapezo-rhombic dodecahedron. The cube is the ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Graph Isomorphism
In graph theory, an isomorphism of graphs ''G'' and ''H'' is a bijection between the vertex sets of ''G'' and ''H'' : f \colon V(G) \to V(H) such that any two vertices ''u'' and ''v'' of ''G'' are adjacent in ''G'' if and only if f(u) and f(v) are adjacent in ''H''. This kind of bijection is commonly described as "edge-preserving bijection", in accordance with the general notion of isomorphism being a structure-preserving bijection. If an isomorphism exists between two graphs, then the graphs are called isomorphic, often denoted by G\simeq H. In the case when the isomorphism is a mapping of a graph onto itself, i.e., when ''G'' and ''H'' are one and the same graph, the isomorphism is called an automorphism of ''G''. Graph isomorphism is an equivalence relation on graphs and as such it partitions the class of all graphs into equivalence classes. A set of graphs isomorphic to each other is called an isomorphism class of graphs. The question of whether graph isomorphism can be dete ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Right-handed Coordinate System (y To Back)
In geometry, a Cartesian coordinate system (, ) in a plane is a coordinate system In geometry, a coordinate system is a system that uses one or more numbers, or coordinates, to uniquely determine and standardize the position of the points or other geometric elements on a manifold such as Euclidean space. The coordinates are ... that specifies each point (geometry), point uniquely by a pair of real numbers called ''coordinates'', which are the positive and negative numbers, signed distances to the point from two fixed perpendicular oriented lines, called ''coordinate lines'', ''coordinate axes'' or just ''axes'' (plural of ''axis'') of the system. The point where the axes meet is called the ''Origin (mathematics), origin'' and has as coordinates. The axes direction (geometry), directions represent an orthogonal basis. The combination of origin and basis forms a coordinate frame called the Cartesian frame. Similarly, the position of any point in three-dimensional space can ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Cartesian Coordinates
In geometry, a Cartesian coordinate system (, ) in a plane is a coordinate system that specifies each point uniquely by a pair of real numbers called ''coordinates'', which are the signed distances to the point from two fixed perpendicular oriented lines, called '' coordinate lines'', ''coordinate axes'' or just ''axes'' (plural of ''axis'') of the system. The point where the axes meet is called the '' origin'' and has as coordinates. The axes directions represent an orthogonal basis. The combination of origin and basis forms a coordinate frame called the Cartesian frame. Similarly, the position of any point in three-dimensional space can be specified by three ''Cartesian coordinates'', which are the signed distances from the point to three mutually perpendicular planes. More generally, Cartesian coordinates specify the point in an -dimensional Euclidean space for any dimension . These coordinates are the signed distances from the point to mutually perpendicular fixed h ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Degree (graph Theory)
In graph theory, the degree (or valency) of a vertex of a graph is the number of edges that are incident to the vertex; in a multigraph, a loop contributes 2 to a vertex's degree, for the two ends of the edge. The degree of a vertex v is denoted \deg(v) or \deg v. The maximum degree of a graph G is denoted by \Delta(G), and is the maximum of G's vertices' degrees. The minimum degree of a graph is denoted by \delta(G), and is the minimum of G's vertices' degrees. In the multigraph shown on the right, the maximum degree is 5 and the minimum degree is 0. In a regular graph, every vertex has the same degree, and so we can speak of ''the'' degree of the graph. A complete graph (denoted K_n, where n is the number of vertices in the graph) is a special kind of regular graph where all vertices have the maximum possible degree, n-1. In a signed graph, the number of positive edges connected to the vertex v is called positive deg(v) and the number of connected negative edges is enti ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
