TOPICS
Search

Search Results for ""


71 - 80 of 550 for Convex PolytopeSearch Results
Let X be a locally convex topological vector space and let K be a compact subset of X. In functional analysis, Milman's theorem is a result which says that if the closed ...
A number of attractive 12-compounds of the regular tetrahedron can be constructed. The compounds illustrated above will be implemented in a future version of the Wolfram ...
If F is a family of more than n bounded closed convex sets in Euclidean n-space R^n, and if every H_n (where H_n is the Helly number) members of F have at least one point in ...
A polyhedron is said to be regular if its faces and vertex figures are regular (not necessarily convex) polygons (Coxeter 1973, p. 16). Using this definition, there are a ...
In finding the average area A^__R of a triangle chosen from a closed, bounded, convex region R of the plane, then A^__(T(R))=A^__R, for T any nonsingular affine ...
Let A be a closed convex subset of a Banach space and assume there exists a continuous map T sending A to a countably compact subset T(A) of A. Then T has fixed points.
A convex polyhedron is defined as the set of solutions to a system of linear inequalities mx<=b (i.e., a matrix inequality), where m is a real s×d matrix and b is a real ...
The interior of the triangle is the set of all points inside a triangle, i.e., the set of all points in the convex hull of the triangle's vertices. The simplest way to ...
The field of semidefinite programming (SDP) or semidefinite optimization (SDO) deals with optimization problems over symmetric positive semidefinite matrix variables with ...
Tomography is the study of the reconstruction of two- and three-dimensional objects from one-dimensional slices. The Radon transform is an important tool in tomography. ...
1 ... 5|6|7|8|9|10|11 ... 55 Previous Next

...