Search Results for ""

The Leonine triangle DeltaX_AX_BX_C (a term coined here for the first time), is the Cevian triangle of Kimberling center X_(598). It is the polar triangle of the Lemoine ...

The MacBeath triangle DeltaX_AX_BX_C (a term coined here for the first time), is the triangle whose vertices are the contact points of the MacBeath inconic with the reference ...

The inverse curve for a parabola given by x = at^2 (1) y = 2at (2) with inversion center (x_0,y_0) and inversion radius k is x = x_0+(k(at^2-x_0))/((at^2+x_0)^2+(2at-y_0)^2) ...

The second Morley adjunct triangle has trilinear vertex matrix [2 sec[1/3(C-2pi)] sec[1/3(B-2pi)]; sec[1/3(C-2pi)] 2 sec[1/3(A-2pi)]; sec[1/3(B-2pi)] sec[1/3(A-2pi)] 2]. The ...

The third Morley adjunct triangle has trilinear vertex matrix [2 sec[1/3(C-4pi)] sec[1/3(B-4pi)]; sec[1/3(C-4pi)] 2 sec[1/3(A-4pi)]; sec[1/3(B-4pi)] sec[1/3(A-4pi)] 2]. The ...

Given a triangle, extend two sides in the direction opposite their common vertex. The circle tangent to these two lines and to the other side of the triangle is called an ...

The pedal curve of the parabola with parametric equations x = at^2 (1) y = 2at (2) with pedal point (x_0,y_0) is x_p = ((x_0-a)t^2+y_0t)/(t^2+1) (3) y_p = ...

A polyhedron is said to be regular if its faces and vertex figures are regular (not necessarily convex) polygons (Coxeter 1973, p. 16). Using this definition, there are a ...

Let N^* be the smallest dimension n of a hypercube such that if the lines joining all pairs of corners are two-colored for any n>=N^*, a complete graph K_4 of one color with ...

The blossom algorithm (Edmonds 1965) finds a maximum independent edge set in a (possibly weighted) graph. While a maximum independent edge set can be found fairly easily for ...