In geometry, a cuboid is a solid figure bounded by six faces, forming a convex polyhedron.
From the en.wikipedia.org
The tetrahedron is the only convex polyhedron that has four faces.
From the en.wikipedia.org
Each cell in a Voronoi tessellation is a convex polyhedron.
From the en.wikipedia.org
Analytically, such a convex polyhedron is expressed as the solution set for a system of linear inequalities.
From the en.wikipedia.org
Of course, Euler goes further and explains that no convex polyhedron can be built even with irregular hexagons.
From the newscientist.com
Its feasible region is a convex polyhedron, which is a set defined as the intersection of finitely many half spaces, each of which is defined by a linear inequality.
From the en.wikipedia.org
It may alternatively be defined as the union of a finite number of convex polyhedra, where a convex polyhedron is any set that is the intersection of a finite number of half-spaces.
From the en.wikipedia.org
In this context, the core of a convex cost game is called the base polyhedron, because its elements generalize base properties of matroids.