Search Results for ""

The partitioning of a plane with n points into convex polygons such that each polygon contains exactly one generating point and every point in a given polygon is closer to ...

Ball tetrahedron picking is the selection of quadruples of points (corresponding to vertices of a general tetrahedron) randomly placed inside a ball. n random tetrahedra can ...

Let V(r) be the volume of a ball of radius r in a complete n-dimensional Riemannian manifold with Ricci curvature tensor >=(n-1)kappa. Then V(r)<=V_kappa(r), where V_kappa is ...

Any bounded planar region with positive area >A placed in any position of the unit square lattice can be translated so that the number of lattice points inside the region ...

The nth root of the content of the set sum of two sets in n-dimensional Euclidean space is greater than or equal to the sum of the nth roots of the contents of the individual ...

The 60 Pascal lines of a hexagon inscribed in a conic intersect three at a time through 20 Steiner points, and also three at a time in 60 Kirkman points. Each Steiner point ...

Let m(G) be the cycle rank of a graph G, m^*(G) be the cocycle rank, and the relative complement G-H of a subgraph H of G be defined as that subgraph obtained by deleting the ...

Consider the distribution of distances l between a point picked at random in the interior of a unit cube and on a face of the cube. The probability function, illustrated ...

Given four points chosen at random inside a unit cube, the average volume of the tetrahedron determined by these points is given by ...

An equation of the form y=ax^3+bx^2+cx+d, (1) where the three roots of the equation coincide (and are therefore real), i.e., y=a(x-r)^3=a(x^3-3rx^2-3r^2x-r^3). (2) Loomis ...