Search Results for ""

The two-dimensional Hammersley point set of order m is defined by taking all numbers in the range from 0 to 2^m-1 and interpreting them as binary fractions. Calling these ...

A simple point process (or SPP) is an almost surely increasing sequence of strictly positive, possibly infinite random variables which are strictly increasing as long as they ...

A point x^* which is mapped to itself under a map G, so that x^*=G(x^*). Such points are sometimes also called invariant points or fixed elements (Woods 1961). Stable fixed ...

To generate random points over the unit disk, it is incorrect to use two uniformly distributed variables r in [0,1] and theta in [0,2pi) and then take x = rcostheta (1) y = ...

Let A^' be the outermost vertex of the regular pentagon erected inwards on side BC of a reference triangle DeltaABC. Similarly, define B^' and C^'. The triangle ...

Let A^' be the outermost vertex of the regular pentagon erected outward on side BC of a reference triangle DeltaABC. Similarly, define B^' and C^'. The triangle ...

For every partition of all the points on a line into two nonempty sets such that no point of either lies between two points of the other, there is a point of one set which ...

For a general two-player zero-sum game, max_(i<=m)min_(j<=n)a_(ij)<=min_(j<=n)max_(i<=m)a_(ij). If the two are equal, then write ...

The first mid-arc point is the triangle center with triangle center function alpha_(178)=[cos(1/2B)+cos(1/2C)]csc(1/2A). It is Kimberling center X_(178).

If a sequence of double points is passed as a closed curve is traversed, each double point appears once in an even place and once in an odd place.