Search Results for ""

Given a triangle with one vertex at the origin and the others at positions v_1 and v_2, one might think that a random point inside the triangle would be given by ...

The happy end problem, also called the "happy ending problem," is the problem of determining for n>=3 the smallest number of points g(n) in general position in the plane ...

The minimal enclosing circle problem, sometimes also known as the bomb problem, is the problem of finding the circle of smallest radius that contains a given set of points in ...

A set of curves whose equations are of the same form but which have different values assigned to one or more parameters in the equations. Families of curves arise, for ...

A unit of angular measure in which the angle of an entire circle is 400 gradians. A right angle is therefore 100 gradians. A gradian is sometimes also called a gon or a grade.

Let a, b, and c be the sides of a spherical triangle, then the spherical defect is defined as D=2pi-(a+b+c).

Consider a line segment of length 1, and pick a point x at random between [0,1]. This point x divides the line into line segments of length x and 1-x. If a set of points are ...

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 ...

Given an n-ball B^n of radius R, find the distribution of the lengths s of the lines determined by two points chosen at random within the ball. The probability distribution ...

Ball point picking is the selection of points randomly placed inside a ball. n random points can be picked in a unit ball in the Wolfram Language using the function ...