TOPICS
Search

Search Results for ""


431 - 440 of 1015 for Computational AlgorithmsSearch Results
Given five equal disks placed symmetrically about a given center, what is the smallest radius r for which the radius of the circular area covered by the five disks is 1? The ...
Finch (2010) gives an overview of known results for random Gaussian triangles. Let the vertices of a triangle in n dimensions be normal (normal) variates. The probability ...
The Hermite constant is defined for dimension n as the value gamma_n=(sup_(f)min_(x_i)f(x_1,x_2,...,x_n))/([discriminant(f)]^(1/n)) (1) (Le Lionnais 1983). In other words, ...
The mean triangle area of a triangle picked inside a regular hexagon with unit area is A^_=289/3888 (Woolhouse 1867, Pfiefer 1989). This is a special case of a general ...
The expected value B_n(s) of r^s from a fixed vertex of a unit n-cube to a point picked at random in the interior of the hypercube is given by B_n(s) = ...
Marsaglia (1972) has given a simple method for selecting points with a uniform distribution on the surface of a 4-sphere. This is accomplished by picking two pairs of points ...
A Lindenmayer system, also known as an L-system, is a string rewriting system that can be used to generate fractals with dimension between 1 and 2. Several example fractals ...
Line segment picking is the process of picking line segments at random within a given shape in the plane, in space, or in a higher dimension. The most natural definition of a ...
The mean triangle area A^_ is the average area of a triangle in triangle picking within some given shape. As summarized in the following table, it is possible to compute the ...
Is it possible to cover completely the surface of a sphere with congruent, nonoverlapping arcs of great circles? Conway and Croft (1964) proved that it can be covered with ...
1 ... 41|42|43|44|45|46|47 ... 102 Previous Next

...