From Wikipedia, the free encyclopedia

In geometry, general position for a set of points, or other configuration, means the general case situation, as opposed to some more special or coincidental cases that are possible. Its precise meaning differs in different settings.

This notion is important in mathematics and its applications, because degenerate cases may require an exceptional treatment; for example, when stating exactly certain theorems and when writing computer programs.

The most frequent use is the following: a set of points in the d-dimensional Euclidean space is said to be in general position if no d + 1 of them lie in a (d − 1)-dimensional plane. Such set of points is also said to be affinely independent. See affine transformation for more.

If d + 1 points are in a (d − 1)-dimensional plane, it is called a degenerate case or degenerate configuration.

In particular, a set of points in the plane are said to be in general position if no three of them are on the same straight line. (Three points on a line is a degenerate case here).

In some contexts, e.g., when discussing Voronoi tessellations and Delaunay triangulations in the plane, a stricter definition is used: a set of points in the plane is then said to be in general position only if no three of them lie on the same straight line and no four lie on the same circle.

This definition can be generalized further: one may speak of points in general position with respect to a fixed class of algebraic relations (e.g. conic sections). In algebraic geometry this kind of condition is frequently encountered, in that points should impose independent conditions on curves passing through them.

In very abstract terms, general position is a discussion of configuration space in terms of its open, dense subsets. For a given problem, one such subset may be correctly used; a generic property, following the Baire category theorem, may be found by intersecting an infinite sequence of such sets, but then the condition (though dense) may no longer be open (stable under small perturbation).

With respect to most definitions of general position, it is a frequent case that holds for most possible sets of points. For example, if k points are chosen uniformly at random from d-dimensional Euclidean space, they will almost surely (with probability 1) be in general position. Moreover, given a set of points that are not in general position, perturbing each point by a very small random amount — often well within the margin of error of the tools used to measure the points — is very likely to produce a set of points in general position. For this reason it is usually considered the most important case to address in theorems and algorithms.