Search Results for ""

A planar polygon is convex if it contains all the line segments connecting any pair of its points. Thus, for example, a regular pentagon is convex (left figure), while an ...

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 notation for polyhedra which begins by specifying a "seed" polyhedron using a capital letter. The Platonic solids are denoted T (tetrahedron), O (octahedron), C (cube), I ...

A system for specifying points using coordinates measured in some specified way. The simplest coordinate system consists of coordinate axes oriented perpendicularly to each ...

A cork plug is a three-dimensional solid that can stopper a square, triangular, or circular hole. There is an infinite family of such shapes. The shape with smallest volume ...

A spiral that gives the solution to the central orbit problem under a radial force law r^..=-mu|r|^(-3)r^^, (1) where mu is a positive constant. There are three solution ...

A family gamma of nonempty subsets of X whose union contains the given set X (and which contains no duplicated subsets) is called a cover (or covering) of X. For example, ...

Let n points xi_1, ..., xi_n be randomly distributed on a domain S, and let H be some event that depends on the positions of the n points. Let S^' be a domain slightly ...

The Császár polyhedron is a polyhedron that is topologically equivalent to a torus which was discovered in the late 1940s by Ákos Császár (Gardner 1975). It has 7 polyhedron ...

The average number of regions into which n randomly chosen planes divide a cube is N^_(n)=1/(324)(2n+23)n(n-1)pi+n+1 (Finch 2003, p. 482). The maximum number of regions is ...