- polyhedral convexity
- мат. полиэдральная выпуклость
Большой англо-русский и русско-английский словарь. 2001.
polyhedral convexity
Смотреть что такое "polyhedral convexity" в других словарях:
Polychoron — In geometry, a four dimensional polytope is sometimes called a polychoron (plural: polychora), from the Greek root poly , meaning many , and choros meaning room or space .It is also called a 4 polytope or polyhedroid. The two dimensional analogue … Wikipedia
Kepler–Poinsot polyhedron — In geometry, a Kepler–Poinsot polyhedron is any of four regular star polyhedra. They may be obtained by stellating the regular convex dodecahedron and icosahedron, and differ from these in having regular pentagrammic faces or vertex figures.… … Wikipedia
Uniform polychoron — In geometry, a uniform polychoron (plural: uniform polychora) is a polychoron or 4 polytope which is vertex transitive and whose cells are uniform polyhedra.This article contains the complete list of 64 non prismatic convex uniform polychora, and … Wikipedia
Linear programming — (LP, or linear optimization) is a mathematical method for determining a way to achieve the best outcome (such as maximum profit or lowest cost) in a given mathematical model for some list of requirements represented as linear relationships.… … Wikipedia
Glossary of Riemannian and metric geometry — This is a glossary of some terms used in Riemannian geometry and metric geometry mdash; it doesn t cover the terminology of differential topology. The following articles may also be useful. These either contain specialised vocabulary or provide… … Wikipedia
Monotone polygon — Green indicates one intersection, blue indicates two intersections, and red indicates three or more. The top two polygons are monotone with respect to L while the bottom two are not. In geometry, a polygon P in the plane is called monotone with… … Wikipedia
Mathematical economics — Economics … Wikipedia
James W. Cannon — (b. January 30, 1943) is an American mathematician working in the areas of low dimensional topology and geometric group theory. He is an Orson Pratt Professor of Mathematics at the Brigham Young University.Biographical dataJames W. Cannon was… … Wikipedia
Neighborly polytope — In geometry and polyhedral combinatorics, a k neighborly polytope is a convex polytope in which every set of k or fewer vertices forms a face. For instance, a 2 neighborly polytope is a polytope in which every pair of vertices is connected by an… … Wikipedia
List of mathematics articles (L) — NOTOC L L (complexity) L BFGS L² cohomology L function L game L notation L system L theory L Analyse des Infiniment Petits pour l Intelligence des Lignes Courbes L Hôpital s rule L(R) La Géométrie Labeled graph Labelled enumeration theorem Lack… … Wikipedia
Euclidean geometry — geometry based upon the postulates of Euclid, esp. the postulate that only one line may be drawn through a given point parallel to a given line. [1860 65] * * * Study of points, lines, angles, surfaces, and solids based on Euclid s axioms. Its… … Universalium
