finite polyhedron
Смотреть что такое "finite polyhedron" в других словарях:
Polyhedron — Polyhedra redirects here. For the relational database system, see Polyhedra DBMS. For the game magazine, see Polyhedron (magazine). For the scientific journal, see Polyhedron (journal). Some Polyhedra Dodecahedron (Regular polyhedron) … Wikipedia
polyhedron — /pol ee hee dreuhn/, n., pl. polyhedrons, polyhedra / dreuh/. a solid figure having many faces. See illus. under dodecahedron, icosahedron, octahedron, pentahedron, tetrahedron. [1560 70; < Gk polýedron, neut. of polýedros having many bases. See… … Universalium
Dual polyhedron — The dual of a cube is an octahedron, shown here with vertices at the cube face centers … Wikipedia
Intersection of a polyhedron with a line — In general, a convex polyhedron is defined as the intersection of a finite number of halfspaces. That is, a convex polyhedron is the set of solutions of a system of inequations of the form :Ax le b. There are many problems in which it is useful… … Wikipedia
Regular skew polyhedron — In geometry, the regular skew polyhedra are generalizations to the set of regular polyhedron which include the possibility of nonplanar faces or vertex figures.These polyhedra have two forms infinite polyhedra that span 3 space, and finite… … Wikipedia
Tessellation — A tessellation of pavement A honeycomb is an example of a t … Wikipedia
Strip algebra — is a set of elements and operators for the description of carbon nanotube structures, considered as a subgroup of polyhedra, and more precisely, of polyhedra with vertices formed by three edges. This restriction is imposed on the polyhedra… … Wikipedia
Coxeter–Dynkin diagram — See also: Dynkin diagram Coxeter Dynkin diagrams for the fundamental finite Coxeter groups … Wikipedia
Duality (mathematics) — In mathematics, a duality, generally speaking, translates concepts, theorems or mathematical structures into other concepts, theorems or structures, in a one to one fashion, often (but not always) by means of an involution operation: if the dual… … Wikipedia
Planar graph — Example graphs Planar Nonplanar Butterfly graph K5 The complete graph K4 … Wikipedia
Circle packing theorem — Example of the circle packing theorem on K5, the complete graph on five vertices, minus one edge. The circle packing theorem (also known as the Koebe–Andreev–Thurston theorem) describes the possible tangency relations between circles in the plane … Wikipedia
