Search Results for ""

The 24-cell is a finite regular four-dimensional polytope with Schläfli symbol {3,4,3}. It is also known as the hyperdiamond or icositetrachoron, and is composed of 24 ...

Define the minimal bounding rectangle as the smallest rectangle containing a given lattice polygon. If the perimeter of the lattice polygon is equal to that of its minimal ...

The pseudo-tangent cone P_S(x) of a subset S subset R^n at a point x in S is the set P_S(x)=convK_S^_, where K_S is the contingent cone of S and where conv(A) is the smallest ...

The tangram is a combination of plane polygonal pieces such that the edges of the polygons are coincident. There are 13 convex tangrams (where a "convex tangram" is a set of ...

The figure formed when the midpoints of the sides of a convex quadrilateral are joined in order is a parallelogram. Equivalently, the bimedians bisect each other. The area of ...

Linear programming, sometimes known as linear optimization, is the problem of maximizing or minimizing a linear function over a convex polyhedron specified by linear and ...

A function f(x) is said to be concave on an interval [a,b] if, for any points x_1 and x_2 in [a,b], the function -f(x) is convex on that interval (Gradshteyn and Ryzhik 2000).

The Schmitt-Conway biprism is a convex polyhedron found to be only aperiodically space-filling by Conway in 1993.

A formula relating the number of polyhedron vertices V, faces F, and polyhedron edges E of a simply connected (i.e., genus 0) polyhedron (or polygon). It was discovered ...

Shephard's conjecture states that every convex polyhedron admits a self-unoverlapping unfolding (Shephard 1975). This question is still unsettled (Malkevitch), though most ...