TOPICS
Search

Search Results for ""


161 - 170 of 13135 for Computational GeometrySearch Results
An isosceles trapezoid (called an isosceles trapezium by the British; Bronshtein and Semendyayev 1997, p. 174) is trapezoid in which the base angles are equal and therefore ...
Minkowski's conjecture states that every lattice tiling of R^n by unit hypercubes contains two hypercubes that meet in an (n-1)-dimensional face. Minkowski first considered ...
Bezdek and Kuperberg (1991) have constructed packings of identical ellipsoids of densities arbitrarily close to ((24sqrt(2)-6sqrt(3)-2pi)pi)/(72)=0.753355... (OEIS A093824), ...
In 1803, Malfatti posed the problem of determining the three circular columns of marble of possibly different sizes which, when carved out of a right triangular prism, would ...
Square line picking is the selection of pairs of points (corresponding to endpoints of a line segment) randomly placed inside a square. n random line segments can be picked ...
What is the probability that a chord drawn at random on a circle of radius r (i.e., circle line picking) has length >=r (or sometimes greater than or equal to the side length ...
Given a unit circle, pick two points at random on its circumference, forming a chord. Without loss of generality, the first point can be taken as (1,0), and the second by ...
A uniform distribution of points on the circumference of a circle can be obtained by picking a random real number between 0 and 2pi. Picking random points on a circle is ...
Select three points at random on the circumference of a unit circle and find the distribution of areas of the resulting triangles determined by these three points. The first ...
Given a unit line segment [0,1], pick two points at random on it. Call the first point x_1 and the second point x_2. Find the distribution of distances d between points. The ...
1 ... 14|15|16|17|18|19|20 ... 1314 Previous Next

...