Arrangement of lines

From Wikipedia, the free encyclopedia
Jump to: navigation, search
A simplicial line arrangement (left) and a simple line arrangement (right).

In geometry an arrangement of lines is the partition of the plane formed by a collection of lines. Bounds on the complexity of arrangements have been studied in discrete geometry, and computational geometers have found algorithms for the efficient construction of arrangements.

Definition[edit]

For any set A of lines in the Euclidean plane, one can define an equivalence relation on the points of the plane according to which two points p and q are equivalent if, for every line l of A, either p and q are both on l or both belong to the same open half-plane bounded by l. When A is finite or locally finite[1] the equivalence classes of this relation are of three types:

  1. the interiors of bounded or unbounded convex polygons (the cells of the arrangement), the connected components of the subset of the plane not contained in any of the lines of A,
  2. open line segments and open infinite rays (the edges of the arrangement), the connected components of the points of a single line that do not belong to any other lines of A, and
  3. single points (the vertices of the arrangement), the intersections of two or more lines of A.

These three types of objects link together to form a cell complex covering the plane. Two arrangements are said to be isomorphic or combinatorially equivalent if there is a one-to-one adjacency-preserving correspondence between the objects in their associated cell complexes.[2]

Complexity of arrangements[edit]

The study of arrangements was begun by Jakob Steiner, who proved the first bounds on the maximum number of features of different types that an arrangement may have.[3] An arrangement with n lines has at most n(n − 1)/2 vertices, one per pair of crossing lines. This maximum is achieved for simple arrangements, those in which each two lines has a distinct pair of crossing points. In any arrangement there will be n infinite-downward rays, one per line; these rays separate n + 1 cells of the arrangement that are unbounded in the downward direction. The remaining cells all have a unique bottommost vertex,[4] and each vertex is bottommost for a unique cell, so the number of cells in an arrangement is the number of vertices plus n + 1, or at most n(n + 1)/2 + 1; see lazy caterer's sequence. The number of edges of the arrangement is at most n2, as may be seen either by using the Euler characteristic to calculate it from the numbers of vertices and cells, or by observing that each line is partitioned into at most n edges by the other n − 1 lines; again, this worst-case bound is achieved for simple arrangements.

The zone of a line l in a line arrangement is the collection of cells having edges belonging to l. The zone theorem states that the total number of edges in the cells of a single zone is linear. More precisely, the total number of edges of the cells belonging to a single side of line l is at most 5n − 1,[5] and the total number of edges of the cells belonging to both sides of l is at most \lfloor 9.5n\rfloor-1.[6] More generally, the total complexity of the cells of a line arrangement that are intersected by any convex curve is O(n α(n)), where α denotes the inverse Ackermann function, as may be shown using Davenport–Schinzel sequences.[6] Summing the complexities of all zones, one finds that the sum of squares of cell complexities in an arrangement is O(n2).[7]

The k-level of an arrangement is the polygonal chain formed by the edges that have exactly k other lines directly below them, and the ≤k-level is the portion of the arrangement below the k-level. Finding matching upper and lower bounds for the complexity of a k-level remains a major open problem in discrete geometry; the best upper bound is O(nk1/3), while the best lower bound is Ω(n exp(c (logk)1/2)).[8] In contrast, the maximum complexity of the ≤k-level is known to be Θ(nk).[9] A k-level is a special case of a monotone path in an arrangement; that is, a sequence of edges that intersects any vertical line in a single point. However, monotone paths may be much more complicated than k-levels: there exist arrangements and monotone paths in these arrangements where the number of points at which the path changes direction is Ω(n2 − o(1)).[10]

Although a single cell in an arrangement may be bounded by all n lines, it is not possible in general for m different cells to all be bounded by n lines. Rather, the total complexity of m cells is at most Θ(m2/3n2/3 + n),[11] almost the same bound as occurs in the Szemerédi–Trotter theorem on point-line incidences in the plane. A simple proof of this follows from the crossing number inequality:[12] if m cells have a total of x + n edges, one can form a graph with m nodes (one per cell) and x edges (one per pair of consecutive cells on the same line). The edges of this graph can be drawn as curves that do not cross within the cells corresponding to their endpoints, and then follow the lines of the arrangement; therefore, there are O(n2) crossings in this drawing. However, by the crossing number inequality, there are Ω(x3/m2) crossings; in order to satisfy both bounds, x must be O(m2/3n2/3).[13]

Projective arrangements and projective duality[edit]

