Search Results for ""

The maximum distance between n points in three dimensions can occur no more than 2n-2 times. Also, there exists a fixed number c such that no distance determined by a set of ...

The problem of polygon intersection seeks to determine if two polygons intersect and, if so, possibly determine their intersection. For example, the intersection of the two ...

An elementary theorem in geometry whose name means "asses' bridge," perhaps in reference to the fact that fools would be unable to pass this point in their geometric studies. ...

A presheaf C of categories consists of the following data: 1. For every local homeomorphism f:Y->X of topological spaces X, Y, a category C(f:Y->X); 2. For every diagram f ...

A projection is the transformation of points and lines in one plane onto another plane by connecting corresponding points on the two planes with parallel lines. This can be ...

The Pythagoras tree is a fractal constructed iteratively from a right triangle with squares erected on each of the sides. Subsequent iterations add additional similar right ...

For a right triangle with legs a and b and hypotenuse c, a^2+b^2=c^2. (1) Many different proofs exist for this most fundamental of all geometric theorems. The theorem can ...

The base-4 method of counting in which only the digits 0, 1, 2, and 3 are used. The illustration above shows the numbers 0 to 63 represented in quaternary, and the following ...

The Randić energy of a graph is defined as the graph energy of its Randić matrix, i.e., the sum of the absolute values of the eigenvalues of its Randić matrix.

The Randić index of a graph is defined as half the sum of the matrix elements of its Randić matrix. While the index was introduced to model the branching of the carbon-atom ...