(redirected from Polytopes)


A finite region in n-dimensional space (n = 2, 3, 4, …), enclosed by a finite number of hyperplanes; it is the n-dimensional analog of a polygon (n = 2) and a polyhedron (n = 3).



(1) A polyhedron.

(2) A geometric figure that is the union of a finite number of convex polyhedrons of an arbitrary number of dimensions arbitrarily arranged in n-dimensional space. This concept is often made use of in topology and can easily be extended to the case of n-dimensional space.

Let us consider a half space in the n-dimensional space Rn that is, the set of all points located on one side of some in — 1)-dimensional hyperplane of the space along with the points of the hyperplane itself. Analytically, the half space is the set of all points of Rn whose coordinates satisfy a linear inequality of the form a1x1 + a2x2 + … + anxn + b ≥0. The intersection of a finite number of half spaces—if it is bounded— is the most general convex polyhedron of arbitrary dimension ≤ n located in Rn. A poly tope in the general sense of the word is the union of a finite number of such polyhedrons. When n = 2, we obtain two-dimensional polytopes, or polygons, which are not necessarily convex. One-dimensional polytopes are broken lines that need not be connected and may be branched—at any vertex any number of segments may meet. A zero-dimensional polytope is a finite set of points. A three-dimensional polytope can always be partitioned into polyhedrons of the simplest type —that is, into simplexes. Simplexes of dimension 0, 1, 2, and 3 correspond, respectively, to a point, a line segment, a triangle, and a tetrahedron, which is in general irregular. This partitioning, moreover, can be performed in such a way that either two of the resulting simplexes have no points in common or they share a face. Such partitions of a polytope into simplexes are called triangulations and constitute a fundamental research technique in combinatorial topology.

The concept of polytope permits of various generalizations. For example, curved polytopes are the images of polytopes under topological mappings; thus an arbitrary curved surface may be regarded as the topological image of a polyhedral surface. Another example is infinite polytope, which consists of an infinite set of convex polyhedrons (simplexes).


Aleksandrov, P. S. Lektsii po analiticheskoi geometrii…. Moscow, 1968.
Aleksandrov, P. S. Kombinatornaia topologiia. Moscow-Leningrad, 1947.
Pontriagin, L. S. Osnovy kombinatornoi topologii. Moscow-Leningrad, 1947.
Aleksandrov, P. S., and B. A. Pasynkov. Vvedenie v teoriiu razmernosti. Moscow, 1973.


References in periodicals archive ?
He covers infeasible monotone systems of constraints; complexes, (hyper)graphs, and inequality systems; polytopes, positive bases, and inequality systems; monotone Boolean functions, complexes, graphs, and inequality; and inequality systems, committees, (hyper)graphs, and alternative covers.
The first one is a poset, closely related to the Stokes polytopes introduced by Baryshnikov.
Sturmfels, Grobner bases and convex polytopes, Univ.
Related to Jakob Steiner's problem on the combinatorial characterization of polytopes inscribed in the two-sphere [S.
They model concepts as convex polytopes, claiming such structures to be especially appropriate for computational operations.
WANG: Hamiltonian path and symmetric travelling salesman polytopes, Math.
Baca, Labelings of two classes of Convex polytopes, Utilitas Math.
4 K-Discrete orientation polytopes (K-DOP's) or fixed-direction hull (FDH)
geometric properties such as polytopes, dimensional polyhedral, or 3-D fractals).
Voronoi regions of lattices, second moments of polytopes, and quantization, PGIT 28, 211-226 = Chap.
The topics are informal topology, graphs, surfaces, graphs and surfaces, knots and links, the differential geometry of surfaces, Riemann geometries, hyperbolic geometry, the fundamental group, general topology, and polytopes.