TOPICS
Search

Search Results for ""


131 - 140 of 13135 for Computational GeometrySearch Results
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 ...
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 ...
What is the longest ladder that can be moved around a right-angled hallway of unit width? For a straight, rigid ladder, the answer is 2sqrt(2), which allows the ladder to ...
Consider the average volume of a tetrahedron picked at random inside an octahedron of unit volume. The answer is difficult to compute analytically (Zinani 2003), but the mean ...
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, ...
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 ...
Pick two real numbers x and y at random in (0,1) with a uniform distribution. What is the probability P_(even) that [x/y], where [r] denotes the nearest integer function, is ...
Given n points, find the line segments with the shortest possible total length which connect the points. The segments need not necessarily be straight from one point to ...
Given a circular table of diameter 9 feet, which is the minimal number of planks (each 1 foot wide and length greater than 9 feet) needed in order to completely cover the ...
The convex hull of a set of points S in n dimensions is the intersection of all convex sets containing S. For N points p_1, ..., p_N, the convex hull C is then given by the ...
1 ... 11|12|13|14|15|16|17 ... 1314 Previous Next

...