Search Results for ""

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 Bron-Kerbosch algorithm is an efficient method for finding all maximal cliques in a graph.

For every positive integer n, there exists a square in the plane with exactly n lattice points in its interior. This was extended by Schinzel and Kulikowski to all plane ...

An extension of the secant method of root finding to higher dimensions.

A Brunnian link is a set of n linked loops such that each proper sublink is trivial, so that the removal of any component leaves a set of trivial unlinked unknots. The ...

The system of ordinary differential equations u^' = A+u^2v-(B+1)u (1) v^' = Bu-u^2v (2) (Hairer et al. 1987, p. 112; Zwillinger 1997, p. 136). The so-called full Brusselator ...