Arrangement of lines

A simplicial line arrangement (left) and a simple line arrangement (right).

In geometry, an arrangement of lines is the subdivision of the Euclidean plane formed by a finite set of lines. An arrangement consists of bounded and unbounded convex polygons, the cells of the arrangement, line segments and rays, the edges of the arrangement, and points where two or more lines cross, the vertices of the arrangement. When considered in the projective plane rather than in the Euclidean plane, every two lines cross, and an arrangement is the projective dual to a finite set of points. Arrangements of lines have also been considered in the hyperbolic plane, and generalized to pseudolines, curves that have similar topological properties to lines. The initial study of arrangements has been attributed to an 1826 paper by Jakob Steiner.

An arrangement is said to be simple when at most two lines cross at each vertex, and simplicial when all cells are triangles (including the unbounded cells, as subsets of the projective plane). There are three known infinite families of simplicial arrangements, as well as many sporadic simplicial arrangements that do not fit into any known family. Arrangements have also been considered for infinite but locally finite systems of lines. Certain infinite arrangements of parallel lines can form simplicial arrangements, and one way of constructing the aperiodic Penrose tiling involves finding the dual graph of an arrangement of lines forming five parallel subsets.

The maximum numbers of cells, edges, and vertices, for arrangements with a given number of lines, are quadratic functions of the number of lines. These maxima are attained by simple arrangements. The complexity of other features of arrangements have been studied in discrete geometry; these include zones, the cells touching a single line, and levels, the polygonal chains having a given number of lines passing below them. Roberts's triangle theorem and the Kobon triangle problem concern the minimum and maximum number of triangular cells in a Euclidean arrangement, respectively.

Algorithms in computational geometry are known for constructing the features of an arrangement in time proportional to the number of features, and space linear in the number of lines. As well, researchers have studied efficient algorithms for constructing smaller portions of an arrangement, and for problems such as the shortest path problem on the vertices and edges of an arrangement.

Definition

As an informal thought experiment, consider cutting an infinite sheet of paper along finitely many lines. These cuts would partition the paper into convex polygons. Their edges would be one-dimensional line segments or rays, with vertices at the points where two cut lines cross. This can be formalized mathematically by classifying the points of the plane according to which side of each line they are on. Each line produces three possibilities per point: the point can be in one of the two open half-planes on either side of the line, or it can be on the line. Two points can be considered to be equivalent if they have the same classification with respect to all of the lines. This is an equivalence relation, whose equivalence classes are subsets of equivalent points. These subsets subdivide the plane into shapes of the following three types: ^[1]

1. The cells or chambers of the arrangement are two-dimensional regions not part of any line. They form the interiors of bounded convex polygons or unbounded convex regions. These are the connected components of the points that would remain after removing all points on lines. ^[1]
2. The edges or panels of the arrangement are one-dimensional regions belonging to a single line. They are the open line segments and open infinite rays into which each line is partitioned by its crossing points with the other lines. That is, if one of the lines is cut by all the other lines, these are the connected components of its uncut points. ^[1]
3. The vertices of the arrangement are isolated points belonging to two or more lines, where those lines cross each other. ^[1]

The boundary of a cell is the system of edges that touch it, and the boundary of an edge is the set of vertices that touch it (one vertex for a ray and two for a line segment). The system of objects of all three types, linked by this boundary operator, form a cell complex covering the plane. Two arrangements are said to be isomorphic or combinatorially equivalent if there is a one-to-one boundary-preserving correspondence between the objects in their associated cell complexes. ^[1]

The same classification of points, and the same shapes of equivalence classes, can be used for infinite but locally finite arrangements, defined as arrangements in which every bounded subset of the plane is crossed by finitely many lines. ^[2] In this case the unbounded cells may have infinitely many sides. ^[3]

Complexity of arrangements

It is straightforward to count the maximum numbers of vertices, edges, and cells in an arrangement, all of which are quadratic in the number of lines:

• An arrangement with ${\displaystyle n}$ lines has at most ${\displaystyle n(n-1)/2}$ vertices (a triangular number), one per pair of crossing lines. This maximum is attained for simple arrangements, those in which each two lines cross at a vertex that is disjoint from all the other lines. The number of vertices is smaller when some lines are parallel, or when some vertices are crossed by more than two lines. ^[4]
• An arrangement can be rotated, if necessary, to avoid axis-parallel lines. After this step, each ray that forms an edge of the arrangement extends either upward or downward from its endpoint; it cannot be horizontal. There are ${\displaystyle n}$ downward rays, one per line, and these rays separate ${\displaystyle n+1}$ cells of the arrangement that are unbounded in the downward direction. The remaining cells all have a unique bottommost vertex (again, because there are no axis-parallel lines). For each pair of lines, there can be only one cell where the two lines meet at the bottom vertex, so the number of downward-bounded cells is at most the number of pairs of lines, ${\displaystyle n(n-1)/2}$. Adding the unbounded and bounded cells, the total number of cells in an arrangement can be at most ${\displaystyle n(n+1)/2+1}$. ^[5] These are the numbers of the lazy caterer's sequence. ^[6]
• The number of edges of the arrangement is at most ${\displaystyle n^{2}}$, 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 ${\displaystyle n}$ edges by the other ${\displaystyle n-1}$ lines. Simple arrangements have exactly ${\displaystyle n^{2}}$ edges. ^[5]