It is often convenient to study line arrangements not in the Euclidean plane but in the projective plane, due to the fact that in projective geometry every pair of lines has a crossing point. In the projective plane, we may no longer define arrangements using sides of lines (a line in the projective plane does not separate the plane into two distinct sides), but we may still define the cells of an arrangement to be the connected components of the points not belonging to any line, the edges to be the connected components of sets of points belonging to a single line, and the vertices to be points where two or more lines cross. A line arrangement in the projective plane differs from its Euclidean counterpart in that the two Euclidean rays at either end of a line are replaced by a single edge in the projective plane that connects the leftmost and rightmost vertices on that line, and in that pairs of unbounded Euclidean cells are replaced in the projective plane by single cells that are crossed by the projective line at infinity.

Due to projective duality, many statements about the combinatorial properties of points in the plane may be more easily understood in an equivalent dual form about arrangements of lines. For instance, the Sylvester–Gallai theorem, stating that any non-collinear set of points in the plane has an ordinary line containing exactly two points, transforms under projective duality to the statement that any arrangement of lines with more than one vertex has an ordinary point, a vertex where only two lines cross. The earliest known proof of the Sylvester–Gallai theorem, by Melchior (1940), uses the Euler characteristic to show that such a vertex must always exist.

Triangles in arrangements[edit]

An arrangement of lines in the projective plane is said to be simplicial if every cell of the arrangement is bounded by exactly three edges; simplicial arrangements were first studied by Melchior.[14] Three infinite families of simplicial line arrangements are known:

  1. A near-pencil consisting of n − 1 lines through a single point, together with a single additional line that does not go through the same point,
  2. The family of lines formed by the sides of a regular polygon together with its axes of symmetry, and
  3. The sides and axes of symmetry of an even regular polygon, together with the line at infinity.

Additionally there are many other examples of sporadic simplicial arrangements that do not fit into any known infinite family.[15] As Grünbaum[16] writes, simplicial arrangements “appear as examples or counterexamples in many contexts of combinatorial geometry and its applications.” For instance, Artés, Grünbaum & Llibre (1998) use simplicial arrangements to construct counterexamples to a conjecture on the relation between the degree of a set of differential equations and the number of invariant lines the equations may have. The two known counterexamples to the Dirac-Motzkin conjecture (which states that any n-line arrangement has at least n/2 ordinary points) are both simplicial.[17]

The dual graph of a line arrangement, in which there is one node per cell and one edge linking any pair of cells that share an edge of the arrangement, is a partial cube, a graph in which the nodes can be labeled by bitvectors in such a way that the graph distance equals the Hamming distance between labels; in the case of a line arrangement, each coordinate of the labeling assigns 0 to nodes on one side of one of the lines and 1 to nodes on the other side.[18] Dual graphs of simplicial arrangements have been used to construct infinite families of 3-regular partial cubes, isomorphic to the graphs of simple zonohedra.[19]

It is also of interest to study the extremal numbers of triangular cells in arrangements that may not necessarily be simplicial. In any arrangement, there must be at least n triangles; every arrangement that has only n triangles must be simple.[20] The maximum possible number of triangles in a simple arrangement is known to be upper bounded by n(n − 1)/3 and lower bounded by n(n − 3)/3; the lower bound is achieved by certain subsets of the diagonals of a regular 2n-gon.[21] For non-simple arrangements the maximum number of triangles is similar but more tightly bounded.[22] The closely related Kobon triangle problem asks for the maximum number of non-overlapping finite triangles (not necessarily faces) in an arrangement in the Euclidean plane; for some but not all values of n, n(n − 2)/3 triangles are possible.

Multigrids and Penrose tilings[edit]

The dual graph of a simple line arrangement may be represented geometrically as a collection of rhombi, one per vertex of the arrangement, with sides perpendicular to the lines that meet at that vertex. These rhombi may be joined together to form a tiling of a convex polygon in the case of an arrangement of finitely many lines, or of the entire plane in the case of a locally finite arrangement with infinitely many lines. de Bruijn (1981) investigated special cases of this construction in which the line arrangement consists of k sets of equally spaced parallel lines. For two perpendicular families of parallel lines this construction just gives the familiar square tiling of the plane, and for three families of lines at 120-degree angles from each other (themselves forming a trihexagonal tiling) this produces the rhombille tiling. However, for more families of lines this construction produces aperiodic tilings. In particular, for five families of lines at equal angles to each other (or, as de Bruijn calls this arrangement, a pentagrid) it produces a family of tilings that include the rhombic version of the Penrose tilings.

The tetrakis square tiling is an infinite arrangement of lines forming a periodic tiling that resembles a multigrid with four parallel families, but in which two of the families are more widely spaced than the other two, and in which the arrangement is simplicial rather than simple. Its dual is the truncated square tiling. Similarly, the triangular tiling is an infinite simplicial line arrangement with three parallel families, which has as its dual the hexagonal tiling, and the bisected hexagonal tiling is an infinite simplicial line arrangement with six parallel families and two line spacings, dual to the great rhombitrihexagonal tiling.

