Search Results for ""

Given a triangle center X=l:m:n, the line mnalpha+nlbeta+lmgamma=0, where alpha:beta:gamma are trilinear coordinates, is called the trilinear polar (Kimberling 1998, p. 38). ...

An inconic with parameters x:y:z=a(b-c):b(c-a):c(a-b), (1) giving equation (2) (Kimberling 1998, pp. 238-239). Its focus is Kimberling center X_(101) and its conic section ...

The Kiepert hyperbola is a hyperbola and triangle conic that is related to the solution of Lemoine's problem and its generalization to isosceles triangles constructed on the ...

The Steiner circumellipse is the circumellipse that is the isotomic conjugate of the line at infinity and the isogonal conjugate of the Lemoine axis. It has circumconic ...

Cribbage is a game in which each of two players is dealt a hand of six cards. Each player then discards two of his six cards to a four-card "crib" which alternates between ...

The set E of edges of a loopless graph (V,E), being a set of unordered pairs of elements of V, constitutes an adjacency relation on V. Formally, an adjacency relation is any ...

The set A^2 of all ordered pairs of complex numbers.

The Bellman-Ford algorithm is an algorithm for solving the shortest path problem, i.e., finding a graph geodesic between two given vertices. Other algorithms that can be used ...

Given two bicentric points P=p:q:r and U=u:v:w, their bicentric sum is defined by p+u:q+v:r:w.

Consider a set of points X_i on an attractor, then the correlation integral is C(l)=lim_(N->infty)1/(N^2)f, where f is the number of pairs (i,j) whose distance |X_i-X_j|<l. ...