Search Results for ""

A branch of mathematics which encompasses many diverse areas of minimization and optimization. Optimization theory is the more modern term for operations research. ...

A rotor is a convex figure that can be rotated inside a polygon (or polyhedron) while always touching every side (or face). The least area rotor in a square is the Reuleaux ...

In n dimensions for n>=5 the arrangement of hyperspheres whose convex hull has minimal content is always a "sausage" (a set of hyperspheres arranged with centers along a ...

The convexity coefficient chi(D) of a region D is the probability that the line segment connecting two random points in D is contained entirely within D. For a convex region, ...

A number of attractive tetrahedron 6-compounds can be constructed. The first compound (left figures) is obtained by combining three stella octangula. A second can be obtained ...

The cube-octahedron 5-compound is a polyhedron compound of the cube 5-compound and its dual, the octahedron 5-compound. It will be implemented in a future version of the ...

A cube 12-compound can be constructed from the vertices of the first dodecahedron 2-compound. It will be implemented in a future version of the Wolfram Language as ...

A cube 13-compound can be constructed as the dual of the octahedron 13-compound. It will be implemented in a future version of the Wolfram Language as ...

A cube 30-compound can be constructed from the vertices of the first dodecahedron 6-compound. It will be implemented in a future version of the Wolfram Language as ...

A cube 35-compound can be constructed as the dual of the octahedron 35-compound. It will be implemented in a future version of the Wolfram Language as ...