Algorithms[edit]

Constructing an arrangement means, given as input a list of the lines in the arrangement, computing a representation of the vertices, edges, and cells of the arrangement together with the adjacencies between these objects, for instance as a doubly connected edge list. Due to the zone theorem, arrangements can be constructed efficiently by an incremental algorithm that adds one line at a time to the arrangement of the previously added lines: each new line can be added in time proportional to its zone, resulting in a total construction time of O(n2).[5] However, the memory requirements of this algorithm are high, so it may be more convenient to report all features of an arrangement by an algorithm that does not keep the entire arrangement in memory at once. This may again be done efficiently, in time O(n2) and space O(n), by an algorithmic technique known as topological sweeping.[23] Computing a line arrangement exactly requires a numerical precision several times greater than that of the input coordinates: if a line is specified by two points on it, the coordinates of the arrangement vertices may need four times as much precision as these input points. Therefore, computational geometers have also studied algorithms for constructing arrangements efficiently with limited numerical precision.[24]

As well, researchers have studied efficient algorithms for constructing smaller portions of an arrangement, such as zones,[25] k-levels,[26] or the set of cells containing a given set of points.[27] The problem of finding the arrangement vertex with the median x-coordinate arises (in a dual form) in robust statistics as the problem of computing the Theil–Sen estimator of a set of points.[28]

Marc van Kreveld suggested the algorithmic problem of computing shortest paths between vertices in a line arrangement, where the paths are restricted to follow the edges of the arrangement, more quickly than the quadratic time that it would take to apply a shortest path algorithm to the whole arrangement graph.[29] An approximation algorithm is known,[30] and the problem may be solved efficiently for lines that fall into a small number of parallel families (as is typical for urban street grids),[31] but the general problem remains open.

See also[edit]

  • Configuration (geometry), an arrangement of lines together with a subset of the vertices of the arrangement with the property that each vertex in the subset belongs to the same number of lines from the arrangement and each line from the arrangement contains the same number of vertices in the subset.
  • Arrangement (space partition)

Notes[edit]

  1. ^ For an arrangement to be locally finite, every bounded subset of the plane may be crossed by only finitely many lines.
  2. ^ Grünbaum (1972), page 4.
  3. ^ Steiner (1826); Agarwal & Sharir (2000).
  4. ^ For cells in which there is a horizontal bottom edge, choose the bottommost vertex to be the right endpoint of the bottom edge.
  5. ^ a b Chazelle, Guibas & Lee (1985), Edelsbrunner (1987), Edelsbrunner, O'Rourke & Seidel (1986).
  6. ^ a b Bern et al. (1991).
  7. ^ Aronov, Matoušek & Sharir (1994).
  8. ^ Dey (1998); Toth (2001). The problem of bounding the complexity of k-levels was first studied by Lovász (1971) and Erdős et al. (1973).
  9. ^ Alon & Győri (1986).
  10. ^ Balogh et al. (2004); see also Matoušek (1991).
  11. ^ Canham (1969); Clarkson et al. (1990).
  12. ^ Ajtai et al. (1982); Leighton (1983).
  13. ^ Székely (1997).
  14. ^ Melchior (1940); Grünbaum (2005).
  15. ^ Grünbaum (1972); Grünbaum (2005).
  16. ^ Grünbaum (2005)
  17. ^ Crowe & McKee (1968); Dirac (1951); Kelly & Moser (1958); Grünbaum (1972), page 18.
  18. ^ Eppstein, Falmagne & Ovchinnikov (2007).
  19. ^ Eppstein (2006).
  20. ^ Grünbaum (1972); Levi (1926); Roudneff (1988).
  21. ^ Füredi & Palásti (1984); Grünbaum (1972).
  22. ^ Purdy (1979); Purdy (1980); Strommer (1977).
  23. ^ Edelsbrunner & Guibas (1989).
  24. ^ Fortune & Milenkovic (1991); Greene & Yao (1986); Milenkovic (1989).
  25. ^ Aharoni et al. (1999).
  26. ^ Agarwal et al. (1998); Chan (1999); Cole, Sharir & Yap (1987); Edelsbrunner & Welzl (1986).
  27. ^ Agarwal (1990); Agarwal, Matoušek & Sharir (1998); Edelsbrunner, Guibas & Sharir (1990).
  28. ^ Cole et al. (1989).
  29. ^ Erickson (1997).
  30. ^ Bose et al. (1996).
  31. ^ Eppstein & Hart (1999).

References[edit]

External links[edit]