Search Results for ""

Let A_1, B_2, C_1, A_2, and B_1 be five points determining a conic. Then the conic is the locus of the point C_2=A_1(L·C_1A_2)·B_1(L·C_1B_2), where L is a line through the ...

An algebraic variety over a field K that becomes isomorphic to a projective space.

If, in the Gershgorin circle theorem for a given m, |a_(jj)-a_(mm)|>Lambda_j+Lambda_m for all j!=m, then exactly one eigenvalue of A lies in the disk Gamma_m.

A search algorithm of a graph which explores all nodes adjacent to the current node before moving on. For cyclic graphs, care must be taken to make sure that no nodes are ...

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

One name for the figure used by Euclid to prove the Pythagorean theorem. It is sometimes also known as the "windmill."

For a curve with first fundamental form ds^2=Edu^2+2Fdudv+Gdv^2, (1) the Gaussian curvature is K=(M_1-M_2)/((EG-F^2)^2), (2) where M_1 = |-1/2E_(vv)+F_(uv)-1/2G_(uu) 1/2E_u ...

Brocard geometry is that part of triangle geometry concerned with the Brocard points, Brocard triangles, etc.

The inverse of the Laplace transform, given by F(t)=1/(2pii)int_(gamma-iinfty)^(gamma+iinfty)e^(st)f(s)ds, where gamma is a vertical contour in the complex plane chosen so ...

The Bron-Kerbosch algorithm is an efficient method for finding all maximal cliques in a graph.