Search Results for ""

Young's geometry is a finite geometry which satisfies the following five axioms: 1. There exists at least one line. 2. Every line of the geometry has exactly three points on ...

An n-dimensional disk (sometimes spelled "disc") of radius r is the collection of points of distance <=r (closed disk) or <r (open disk) from a fixed point in Euclidean ...

A Cevian point P is point with respect to which a set of Cevians of a triangle are taken. Connecting the endpoints of the Cevians through a point P gives the so-called Cevian ...

For 2<=n<=32, it is possible to select 2n lattice points with x,y in [1,n] such that no three are in a straight line (where "straight line" means any line in the plane--not ...

On a computer screen, the pixels indicating a slanted line are selected with Bresenham's algorithm, developed in 1962 while at IBM.

The de Longchamps line is central line L_(32) with trilinear equation a^3alpha+b^3beta+c^3gamma=0 (Droussent 1953; Kimberling 1998, p. 150) which is the anticomplement of the ...

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

Let theta(t) be the Riemann-Siegel function. The unique value g_n such that theta(g_n)=pin (1) where n=0, 1, ... is then known as a Gram point (Edwards 2001, pp. 125-126). An ...

To pick a random point on the surface of a unit sphere, it is incorrect to select spherical coordinates theta and phi from uniform distributions theta in [0,2pi) and phi in ...

The inversive distance is the natural logarithm of the ratio of two concentric circles into which the given circles can be inverted. Let c be the distance between the centers ...