Arrangement (space partition)

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.

Line arrangements

Definition

For a set $A$ of objects in $\mathbb {R} ^{d}$ , the cells in the arrangement are the connected components of sets of the form $(\cap X)\setminus \cup (A\setminus X)$ for subsets $X$ of $A$ . That is, for each $X$ the cells are the connected components of the points that belong to every object in $X$ 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 $X$ is the subset of all lines that pass through the point.
Line segments or rays, for which $X$ 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 $A$
Convex polygons (possibly unbounded), for which $X$ 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 $A$ .

Types of arrangement

Of particular interest are the arrangements of lines and arrangements of hyperplanes.

More generally, geometers have studied arrangements of other types of curves in the plane, and of other more complicated types of surface.[1] Arrangements in complex vector spaces have also been studied; since complex lines do not partition the complex plane into multiple connected components, the combinatorics of vertices, edges, and cells does not apply to these types of space, but it is still of interest to study their symmetries and topological properties.[2]

Applications

An interest in the study of arrangements was driven by advances in computational geometry, where the arrangements were unifying structures for many problems. Advances in study of more complicated objects, such as algebraic surfaces, contributed to "real-world" applications, such as motion planning and computer vision.[3]

gollark: Well, I am still working out the `next_color` logic, so I decided to hardcode it as green.

gollark: Look at this VERY ARTISTIC art.

gollark: It has monads in it, so it's indecipherable.

gollark: I don't know Haskell, so I couldn't say.

gollark: The code lacks `foldM` too so who knows.

References

Agarwal, P. K.; Sharir, M. (2000), "Arrangements and their applications", in Sack, J.-R.; Urrutia, J. (eds.), Handbook of Computational Geometry, Elsevier, pp. 49–119, archived from the original on 2007-06-10.
Orlik, P.; Terao, H. (1992), Arrangements of Hyperplanes, Grundlehren der mathematischen Wissenschaften, 300, Springer-Verlag.
Halperin, Dan (2004), "Arrangements", Handbook of Discrete and Computational Geometry (2nd ed.), ISBN 978-1-58488-301-2.

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.

[as00-1] Agarwal, P. K.; Sharir, M. (2000), "Arrangements and their applications", in Sack, J.-R.; Urrutia, J. (eds.), Handbook of Computational Geometry, Elsevier, pp. 49–119, archived from the original on 2007-06-10.

[2] Orlik, P.; Terao, H. (1992), Arrangements of Hyperplanes, Grundlehren der mathematischen Wissenschaften, 300, Springer-Verlag.

[3] Halperin, Dan (2004), "Arrangements", Handbook of Discrete and Computational Geometry (2nd ed.), ISBN 978-1-58488-301-2.