Search Results for ""

A weighted graph in which the weights are equal to the Euclidean lengths of the edges in a specified embedding (Skiena 1990, pp. 201 and 252).

A non-Euclidean space with constant negative Gaussian curvature.

The Euclidean algorithm, also called Euclid's algorithm, is an algorithm for finding the greatest common divisor of two numbers a and b. The algorithm can also be defined for ...

A Euclidean-like space having line element ds^2=(dz^1)^2+...+(dz^p)^2-(dz^(p+1))^2-...-(dz^(p+q))^2, having dimension m=p+q (Rosen 1965). In contrast, the signs would be all ...

The straightedge and the compass. The name is due to the fact that connecting points with segments, prolonging segments and drawing circles with a given center and a given ...

A Euclidean number is a number which can be obtained by repeatedly solving the quadratic equation. Euclidean numbers, together with the rational numbers, can be constructed ...

The study of manifolds having a complete Riemannian metric. Riemannian geometry is a general space based on the line element ds=F(x^1,...,x^n;dx^1,...,dx^n), with F(x,y)>0 ...

Young's geometry is a finite geometry which satisfies the following five axioms: 1. There exists at least one line. 2. Every line of the geometry has exactly three points on ...

That portion of geometry dealing with figures in a plane, as opposed to solid geometry. Plane geometry deals with the circle, line, polygon, etc.

A geometry constructed without reference to measurement. The only primitive concepts are those of points and intermediacy. There are 10 axioms underlying ordered geometry.