More complex features go by the names of "zones", "levels", and "many faces":

• The zone of a line ${\displaystyle \ell }$ in a line arrangement is the collection of cells having edges belonging to ${\displaystyle \ell }$. 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 ${\displaystyle \ell }$ is at most ${\displaystyle 5n-1}$, ^[7] and the total number of edges of the cells belonging to both sides of ${\displaystyle \ell }$ is at most ${\displaystyle \lfloor 9.5n\rfloor -1}$. ^[8] More generally, the total complexity of the cells of a line arrangement that are intersected by any convex curve is ${\displaystyle O(n\alpha (n))}$, where ${\displaystyle \alpha }$ denotes the inverse Ackermann function, as may be shown using Davenport–Schinzel sequences. ^[9] The sum of squares of cell complexities in an arrangement is ${\displaystyle O(n^{2})}$, as can be shown by summing the zones of all lines. ^[10]
• The ${\displaystyle k}$- level of an arrangement is the polygonal chain formed by the edges that have exactly ${\displaystyle k}$ other lines directly below them. The ${\displaystyle \leq k}$-level is the portion of the arrangement below the ${\displaystyle k}$-level. Finding matching upper and lower bounds for the complexity of a ${\displaystyle k}$-level remains a major open problem in discrete geometry. The best upper bound known is ${\displaystyle O(nk^{1/3})}$, while the best lower bound known is ${\displaystyle n2^{\Omega ({\sqrt {\log k}})}}$. ^[11] In contrast, the maximum complexity of the ${\displaystyle \leq k}$-level is known to be ${\displaystyle \Theta (nk)}$. ^[12] A ${\displaystyle 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 ${\displaystyle k}$-levels: there exist arrangements and monotone paths in these arrangements where the number of points at which the path changes direction is ${\displaystyle n^{2-o(1)}}$. ^[13]
• Although a single cell in an arrangement may be bounded by all ${\displaystyle n}$ lines, it is not possible in general for ${\displaystyle m}$ different cells to all be bounded by ${\displaystyle n}$ lines. Rather, the total complexity of ${\displaystyle m}$ cells is at most ${\displaystyle \Theta (m^{2/3}n^{2/3}+n)}$, ^[14] 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: ^[15] if ${\displaystyle m}$ cells have a total of ${\displaystyle x+n}$ edges, one can form a graph with ${\displaystyle m}$ nodes (one per cell) and ${\displaystyle 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 ${\displaystyle O(n^{2})}$ crossings in this drawing. However, by the crossing number inequality, there are ${\displaystyle \Omega (x^{3}/m^{2})}$ crossings. In order to satisfy both bounds, ${\displaystyle x}$ must be ${\displaystyle O(m^{2/3}n^{2/3})}$. ^[16]

Projective arrangements and projective duality

It is convenient to study line arrangements in the projective plane as every pair of lines has a crossing point. ^[17] Line arrangements cannot be defined using the sides of lines, because a line in the projective plane does not separate the plane into two distinct sides. ^[18] One 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. ^[19]

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 projective arrangement of finitely many 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 Eberhard Melchior in 1940, uses the Euler characteristic to show that such a vertex must always exist. ^[20]

Triangles in arrangements

A simplicial arrangement formed by 20 lines, the sides and symmetry axes of a regular decagon. Adding the line at infinity produces another simplicial arrangement with 21 lines.

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. ^[21] Three infinite families of simplicial line arrangements are known:

1. A near-pencil consisting of ${\displaystyle 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. ^[22] As Branko Grünbaum writes, simplicial arrangements "appear as examples or counterexamples in many contexts of combinatorial geometry and its applications." ^[23] For instance, simplicial arrangements form 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. ^[24] The two known counterexamples to the Dirac–Motzkin conjecture (which states that any ${\displaystyle n}$-line arrangement has at least ${\displaystyle n/2}$ ordinary points) are both simplicial. ^[25]

The dual graph of a line arrangement has one node per cell and one edge linking any pair of cells that share an edge of the arrangement. These graphs are partial cubes, graphs 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. ^[26] Dual graphs of simplicial arrangements have been used to construct infinite families of 3-regular partial cubes, isomorphic to the graphs of simple zonohedra. ^[27]

An arrangement with the minimum number of triangles according to Roberts's triangle theorem

Kobon triangles in an arrangement of 17 lines

It is also of interest to study the extremal numbers of triangular cells in arrangements that may not necessarily be simplicial. Any arrangement in the projective plane must have at least ${\displaystyle n}$ triangles. Every arrangement that has only ${\displaystyle n}$ triangles must be simple. ^[28] For Euclidean rather than projective arrangements, the minimum number of triangles is ${\displaystyle n-2}$, by Roberts's triangle theorem. ^[29] The maximum possible number of triangular faces in a simple arrangement is known to be upper bounded by ${\displaystyle n(n-1)/3}$ and lower bounded by ${\displaystyle n(n-3)/3}$; the lower bound is achieved by certain subsets of the diagonals of a regular ${\displaystyle 2n}$-gon. ^[30] For projective arrangements that are not required to be simple, there exist arrangements with ${\displaystyle n(n-1)/3+4}$ triangles for all ${\displaystyle n\geq 4}$, and all arrangements with ${\displaystyle n\geq 6}$ have at most ${\displaystyle 7n(n-1)/18+1/3}$ triangles. ^[31] The closely related Kobon triangle problem asks for the maximum number of non-overlapping finite triangles in an arrangement in the Euclidean plane, not counting the unbounded faces that might form triangles in the projective plane. Again, the arrangements are not required to be simple. For some but not all values of ${\displaystyle n}$, there exist arrangements with ${\displaystyle n(n-2)/3}$ triangles. ^[32]

Multigrids and rhombus tilings

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. This construction is sometimes known as a Klee diagram, after a publication of Rudolf Klee in 1938 that used this technique. Not every rhombus tiling comes from lines in this way, however. ^[33]

In a 1981 paper, N. G. de Bruijn investigated special cases of this construction in which the line arrangement consists of ${\displaystyle k}$ sets of equally spaced parallel lines. For two perpendicular families of parallel lines this construction gives the 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. ^[34]

Tetrakis square tiling

Triangular tiling

Bisected hexagonal tiling

There also exist three infinite simplicial arrangements formed from sets of parallel lines. 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. These three examples come from three affine reflection groups in the Euclidean plane, systems of symmetries based on reflection across each line in these arrangements. ^[35]

Algorithms

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, these features may be represented as a doubly connected edge list. 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 the size of its zone, linear by the zone theorem. This results in a total construction time of ${\displaystyle O(n^{2})}$. ^[7] The memory requirements of this algorithm are also ${\displaystyle O(n^{2})}$. It is possible instead to report the features of an arrangement without storing them all at once, in time ${\displaystyle O(n^{2})}$ and space ${\displaystyle O(n)}$, by an algorithmic technique known as topological sweeping. ^[36] 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 with limited numerical precision. ^[37]

As well, researchers have studied efficient algorithms for constructing smaller portions of an arrangement, such as zones, ^[38] ${\displaystyle k}$-levels, ^[39] or the set of cells containing a given set of points. ^[40] The problem of finding the arrangement vertex with the median ${\displaystyle x}$-coordinate arises (in a dual form) in robust statistics as the problem of computing the Theil–Sen estimator of a set of points. ^[41]

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. ^[42] An approximation algorithm is known, ^[43] 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), ^[44] but the general problem remains open. ^[45]

Non-Euclidean line arrangements

A non-stretchable pseudoline arrangement of nine pseudolines. (All arrangements of fewer than nine pseudolines are stretchable.) Per Pappus's hexagon theorem, this arrangement cannot be realized in a projective plane over any field.

A hyperbolic line arrangement combinatorially equivalent to a chord diagram used by Ageev (1996) to show that triangle-free circle graphs may sometimes need 5 colors.

A pseudoline arrangement is a family of curves that share similar topological properties with a line arrangement. ^[46] These can be defined in the projective plane as simple closed curves any two of which meet in a single crossing point. ^[47] A pseudoline arrangement is said to be stretchable if it is combinatorially equivalent to a line arrangement. Determining stretchability is a difficult computational task: it is complete for the existential theory of the reals to distinguish stretchable arrangements from non-stretchable ones. ^[48] Every arrangement of finitely many pseudolines can be extended so that they become lines in a "spread", a type of non-Euclidean incidence geometry in which every two points of a topological plane are connected by a unique line (as in the Euclidean plane) but in which other axioms of Euclidean geometry may not apply. ^[49]

Another type of non-Euclidean geometry is the hyperbolic plane, and arrangements of lines in this geometry have also been studied. ^[50] Any finite set of lines in the Euclidean plane has a combinatorially equivalent arrangement in the hyperbolic plane (e.g. by enclosing the vertices of the arrangement by a large circle and interpreting the interior of the circle as a Klein model of the hyperbolic plane). However, parallel (non-crossing) pairs of lines are less restricted in hyperbolic line arrangements than in the Euclidean plane: in particular, the relation of being parallel is an equivalence relation for Euclidean lines but not for hyperbolic lines. ^[51] The intersection graph of the lines in a hyperbolic arrangement can be an arbitrary circle graph. The corresponding concept to hyperbolic line arrangements for pseudolines is a weak pseudoline arrangement, ^[52] a family of curves having the same topological properties as lines ^[53] such that any two curves in the family either meet in a single crossing point or have no intersection. ^[52]

History

In a survey on arrangements, Pankaj Agarwal and Micha Sharir attribute the study of arrangements to Jakob Steiner, writing that "the first paper on this topic is perhaps" an 1826 paper of Steiner. ^[54] In this paper, Steiner proved bounds on the maximum number of features of different types that an arrangement may have. ^[55] After Steiner, the study of arrangements turned to higher-dimensional arrangements of hyperplanes, focusing on their overall structure and on single cells in these arrangements. The study of arrangements of lines, and of more complex features such as zones within these arrangements, returned to interest beginning in the 1980s as part of the foundations of computational geometry. ^[54]

See also

• Configuration (geometry), an arrangement of lines and a set of points with all lines containing the same number of points and all points belonging to the same number of lines
• Arrangement (space partition), a partition of the plane given by overlaid curves or of a higher dimensional space by overlaid surfaces, without requiring the curves or surfaces to be flat
• Mathematical Bridge, a bridge in Cambridge, England whose beams form an arrangement of tangent lines to its arch

Notes

1. Grünbaum (1972), p. 4.
2. Eppstein, Falmagne & Ovchinnikov (2007), pp. 177–178.
3. Ovchinnikov (2011), p. 210.
4. Halperin & Sharir (2018 , p.  724 ). This source gives a formula for the number of cells of variable dimension in a hyperplane arrangement of variable dimension, which simplifies to ${\displaystyle {\tbinom {n}{2}}=n(n-1)/2}$ in the case of vertices (cells of dimension 0) in an arrangement of dimension 2.
5. Halperin & Sharir (2018), p.  724.
6. Sloane.
7. Chazelle, Guibas & Lee (1985, p. 80, Lemma 1), Edelsbrunner (1987, pp. 89–92, Section 5.3, Zones in arrangements: tight bounds in the plane), Edelsbrunner, O'Rourke & Seidel (1986, p. 346, Theorem 2.7).
8. Bern et al. (1991); an unpublished manuscript of Rom Pinchasi from 2011 claims the slightly stronger bound ${\displaystyle \lfloor 9.5n\rfloor -3}$.
9. Bern et al. (1991).
10. Aronov, Matoušek & Sharir (1994).
11. Dey (1998); Tóth (2001). The problem of bounding the complexity of k-levels was first studied by Lovász (1971) and Erdős et al. (1973).
12. Alon & Győri (1986).
13. Balogh et al. (2004); see also Matoušek (1991).
14. Canham (1969); Clarkson et al. (1990).
15. Ajtai et al. (1982); Leighton (1983).
16. Székely (1997).
17. Goodman & Pollack (1993), p. 109 Archived 2023-01-01 at the Wayback Machine : "The natural setting for arrangements of lines is the real projective plane"
18. Polster (1998), p. 223.
19. Goodman & Pollack (1993), p. 110.
20. This is the earliest proof cited by Borwein & Moser (1990 , pp. 114–116), but they write that the same proof was likely given "much earlier by others" (p. 114).
21. Melchior (1940); Grünbaum (2009 , p. 1).
22. Grünbaum (2009); Cuntz (2022).
23. Grünbaum (2009), p. 4.
24. Artés, Grünbaum & Llibre (1998).
25. Crowe & McKee (1968); Dirac (1951); Kelly & Moser (1958); Grünbaum (1972 , p. 18).
26. Eppstein, Falmagne & Ovchinnikov (2007), p. 180.
27. Eppstein (2006).
28. Grünbaum (1972 , p. 25, Theorem 2.20 and Conjecture 2.7); Levi (1926); Roudneff (1988).
29. Grünbaum (1998).
30. Füredi & Palásti (1984); Grünbaum (1972, pp. 26–30).
31. Purdy (1979); Purdy (1980); Strommer (1977).
32. Moreno & Prieto-Martínez (2021).
33. Klee (1938), as cited by Grünbaum (1974 , p. 101).
34. de Bruijn (1981).
35. Abramenko & Brown (2008), pp. 519–520, Example 10.14.
36. Edelsbrunner & Guibas (1989).
37. Fortune & Milenkovic (1991); Greene & Yao (1986); Milenkovic (1989).
38. Aharoni et al. (1999); Wang (2022a).
39. Agarwal et al. (1998); Chan (1999); Cole, Sharir & Yap (1987); Edelsbrunner & Welzl (1986); Halperin et al. (2022).
40. Agarwal (1990); Agarwal, Matoušek & Sharir (1998); Edelsbrunner, Guibas & Sharir (1990); Wang (2022b).
41. Cole et al. (1989).
42. Erickson (1997).
43. Bose et al. (1996).
44. Eppstein & Hart (1999).
45. Likhtarov (2020).
46. Grünbaum (1972 , p. 40); Agarwal & Sharir (2002).
47. This definition is from Grünbaum (1972 , p. 40). For a comparison of alternative definitions of pseudolines, see Eppstein, Falmagne & Ovchinnikov (2007 , pp. 238–239).
48. Shor (1991); Schaefer (2010 , p. 334).
49. Goodman et al. (1994).
50. Dress, Koolen & Moulton (2002).
51. Martin (1996), pp. 41, 338.
52. de Fraysseix & Ossona de Mendez (2003).
53. Here an alternative definition from Shor (1991), that a pseudoline is the image of a line under a homeomorphism of the plane, is appropriate.
54. Agarwal & Sharir (2000 , p. 52) (page 2 of preprint version).
55. Steiner (1826).

References

• Abramenko, Peter; Brown, Kenneth S. (2008), Buildings: Theory and Applications, Graduate Texts in Mathematics, vol. 248, New York: Springer, doi:10.1007/978-0-387-78835-7, ISBN   978-0-387-78834-0, MR   2439729
• Agarwal, P. K. (1990), "Partitioning arrangements of lines II: Applications", Discrete & Computational Geometry , 5 (1): 533–573, doi: 10.1007/BF02187809
• Agarwal, P. K.; de Berg, M.; Matoušek, J.; Schwarzkopf, O. (1998), "Constructing levels in arrangements and higher order Voronoi diagrams", SIAM Journal on Computing , 27 (3): 654–667, CiteSeerX   10.1.1.51.5064 , doi:10.1137/S0097539795281840
• Agarwal, P. K.; Matoušek, J.; Sharir, M. (1998), "Computing many faces in arrangements of lines and segments", SIAM Journal on Computing , 27 (2): 491–505, doi:10.1137/S009753979426616X, hdl: 1874/17088
• Agarwal, P. K.; Sharir, M. (2000), "Arrangements and their applications" (PDF), in Sack, J.-R.; Urrutia, J. (eds.), Handbook of Computational Geometry, Elsevier, pp. 49–119, archived (PDF) from the original on 2021-04-11, retrieved 2024-10-16
• Agarwal, P. K.; Sharir, M. (2002), "Pseudo-line arrangements: duality, algorithms, and applications", Proc. 13th ACM-SIAM Symposium on Discrete Algorithms (SODA '02), San Francisco: Society for Industrial and Applied Mathematics, pp. 800–809
• Ageev, A. A. (1996), "A triangle-free circle graph with chromatic number 5", Discrete Mathematics , 152 (1–3): 295–298, doi: 10.1016/0012-365X(95)00349-2
• Aharoni, Y.; Halperin, D.; Hanniel, I.; Har-Peled, S.; Linhart, C. (1999), "On-line zone construction in arrangements of lines in the plane", in Vitter, Jeffrey S.; Zaroliagis, Christos D. (eds.), Algorithm Engineering: 3rd International Workshop, WAE'99, London, UK, July 19–21, 1999, Proceedings, Lecture Notes in Computer Science, vol. 1668, Springer-Verlag, pp.  139–153, CiteSeerX   10.1.1.35.7681 , doi:10.1007/3-540-48318-7_13, ISBN   978-3-540-66427-7
• Ajtai, M.; Chvátal, V.; Newborn, M.; Szemerédi, E. (1982), "Crossing-free subgraphs", Theory and Practice of Combinatorics, North-Holland Mathematics Studies, vol. 60, North-Holland, pp. 9–12, MR   0806962
• Alon, N.; Győri, E. (1986), "The number of small semi-spaces of a finite set of points in the plane", Journal of Combinatorial Theory, Series A, 41: 154–157, doi: 10.1016/0097-3165(86)90122-6
• Aronov, B.; Matoušek, J.; Sharir, M. (1994), "On the sum of squares of cell complexities in hyperplane arrangements", Journal of Combinatorial Theory, Series A, 65 (2): 311–321, doi: 10.1016/0097-3165(94)90027-2
• Artés, J. C.; Grünbaum, B.; Llibre, J. (1998), "On the number of invariant straight lines for polynomial differential systems" (PDF), Pacific Journal of Mathematics , 184 (2): 207–230, doi: 10.2140/pjm.1998.184.207 , archived from the original (PDF) on 2010-07-18, retrieved 2008-12-15
• Balogh, J.; Regev, O.; Smyth, C.; Steiger, W.; Szegedy, M. (2004), "Long monotone paths in line arrangements", Discrete & Computational Geometry , 32 (2): 167–176, doi: 10.1007/s00454-004-1119-1
• Bern, M. W.; Eppstein, D.; Plassman, P. E.; Yao, F. F. (1991), "Horizon theorems for lines and polygons", in Goodman, J. E.; Pollack, R.; Steiger, W. (eds.), Discrete and Computational Geometry: Papers from the DIMACS Special Year, DIMACS Ser. Discrete Math. and Theoretical Computer Science (6 ed.), Amer. Math. Soc., pp. 45–66, MR   1143288
• Borwein, P.; Moser, W. O. J. (1990), "A survey of Sylvester's problem and its generalizations", Aequationes Mathematicae , 40 (1): 111–135, doi:10.1007/BF02112289, MR   1069788, S2CID   122052678
• Bose, P.; Evans, W.; Kirkpatrick, D. G.; McAllister, M.; Snoeyink, J. (1996), "Approximating shortest paths in arrangements of lines", Proc. 8th Canadian Conf. Computational Geometry, pp. 143–148
• de Bruijn, N. G. (1981), "Algebraic theory of Penrose's non-periodic tilings of the plane" (PDF), Indagationes Mathematicae , 43: 38–66, archived (PDF) from the original on 2021-05-07, retrieved 2024-10-16
• Canham, R. J. (1969), "A theorem on arrangements of lines in the plane", Israel Journal of Mathematics , 7 (4): 393–397, doi: 10.1007/BF02788872 , S2CID   123541779
• Chan, T. (1999), Remarks on k-level algorithms in the plane, archived from the original on 2010-11-04
• Chazelle, B.; Guibas, L. J.; Lee, D. T. (1985), "The power of geometric duality", BIT Numerical Mathematics , 25 (1): 76–90, doi:10.1007/BF01934990, S2CID   122411548
• Clarkson, K.; Edelsbrunner, H.; Guibas, L. J.; Sharir, M.; Welzl, E. (1990), "Combinatorial complexity bounds for arrangements of curves and spheres", Discrete & Computational Geometry , 5 (1): 99–160, doi: 10.1007/BF02187783
• Cole, Richard; Salowe, Jeffrey S.; Steiger, W. L.; Szemerédi, Endre (1989), "An optimal-time algorithm for slope selection", SIAM Journal on Computing , 18 (4): 792–810, doi:10.1137/0218055, MR   1004799
• Cole, R.; Sharir, M.; Yap, C.-K. (1987), "On k-hulls and related problems", SIAM Journal on Computing , 16 (1): 61–77, doi:10.1137/0216005
• Crowe, D. W.; McKee, T. A. (1968), "Sylvester's problem on collinear points", Mathematics Magazine , 41 (1): 30–34, doi:10.2307/2687957, JSTOR   2687957
• Cuntz, Michael (2022), "A greedy algorithm to compute arrangements of lines in the projective plane", Discrete & Computational Geometry , 68 (1): 107–124, doi: 10.1007/s00454-021-00351-y , MR   4430282
• Dey, T. L. (1998), "Improved bounds for planar k-sets and related problems", Discrete & Computational Geometry , 19 (3): 373–382, doi: 10.1007/PL00009354 , MR   1608878
• Dirac, G. (1951), "Collinearity properties of sets of points", Quarterly Journal of Mathematics , 2 (1): 221–227, Bibcode:1951QJMat...2..221D, doi:10.1093/qmath/2.1.221
• Dress, A.; Koolen, J. H.; Moulton, V. (2002), "On line arrangements in the hyperbolic plane", European Journal of Combinatorics, 23 (5): 549–557, doi: 10.1006/eujc.2002.0582 , MR   1931939
• Edelsbrunner, H. (1987), Algorithms in Combinatorial Geometry, EATCS Monographs in Theoretical Computer Science, Springer-Verlag, ISBN   978-3-540-13722-1
• Edelsbrunner, H.; Guibas, L. J. (1989), "Topologically sweeping an arrangement", Journal of Computer and System Sciences , 38 (1): 165–194, doi: 10.1016/0022-0000(89)90038-X
• Edelsbrunner, H.; Guibas, L. J.; Sharir, M. (1990), "The complexity and construction of many faces in arrangements of lines and of segments", Discrete & Computational Geometry , 5 (1): 161–196, doi: 10.1007/BF02187784
• Edelsbrunner, H.; O'Rourke, J.; Seidel, R. (1986), "Constructing arrangements of lines and hyperplanes with applications", SIAM Journal on Computing , 15 (2): 341–363, doi:10.1137/0215024
• Edelsbrunner, H.; Welzl, E. (1986), "Constructing belts in two-dimensional arrangements with applications", SIAM Journal on Computing , 15 (1): 271–284, doi:10.1137/0215019
• Eppstein, D. (2006), "Cubic partial cubes from simplicial arrangements", Electronic Journal of Combinatorics , 13 (1, R79): 1–14, arXiv: math.CO/0510263 , doi:10.37236/1105, MR   2255421, S2CID   8608953, archived from the original on 2012-02-14, retrieved 2024-10-16
• Eppstein, D.; Falmagne, J.-Cl.; Ovchinnikov, S. (2007), Media Theory, Springer-Verlag
• Eppstein, D.; Hart, D. (1999), "Shortest paths in an arrangement with k line orientations", Proceedings of the 10th ACM–SIAM Symposium on Discrete Algorithms (SODA '99), pp. 310–316
• Erdős, P.; Lovász, L.; Simmons, A.; Straus, E. G. (1973), "Dissection graphs of planar point sets", A Survey of Combinatorial Theory (Proc. Internat. Sympos., Colorado State Univ., Fort Collins, Colo., 1971), Amsterdam: North-Holland, pp. 139–149, MR   0363986
• Erickson, J. (1997), Shortest paths in line arrangements, archived from the original on 2008-12-03, retrieved 2008-12-15
• Fortune, S.; Milenkovic, V. (1991), "Numerical stability of algorithms for line arrangements", Proc. 7th ACM Symposium on Computational Geometry (SoCG '91), pp. 334–341, CiteSeerX   10.1.1.56.2404 , doi:10.1145/109648.109685, ISBN   978-0897914260, S2CID   2861855
• de Fraysseix, H.; Ossona de Mendez, P. (2003), "Stretching of Jordan arc contact systems", Proceedings of the 11th International Symposium on Graph Drawing (GD 2003), Lecture Notes in Computer Science (2912 ed.), Springer-Verlag, pp. 71–85
• Füredi, Z.; Palásti, I. (1984), "Arrangements of lines with a large number of triangles" (PDF), Proceedings of the American Mathematical Society , 92 (4): 561–566, doi:10.2307/2045427, JSTOR   2045427, archived from the original (PDF) on 2016-03-03, retrieved 2008-12-15
• Goodman, Jacob E.; Pollack, Richard (1993), "Allowable sequences and order types in discrete and computational geometry", in Pach, János (ed.), New Trends in Discrete and Computational Geometry, Algorithms and Combinatorics, vol. 10, Berlin: Springer, pp. 103–134, doi:10.1007/978-3-642-58043-7_6, MR   1228041
• Goodman, Jacob E.; Pollack, Richard; Wenger, Rephael; Zamfirescu, Tudor (1994), "Every arrangement extends to a spread", Combinatorica , 14 (3): 301–306, doi:10.1007/BF01212978, MR   1305899, S2CID   42055590
• Greene, D.; Yao, F. F. (1986), "Finite-resolution computational geometry", Proceedings of the 27th IEEE Symposium on Foundations of Computer Science (FOCS '86), pp. 143–152, doi:10.1109/SFCS.1986.19, ISBN   978-0-8186-0740-0, S2CID   2624319
• Grünbaum, B. (1972), Arrangements and Spreads, Regional Conference Series in Mathematics, vol. 10, Providence, R.I.: American Mathematical Society
• Grünbaum, B. (1974), Lectures on Arrangements, University of Washington, hdl:1773/15699
• Grünbaum, Branko (1998), "How many triangles?" (PDF), Geombinatorics , 8 (1): 154–159, MR   1633757
• Grünbaum, Branko (2009), "A catalogue of simplicial arrangements in the real projective plane", Ars Mathematica Contemporanea, 2 (1): 1–25, doi: 10.26493/1855-3974.88.e12 , hdl: 1773/2269 , MR   2485643
• Halperin, D.; Sharir, M. (2018), "Arrangements", in Goodman, Jacob E.; O'Rourke, Joseph; Tóth, Csaba D. (eds.), Handbook of Discrete and Computational Geometry, Discrete Mathematics and its Applications (3rd ed.), Boca Raton, Florida: CRC Press, pp. 723–762, ISBN   978-1-4987-1139-5, MR   3793131
• Halperin, Dan; Har-Peled, Sariel; Mehlhorn, Kurt; Oh, Eunjin; Sharir, Micha (2022), "The maximum-level vertex in an arrangement of lines", Discrete & Computational Geometry , 67 (2): 439–461, doi:10.1007/s00454-021-00338-9, MR   4376573
• Kelly, L. M.; Moser, W. O. J. (1958), "On the number of ordinary lines determined by n points", Canadian Journal of Mathematics , 10: 210–219, doi: 10.4153/CJM-1958-024-6
• Klee, R. (1938), Über die einfachen Konfigurationen der euklidischen und der projektiven Ebene, Dresden: Focken & Oltmanns
• Leighton, F. T. (1983), Complexity Issues in VLSI: Optimal Layouts for the Shuffle–Exchange Graph and Other Networks, Foundations of Computing Series, Cambridge, MA: MIT Press
• Levi, F. (1926), "Die Teilung der projektiven Ebene durch Gerade oder Pseudogerade", Ber. Math.-Phys. Kl. Sächs. Akad. Wiss. Leipzig, 78: 256–267
• Likhtarov, Anton (2020), Shortest Paths in Line Arrangements (master's thesis), University of British Columbia, doi:10.14288/1.0389809
• Lovász, L. (1971), "On the number of halving lines", Annales Universitatis Scientiarum Budapestinensis de Rolando Eőtvős Nominatae Sectio Mathematica, 14: 107–108
• Martin, George E. (1996), The Foundations of Geometry and the Non-Euclidean Plane, Undergraduate Texts in Mathematics, Springer-Verlag, ISBN   0-387-90694-0, MR   1410263
• Matoušek, J. (1991), "Lower bounds on the length of monotone paths in arrangements", Discrete & Computational Geometry , 6 (1): 129–134, doi: 10.1007/BF02574679
• Melchior, E. (1940), "Über Vielseite der projektiven Ebene", Deutsche Mathematik , 5: 461–475
• Milenkovic, V. (1989), "Double precision geometry: a general technique for calculating line and segment intersections using rounded arithmetic", Proceedings of the 30th IEEE Symposium on Foundations of Computer Science (FOCS '89), pp. 500–505, doi:10.1109/SFCS.1989.63525, ISBN   978-0-8186-1982-3, S2CID   18564700
• Moreno, José Pedro; Prieto-Martínez, Luis Felipe (2021), "El problema de los triángulos de Kobon" [The Kobon triangles problem], La Gaceta de la Real Sociedad Matemática Española (in Spanish), 24 (1): 111–130, hdl:10486/705416, MR   4225268
• Ovchinnikov, Sergei (2011), Graphs and Cubes, Universitext, New York: Springer, doi:10.1007/978-1-4614-0797-3, ISBN   978-1-4614-0796-6, MR   3014880
• Polster, Burkard (1998), A Geometrical Picture Book, Universitext, Springer-Verlag, New York, doi:10.1007/978-1-4419-8526-2, ISBN   0-387-98437-2, MR   1640615
• Purdy, G. B. (1979), "Triangles in arrangements of lines", Discrete Mathematics , 25 (2): 157–163, doi: 10.1016/0012-365X(79)90018-9
• Purdy, G. B. (1980), "Triangles in arrangements of lines, II", Proceedings of the American Mathematical Society , 79: 77–81, doi: 10.1090/S0002-9939-1980-0560588-4
• Roudneff, J.-P. (1988), "Arrangements of lines with a minimum number of triangles are simple", Discrete & Computational Geometry , 3 (1): 97–102, doi: 10.1007/BF02187900
• Schaefer, Marcus (2010), "Complexity of some geometric and topological problems" (PDF), Graph Drawing, 17th International Symposium, GS 2009, Chicago, IL, USA, September 2009, Revised Papers, Lecture Notes in Computer Science, vol. 5849, Springer-Verlag, pp. 334–344, doi: 10.1007/978-3-642-11805-0_32 , ISBN   978-3-642-11804-3, archived (PDF) from the original on 2021-06-26, retrieved 2024-10-16
• Shor, P. W. (1991), "Stretchability of pseudolines is NP-hard", in Gritzmann, P.; Sturmfels, B. (eds.), Applied Geometry and Discrete Mathematics: The Victor Klee Festschrift, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 4, Providence, R.I.: American Mathematical Society, pp. 531–554
• Sloane, N. J. A. (ed.), "SequenceA000124(Central polygonal numbers (the Lazy Caterer's sequence))", The On-Line Encyclopedia of Integer Sequences , OEIS Foundation
• Steiner, J. (1826), "Einige Gesetze über die Theilung der Ebene und des Raumes", J. Reine Angew. Math. , 1: 349–364, doi:10.1515/crll.1826.1.349, S2CID   120477563
• Strommer, T. O. (1977), "Triangles in arrangements of lines", Journal of Combinatorial Theory, Series A, 23 (3): 314–320, doi: 10.1016/0097-3165(77)90022-X
• Székely, L. A. (1997), "Crossing numbers and hard Erdős problems in discrete geometry" (PDF), Combinatorics, Probability and Computing , 6 (3): 353–358, doi:10.1017/S0963548397002976, S2CID   36602807, archived (PDF) from the original on 2017-08-08, retrieved 2024-10-16
• Tóth, G. (2001), "Point sets with many k-sets", Discrete & Computational Geometry , 26 (2): 187–194, doi: 10.1007/s004540010022
• Wang, Haitao (2022a), "A simple algorithm for computing the zone of a line in an arrangement of lines", in Bringmann, Karl; Chan, Timothy M. (eds.), 5th Symposium on Simplicity in Algorithms, SOSA@SODA 2022, Virtual Conference, January 10-11, 2022, SIAM, pp. 79–86, arXiv: 2111.08238 , doi:10.1137/1.9781611977066.7
• Wang, Haitao (2022b), "Constructing many faces in arrangements of lines and segments", in Naor, Joseph (Seffi); Buchbinder, Niv (eds.), Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, SODA 2022, Virtual Conference / Alexandria, VA, USA, January 9 - 12, 2022, SIAM, pp. 3168–3180, arXiv: 2110.08669 , doi:10.1137/1.9781611977073.123

External links

• Database of Combinatorially Different Line Arrangements