Search Results for ""

The set of all points x that can be put into one-to-one correspondence with sets of essentially distinct values of four homogeneous coordinates x_0:x_1:x_2:x_3, not all ...

The equation of a line ax+by+c=0 in slope-intercept form is given by y=-a/bx-c/b, (1) so the line has slope -a/b. Now consider the distance from a point (x_0,y_0) to the ...

Let a line in three dimensions be specified by two points x_1=(x_1,y_1,z_1) and x_2=(x_2,y_2,z_2) lying on it, so a vector along the line is given by v=[x_1+(x_2-x_1)t; ...

In Euclidean space R^3, the curve that minimizes the distance between two points is clearly a straight line segment. This can be shown mathematically as follows using ...

The set A^2 of all ordered pairs of complex numbers.

The set P^2 is the set of all equivalence classes [a,b,c] of ordered triples (a,b,c) in C^3\(0,0,0) under the equivalence relation (a,b,c)∼(a^',b^',c^') if ...

A point B is said to lie between points A and C (where A, B, and C are distinct collinear points) if AB+BC=AC. A number of Euclid's proofs depend on the idea of betweenness ...

The two-dimensional space consisting of the set of triples {(a,b,c):a,b,c in K, not all zero}, where triples which are scalar multiples of each other are identified.

It is especially convenient to specify planes in so-called Hessian normal form. This is obtained from the general equation of a plane ax+by+cz+d=0 (1) by defining the ...

The Hadwiger-Nelson problem asks for the chromatic number of the plane, i.e., the minimum number of colors needed to color the plane if no two points at unit distance one ...