Search Results for ""
111 - 120 of 486 for Convex HullSearch Results
For an arbitrary not identically constant polynomial, the zeros of its derivatives lie in the smallest convex polygon containing the zeros of the original polynomial.
The triangular (or trigonal) dipyramid is one of the convex deltahedra, and Johnson solid J_(12). It is also an isohedron. It is implemented in the Wolfram Language as ...
Define the Euler measure of a polyhedral set as the Euler integral of its indicator function. It is easy to show by induction that the Euler measure of a closed bounded ...
A pentahedron is polyhedron having five faces. Because there are two pentahedral graphs, there are two convex pentahedra, corresponding to the topologies of the square ...
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.
The cuboctahedron, also called the heptaparallelohedron or dymaxion (the latter according to Buckminster Fuller; Rawles 1997), is the Archimedean solid with faces 8{3}+6{4}. ...
The field of semidefinite programming (SDP) or semidefinite optimization (SDO) deals with optimization problems over symmetric positive semidefinite matrix variables with ...
...
View search results from all Wolfram sites (1537 matches)

