TOPICS
Search

Search Results for ""


341 - 350 of 830 for Convex PolyhedronSearch Results
Kakutani's fixed point theorem is a result in functional analysis which establishes the existence of a common fixed point among a collection of maps defined on certain ...
Sylvester's four-point problem asks for the probability q(R) that four points chosen at random in a planar region R have a convex hull which is a quadrilateral (Sylvester ...
A concave polygon is a polygon that is not convex. A simple polygon is concave iff at least one of its internal angles is greater than 180 degrees. An example of a non-simple ...
The placement of objects so that they touch in some specified manner, often inside a container with specified properties. For example, one could consider a sphere packing, ...
The great icosahedron, not to be confused with the great icosidodecahedron orgreat icosicosidodecahedron, is the Kepler-Poinsot polyhedronhose dual is the great stellated ...
Augmentation is the dual operation of truncation which replaces the faces of a polyhedron with pyramids of height h (where h may be positive, zero, or negative) having the ...
A surface of revolution obtained by rotating a closed plane curve about an axis parallel to the plane which does not intersect the curve. The simplest toroid is the torus. ...
To truncate a real number is to discard its noninteger part. Truncation of a (positive) number x therefore corresponds to taking the floor function |_x_|. Truncation also ...
The polyhedron compound of the truncated cube and its dual, the small triakis octahedron. The compound can be constructed from a truncated cube of unit edge length by ...
If a function phi:(0,infty)->(0,infty) satisfies 1. ln[phi(x)] is convex, 2. phi(x+1)=xphi(x) for all x>0, and 3. phi(1)=1, then phi(x) is the gamma function Gamma(x). ...
1 ... 32|33|34|35|36|37|38 ... 83 Previous Next

...