Arrangement (space partition)
From Wikipedia, the free encyclopedia

In discrete geometry, an arrangement is the decomposition of the d-dimensional linear, affine, or projective space into connected cells of different dimensions, induced by a finite collection of geometric objects, which are usually of dimension one less than the dimension of the space, and often of the same type as each other, such as hyperplanes or spheres.
For a set of objects in , the cells in the arrangement are the connected components of sets of the form for subsets of . That is, for each the cells are the connected components of the points that belong to every object in and do not belong to any other object. For instance the cells of an arrangement of lines in the Euclidean plane are of three types:
- Isolated points, for which is the subset of all lines that pass through the point.
- Line segments or rays, for which is a singleton set of one line. The segment or ray is a connected component of the points that belong only to that line and not to any other line of
- Convex polygons (possibly unbounded), for which is the empty set, and its intersection (the empty intersection) is the whole space. These polygons are the connected components of the subset of the plane formed by removing all the lines in .