Search Results for ""

A theorem stating the existence of an object, such as the solution to a problem or equation. Strictly speaking, it need not tell how many such objects there are, nor give ...

The point of concurrence of the joins of the vertices of a triangle and the points of contact of an inconic of the triangle (Veblen and Young 1938, p. 111; Eddy and Fritsch ...

Cube point picking is the three-dimensional case of hypercube point picking. The average distance from a point picked at random inside a unit cube to the center is given by ...

The theorem of Möbius tetrads, also simply called Möbius's theorem by Baker (1925, p. 18), may be stated as follows. Let P_1, P_2, P_3, and P_4 be four arbitrary points in a ...

A point lattice is a regularly spaced array of points. In the plane, point lattices can be constructed having unit cells in the shape of a square, rectangle, hexagon, etc. ...

A point v is a central point of a graph if the eccentricity of the point equals the graph radius. The set of all central points is called the graph center.

A point traced out twice as a closed curve is traversed. The maximum number of double points for a nondegenerate quartic curve is three. An ordinary double point is also ...

A point x_0 at which the derivative of a function f(x) vanishes, f^'(x_0)=0. A stationary point may be a minimum, maximum, or inflection point.

The general curve of a system which is linearly dependent on a certain number of given irreducible curves will not have a singular point which is not fixed for all the curves ...

The point with respect to which a radial curve is computed.