|
|
| (One intermediate revision by one other user not shown) |
| Line 1: |
Line 1: |
| [[File:Complete-quads.svg|thumb|300px|A simplicial line arrangement (left) and a simple line arrangement (right).]]
| | Are you wired? Do you work in a worrying environment, constantly beneath deadlines and dealing with a harsh boss? Does your line of work place a whole lot of accountability on your shoulders, so that you are always fascinated by work and what needs to be achieved?<br><br><br><br>In extreme circumstances, preeclampsia could be very harmful to each mother and child. The mom might develop seizures and, attributable to the possibility of a low low carb diet platelet count brought on by the disease, might hemorrhage. Within the meantime the infant would be dwelling in a hostile atmosphere due to the how to lose weight fast elevated blood pressure. There would be a diminished degree of blood flow to the child, which would lead to a diminished circulation of oxygen and nourishment. Those most in danger are ladies with household histories of preeclampsia, lengthy-standing high blood pressure or kidney disease, being pregnant-induced diabetes, autoimmune illnesses resembling systemic lupus, and people over 40 years previous. This is the loud noise generally heard throughout both inhalation or exhalation whereas someone is sleeping.<br><br>No matter any aid, the necessary point to notice is that it was solely non permanent aid Upon being taken off my prescription, I was back to going through as much as the actual world and dealing with the causes of why I had anxiousness and mild panic within the first place ! Positively not a treatment. Extra like a protecting up, or masking of underlying issues that also needed to be handled. My poor doctor back then, may solely work with what his coaching taught him. He, like numerous others world wide, did his greatest for his patient.<br><br>Decreased integrity of the blood-mind barrier together with the absence of certain protease enzymes. Latest "smoking gun" evidence confirms older and heretofore controversial behavioral research on the effects of weight loss program in some circumstances of schizophrenia and autism. Researchers demonstrated in 1999 that milk and grain proteins which flow into at hundred-fold levels in the blood of many schizophrenic and autistic individuals also focus in 32 areas of mind tissue, though it was previously thought inconceivable for such complicated food proteins to cross the blood-brain barrier. The same research implicates lack of sure digestive enzymes and the presence of immune system responses to the proteins in query.<br><br>You would possibly be capable to cut back the probabilities of experiencing this condition by following some simple tips. Reducing the quantity of stress and anxiety in your life can definitely make a distinction. Try calming music before going to bed and do not worry your self about how to lose weight fast everyday conditions. Remember worrying doesn't resolve any drawback, it'll just cause extra. If you are suffering with anxiousness and/or melancholy, contemplate counseling and remedy. It really works! You will most likely be pleasantly stunned to search out that you may benefit from just a few periods with a trained skilled, and take away tools that you need to use for a lifetime. Youngsters & Marathons Half 3 of 6 by miriamkathleenb three weeks, 6 hours ago Stop by my web blog; the way to stop loud night breathing home treatments |
| In [[geometry]] an '''arrangement of lines''' is the [[Partition of a set|partition]] of the [[Plane (geometry)|plane]] formed by a collection of [[Line (geometry)|lines]]. Bounds on the complexity of arrangements have been studied in [[discrete geometry]], and [[computational geometry|computational geometers]] have found algorithms for the efficient construction of arrangements.
| |
| | |
| ==Definition==
| |
| 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<ref>For an arrangement to be locally finite, every bounded subset of the plane may be crossed by only finitely many lines.</ref> the [[equivalence class]]es of this relation are of three types:
| |
| #the interiors of bounded or unbounded convex polygons (the ''cells'' of the arrangement), the [[Connected component (topology)|connected components]] of the subset of the plane not contained in any of the lines of ''A'',
| |
| #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
| |
| #single points (the ''[[vertex (geometry)|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.<ref>{{harvtxt|Grünbaum|1972}}, page 4.</ref>
| |
| | |
| ==Complexity of arrangements==
| |
| 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.<ref>{{harvtxt|Steiner|1826}}; {{harvtxt|Agarwal|Sharir|2000}}.</ref>
| |
| An arrangement with ''n'' lines has at most [[triangular number|''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,<ref>For cells in which there is a horizontal bottom edge, choose the bottommost vertex to be the right endpoint of the bottom edge.</ref> 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 ''n''<sup>2</sup>, 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.
| |
| | |
| {{anchor|Zone theorem}}
| |
| 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 5''n'' − 1,<ref name="zone">{{harvtxt|Chazelle|Guibas|Lee|1985}}, {{harvtxt|Edelsbrunner|1987}}, {{harvtxt|Edelsbrunner|O'Rourke|Seidel|1986}}.</ref> and the total number of edges of the cells belonging to both sides of ''l'' is at most <math>\lfloor 9.5n\rfloor-1</math>.<ref name="bepy">{{harvtxt|Bern|Eppstein|Plassman|Yao|1991}}.</ref> 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 [[Ackermann function|inverse Ackermann function]], as may be shown using [[Davenport–Schinzel sequence]]s.<ref name="bepy"/> Summing the complexities of all zones, one finds that the sum of squares of cell complexities in an arrangement is O(''n''<sup>2</sup>).<ref>{{harvtxt|Aronov|Matoušek|Sharir|1994}}.</ref>
| |
| | |
| The [[K-set (geometry)|''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(''nk''<sup>1/3</sup>), while the best lower bound is Ω(''n'' exp(''c'' (log''k'')<sup>1/2</sup>)).<ref>{{harvtxt|Dey|1998}}; {{harvtxt|Toth|2001}}. The problem of bounding the complexity of ''k''-levels was first studied by {{harvtxt|Lovász|1971}} and {{harvtxt|Erdős|Lovász|Simmons|Straus|1973}}.</ref> In contrast, the maximum complexity of the ≤''k''-level is known to be Θ(''nk'').<ref>{{harvtxt|Alon|Győri|1986}}.</ref> 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 Ω(''n''<sup>2 − o(1)</sup>).<ref>{{harvtxt|Balogh|Regev|Smyth|Steiger|2004}}; see also {{harvtxt|Matoušek|1991}}.</ref>
| |
| | |
| 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 Θ(''m''<sup>2/3</sup>''n''<sup>2/3</sup> + ''n''),<ref>{{harvtxt|Canham|1969}}; {{harvtxt|Clarkson|Edelsbrunner|Guibas|Sharir|1990}}.</ref> 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 (graph theory)|crossing number inequality]]:<ref>{{harvtxt|Ajtai|Chvátal|Newborn|Szemerédi|1982}}; {{harvtxt|Leighton|1983}}.</ref> 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(''n''<sup>2</sup>) crossings in this drawing. However, by the crossing number inequality, there are Ω(''x''<sup>3</sup>/''m''<sup>2</sup>) crossings; in order to satisfy both bounds, ''x'' must be O(''m''<sup>2/3</sup>''n''<sup>2/3</sup>).<ref>{{harvtxt|Székely|1997}}.</ref>
| |
| | |
| ==Projective arrangements and projective duality==
| |
| 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 {{harvtxt|Melchior|1940}}, uses the [[Euler characteristic]] to show that such a vertex must always exist.
| |
| | |
| ==Triangles in arrangements==
| |
| 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.<ref>{{harvtxt|Melchior|1940}}; {{harvtxt|Grünbaum|2005}}.</ref> Three infinite families of simplicial line arrangements are known:
| |
| #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,
| |
| #The family of lines formed by the sides of a [[regular polygon]] together with its [[axis of symmetry|axes of symmetry]], and
| |
| #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.<ref>{{harvtxt|Grünbaum|1972}}; {{harvtxt|Grünbaum|2005}}.</ref>
| |
| As Grünbaum<ref>{{harvtxt|Grünbaum|2005}}</ref> writes, simplicial arrangements “appear as examples or counterexamples in many contexts of combinatorial geometry and its applications.” For instance, {{harvtxt|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 equation]]s 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.<ref>{{harvtxt|Crowe|McKee|1968}}; {{harvtxt|Dirac|1951}}; {{harvtxt|Kelly|Moser|1958}}; {{harvtxt|Grünbaum|1972}}, page 18.</ref>
| |
| | |
| 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 [[bitvector]]s 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.<ref>{{harvtxt|Eppstein|Falmagne|Ovchinnikov|2007}}.</ref> Dual graphs of simplicial arrangements have been used to construct infinite families of [[cubic graph|3-regular]] partial cubes, isomorphic to the graphs of [[zonohedron|simple zonohedra]].<ref>{{harvtxt|Eppstein|2006}}.</ref>
| |
| | |
| 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.<ref>{{harvtxt|Grünbaum|1972}}; {{harvtxt|Levi|1926}}; {{harvtxt|Roudneff|1988}}.</ref> 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 2''n''-gon.<ref>{{harvtxt|Füredi|Palásti|1984}}; {{harvtxt|Grünbaum|1972}}.</ref> For non-simple arrangements the maximum number of triangles is similar but more tightly bounded.<ref>{{harvtxt|Purdy|1979}}; {{harvtxt|Purdy|1980}}; {{harvtxt|Strommer|1977}}.</ref> 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==
| |
| [[File:Tiling Dual Semiregular V4-6-12 Bisected Hexagonal.svg|thumb|The [[bisected hexagonal tiling]].]]
| |
| The dual graph of a simple line arrangement may be represented geometrically as a collection of [[rhombus|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. {{harvtxt|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 tiling]]s. 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 tiling]]s.
| |
| | |
| 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==
| |
| ''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(''n''<sup>2</sup>).<ref name="zone"/> 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(''n''<sup>2</sup>) and space O(''n''), by an algorithmic technique known as ''topological sweeping''.<ref>{{harvtxt|Edelsbrunner|Guibas|1989}}.</ref> 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.<ref>{{harvtxt|Fortune|Milenkovic|1991}}; {{harvtxt|Greene|Yao|1986}}; {{harvtxt|Milenkovic|1989}}.</ref> | |
| | |
| As well, researchers have studied efficient algorithms for constructing smaller portions of an arrangement, such as zones,<ref>{{harvtxt|Aharoni|Halperin|Hanniel|Har-Peled|1999}}.</ref> ''k''-levels,<ref>{{harvtxt|Agarwal|de Berg|Matoušek|Schwarzkopf|1998}}; {{harvtxt|Chan|1999}}; {{harvtxt|Cole|Sharir|Yap|1987}}; {{harvtxt|Edelsbrunner|Welzl|1986}}.</ref> or the set of cells containing a given set of points.<ref>{{harvtxt|Agarwal|1990}}; {{harvtxt|Agarwal|Matoušek|Sharir|1998}}; {{harvtxt|Edelsbrunner|Guibas|Sharir|1990}}.</ref> 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.<ref>{{harvtxt|Cole|Salowe|Steiger|Szemerédi|1989}}.</ref>
| |
| | |
| Marc van Kreveld suggested the algorithmic problem of computing [[shortest path]]s 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.<ref>{{harvtxt|Erickson|1997}}.</ref> An [[approximation algorithm]] is known,<ref>{{harvtxt|Bose|Evans|Kirkpatrick|McAllister|1996}}.</ref> 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),<ref>{{harvtxt|Eppstein|Hart|1999}}.</ref> but the general problem remains open.
| |
| | |
| ==Other types of arrangement==
| |
| | |
| {{multiple images
| |
| <!-- Essential parameters -->
| |
| | align = center
| |
| | direction = horizontal
| |
| | image1 = Pappos_pseudo.svg
| |
| | width1 = 383
| |
| | caption1 = 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.
| |
| | |
| | image2 = Ageev 5X circle graph.svg
| |
| | width2 = 300
| |
| | caption2 = A hyperbolic line arrangement combinatorially equivalent to a chord diagram used by {{harvtxt|Ageev|1996}} to show that [[triangle-free graph|triangle-free]] [[circle graph]]s may sometimes need [[graph coloring|5 colors]].
| |
| }}
| |
| | |
| | |
| A pseudoline arrangement is a family of [[curve]]s that share similar [[topology|topological]] properties with a line arrangement.<ref>{{harvtxt|Grünbaum|1972}}; {{harvtxt|Agarwal|Sharir|2002}}.</ref> These can be defined most simply in the [[projective plane]] as [[simple closed curve]]s any two of which meet in a single crossing point.<ref>This definition is from {{harvtxt|Grünbaum|1972}}. For a comparison of alternative definitions of pseudolines, see {{harvtxt|Eppstein|Falmagne|Ovchinnikov|2007}}.</ref> A pseudoline arrangement is said to be ''stretchable'' if it is combinatorially equivalent to a line arrangement; it is [[Complete (complexity)|complete]] for the [[existential theory of the reals]] to distinguish stretchable arrangements from non-stretchable ones.<ref>{{harvtxt|Shor|1991}}; {{harvtxt|Schaefer|2010}}.</ref>
| |
| | |
| Arrangements of lines in the [[Hyperbolic space|hyperbolic plane]] have also been studied. 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, in hyperbolic line arrangements lines may avoid crossing each other without being parallel; the [[intersection graph]] of the lines in a hyperbolic arrangement is a [[circle graph]]. The corresponding concept to hyperbolic line arrangements for pseudolines is a ''weak pseudoline arrangement'',<ref>{{harvtxt|de Fraysseix|Ossona de Mendez|2003}}.</ref> a family of curves having the same topological properties as lines<ref>Here an alternative definition from {{harvtxt|Shor|1991}}, that a pseudoline is the image of a line under a [[homeomorphism]] of the plane, is appropriate.</ref> such that any two curves in the family either meet in a single crossing point or have no intersection.
| |
| | |
| More generally, geometers have studied arrangements of other types of curves in the plane, [[Arrangement of hyperplanes|arrangements of hyperplanes]] in higher dimensional spaces, and of other more complicated types of surface.<ref name="as00">{{harvtxt|Agarwal|Sharir|2000}}.</ref> Arrangements in [[complex number|complex]] [[vector space]]s 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.<ref>{{harvtxt|Orlik|Terao|1992}}.</ref>
| |
| | |
| ==See also==
| |
| *[[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.
| |
| | |
| ==Notes==
| |
| {{reflist|2}}
| |
| | |
| ==References==
| |
| {{refbegin|2}}
| |
| *{{citation
| |
| | last = Agarwal | first = P. K.
| |
| | doi = 10.1007/BF02187809
| |
| | issue = 1
| |
| | journal = [[Discrete and Computational Geometry]]
| |
| | pages = 533–573
| |
| | title = Partitioning arrangements of lines II: Applications
| |
| | volume = 5
| |
| | year = 1990}}.
| |
| *{{citation
| |
| | last1 = Agarwal | first1 = P. K.
| |
| | last2 = de Berg | first2 = M.
| |
| | last3 = Matoušek | first3 = J. | author3-link = Jiří Matoušek (mathematician)
| |
| | last4 = Schwarzkopf | first4 = O.
| |
| | doi = 10.1137/S0097539795281840
| |
| | issue = 3
| |
| | journal = SIAM Journal on Computing
| |
| | pages = 654–667
| |
| | title = Constructing levels in arrangements and higher order Voronoi diagrams
| |
| | volume = 27
| |
| | year = 1998}}.
| |
| *{{citation
| |
| | last1 = Agarwal | first1 = P. K.
| |
| | last2 = Matoušek | first2 = J. | author2-link = Jiří Matoušek (mathematician)
| |
| | last3 = Sharir | first3 = M. | author3-link = Micha Sharir
| |
| | doi = 10.1137/S009753979426616X
| |
| | issue = 2
| |
| | journal = SIAM Journal on Computing
| |
| | pages = 491–505
| |
| | title = Computing many faces in arrangements of lines and segments
| |
| | volume = 27
| |
| | year = 1998}}.
| |
| *{{citation
| |
| | last1 = Agarwal | first1 = P. K. | author1-link = Pankaj K. Agarwal
| |
| | last2 = Sharir | first2 = M. | author2-link = Micha Sharir
| |
| | contribution = Arrangements and their applications
| |
| | editor1-last = Sack | editor1-first = J.-R. | editor1-link = Jörg-Rüdiger Sack
| |
| | editor2-last = Urrutia | editor2-first = J.
| |
| | pages = 49–119
| |
| | publisher = Elsevier
| |
| | title = Handbook of Computational Geometry
| |
| | url = http://biogeometry.duke.edu/pubs-pankaj/surveys/arrangement-survey.ps.gz
| |
| | year = 2000}}.
| |
| *{{citation
| |
| | last1 = Agarwal | first1 = P. K.
| |
| | last2 = Sharir | first2 = M. | author2-link = Micha Sharir
| |
| | contribution = Pseudo-line arrangements: duality, algorithms, and applications
| |
| | location = San Francisco
| |
| | pages = 800–809
| |
| | publisher = Society for Industrial and Applied Mathematics
| |
| | title = Proc. 13th ACM-SIAM Symp. Discrete algorithms (SODA '02)
| |
| | url = http://portal.acm.org/citation.cfm?id=545486
| |
| | year = 2002}}.
| |
| *{{citation
| |
| | doi = 10.1016/0012-365X(95)00349-2
| |
| | last = Ageev | first = A. A.
| |
| | journal = Discrete Math.
| |
| | pages = 295–298
| |
| | title = A triangle-free circle graph with chromatic number 5
| |
| | volume = 152
| |
| | year = 1996}}.
| |
| *{{citation
| |
| | last1 = Aharoni | first1 = Y.
| |
| | last2 = Halperin | first2 = D.
| |
| | last3 = Hanniel | first3 = I.
| |
| | last4 = Har-Peled | first4 = S.
| |
| | last5 = Linhart | first5 = C.
| |
| | contribution = On-line zone construction in arrangements of lines in the plane
| |
| | doi = 10.1007/3-540-48318-7_13
| |
| | pages = 139–153
| |
| | publisher = Springer-Verlag
| |
| | series = Lecture Notes in Computer Science
| |
| | title = Proc. 3rd Int. Worksh. Algorithm Engineering (WAE '99)
| |
| | volume = 1668
| |
| | year = 1999}}.
| |
| *{{citation
| |
| | last1 = Ajtai | first1 = M.
| |
| | last2 = Chvátal | first2 = V. | author2-link = Václav Chvátal
| |
| | last3 = Newborn | first3 = M.
| |
| | last4 = Szemerédi | first4 = E. | author4-link = Endre Szemerédi
| |
| | contribution = Crossing-free subgraphs
| |
| | pages = 9–12
| |
| | series = North-Holland Mathematics Studies
| |
| | volume = 60
| |
| | publisher = North-Holland
| |
| | title = Theory and Practice of Combinatorics
| |
| | year = 1982
| |
| | mr = 0806962}}.
| |
| *{{citation
| |
| | last1 = Alon | first1 = N. | author1-link = Noga Alon
| |
| | last2 = Győri | first2 = E.
| |
| | doi = 10.1016/0097-3165(86)90122-6
| |
| | journal = Journal of Combinatorial Theory, Series A
| |
| | pages = 154–157
| |
| | title = The number of small semi-spaces of a finite set of points in the plane
| |
| | volume = 41
| |
| | year = 1986}}.
| |
| *{{citation
| |
| | last1 = Aronov | first1 = B. | author1-link = Boris Aronov
| |
| | last2 = Matoušek | first2 = J. | author2-link = Jiří Matoušek (mathematician)
| |
| | last3 = Sharir | first3 = M. | author3-link = Micha Sharir
| |
| | doi = 10.1016/0097-3165(94)90027-2
| |
| | issue = 2
| |
| | journal = Journal of Combinatorial Theory, Series A
| |
| | pages = 311–321
| |
| | title = On the sum of squares of cell complexities in hyperplane arrangements
| |
| | volume = 65
| |
| | year = 1994}}
| |
| *{{citation
| |
| | doi = 10.2140/pjm.1998.184.207
| |
| | last1 = Artés | first1 = J. C.
| |
| | last2 = Grünbaum | first2 = B. | author2-link = Branko Grünbaum
| |
| | last3 = Llibre | first3 = J.
| |
| | issue = 2
| |
| | journal = Pacific Journal of Mathematics
| |
| | pages = 207–230
| |
| | title = On the number of invariant straight lines for polynomial differential systems
| |
| | url = http://pjm.math.berkeley.edu/pjm/1998/184-2/pjm-v184-n2-p02-p.pdf
| |
| | volume = 184
| |
| | year = 1998}}.
| |
| *{{citation
| |
| | last1 = Balogh | first1 = J.
| |
| | last2 = Regev | first2 = O.
| |
| | last3 = Smyth | first3 = C.
| |
| | last4 = Steiger | first4 = W.
| |
| | last5 = Szegedy | first5 = M.
| |
| | doi = 10.1007/s00454-004-1119-1
| |
| | issue = 2
| |
| | journal = [[Discrete and Computational Geometry]]
| |
| | pages = 167–176
| |
| | title = Long monotone paths in line arrangements
| |
| | volume = 32
| |
| | year = 2004}}.
| |
| *{{citation
| |
| | last1 = Bern | first1 = M. W.
| |
| | last2 = Eppstein | first2 = D. | author2-link = David Eppstein
| |
| | last3 = Plassman | first3 = P. E.
| |
| | last4 = Yao | first4 = F. F. | author4-link = Frances Yao
| |
| | contribution = Horizon theorems for lines and polygons
| |
| | edition = 6
| |
| | editor1-last = Goodman | editor1-first = J. E. | editor1-link = Jacob E. Goodman
| |
| | editor2-last = Pollack | editor2-first = R.
| |
| | editor3-last = Steiger | editor3-first = W.
| |
| | pages = 45–66
| |
| | publisher = Amer. Math. Soc.
| |
| | series = DIMACS Ser. Discrete Math. and Theoretical Computer Science
| |
| | title = Discrete and Computational Geometry: Papers from the DIMACS Special Year
| |
| | year = 1991
| |
| | mr = 92j:52023}}.
| |
| *{{citation
| |
| | last1 = Bose | first1 = P.
| |
| | last2 = Evans | first2 = W.
| |
| | last3 = Kirkpatrick | first3 = D. G.
| |
| | last4 = McAllister | first4 = M.
| |
| | last5 = Snoeyink | first5 = J.
| |
| | contribution = Approximating shortest paths in arrangements of lines
| |
| | pages = 143–148
| |
| | title = Proc. 8th Canadian Conf. Computational Geometry
| |
| | year = 1996}}.
| |
| *{{citation
| |
| | last = de Bruijn | first = N. G. | author-link = Nicolaas Govert de Bruijn
| |
| | journal = [[Indagationes Mathematicae]]
| |
| | pages = 38–66
| |
| | title = Algebraic theory of Penrose's non-periodic tilings of the plane
| |
| | url = http://alexandria.tue.nl/repository/freearticles/597566.pdf
| |
| | volume = 43
| |
| | year = 1981}}.
| |
| *{{citation
| |
| | doi = 10.1007/BF02788872
| |
| | last = Canham | first = R.
| |
| | journal = Israel J. Math.
| |
| | pages = 393–397
| |
| | title = A theorem on arrangements of lines in the plane
| |
| | volume = 7
| |
| | year = 1969
| |
| | issue = 4}}.
| |
| *{{citation
| |
| | last = Chan | first = T. | author-link = Timothy M. Chan
| |
| | title = Remarks on ''k''-level algorithms in the plane
| |
| | url = http://www.cs.uwaterloo.ca/~tmchan/lev2d_7_7_99.ps.gz
| |
| | year = 1999}}.
| |
| *{{citation
| |
| | last1 = Chazelle | first1 = B. | author1-link = Bernard Chazelle
| |
| | last2 = Guibas | first2 = L. J. | author2-link = Leonidas J. Guibas
| |
| | last3 = Lee | first3 = D. T. | author3-link = Der-Tsai Lee
| |
| | doi = 10.1007/BF01934990
| |
| | issue = 1
| |
| | journal = BIT
| |
| | pages = 76–90
| |
| | title = The power of geometric duality
| |
| | volume = 25
| |
| | year = 1985}}.
| |
| *{{citation
| |
| | last1 = Clarkson | first1 = K. | author1-link = Kenneth L. Clarkson
| |
| | last2 = Edelsbrunner | first2 = H. | author2-link = Herbert Edelsbrunner
| |
| | last3 = Guibas | first3 = L. J. | author3-link = Leonidas J. Guibas
| |
| | last4 = Sharir | first4 = M. | author4-link = Micha Sharir
| |
| | last5 = Welzl | first5 = E. | author5-link = Emo Welzl
| |
| | doi = 10.1007/BF02187783
| |
| | issue = 1
| |
| | journal = [[Discrete and Computational Geometry]]
| |
| | pages = 99–160
| |
| | title = Combinatorial complexity bounds for arrangements of curves and spheres
| |
| | volume = 5
| |
| | year = 1990}}.
| |
| *{{citation
| |
| | last1 = Cole | first1 = Richard
| |
| | last2 = Salowe | first2 = Jeffrey S.
| |
| | last3 = Steiger | first3 = W. L.
| |
| | last4 = Szemerédi | first4 = Endre | author4-link = Endre Szemerédi
| |
| | doi = 10.1137/0218055
| |
| | issue = 4
| |
| | journal = [[SIAM Journal on Computing]]
| |
| | mr = 1004799
| |
| | pages = 792–810
| |
| | title = An optimal-time algorithm for slope selection
| |
| | volume = 18
| |
| | year = 1989}}.
| |
| *{{citation
| |
| | last1 = Cole | first1 = R.
| |
| | last2 = Sharir | first2 = M. | author2-link = Micha Sharir
| |
| | last3 = Yap | first3 = C.-K.
| |
| | doi = 10.1137/0216005
| |
| | issue = 1
| |
| | journal = SIAM Journal on Computing
| |
| | pages = 61–77
| |
| | title = On ''k''-hulls and related problems
| |
| | volume = 16
| |
| | year = 1987}}.
| |
| *{{citation
| |
| | doi = 10.2307/2687957
| |
| | last1 = Crowe | first1 = D. W.
| |
| | last2 = McKee | first2 = T. A.
| |
| | issue = 1
| |
| | journal = [[Mathematics Magazine]]
| |
| | pages = 30–34
| |
| | title = Sylvester's problem on collinear points
| |
| | volume = 41
| |
| | year = 1968
| |
| | publisher = Mathematical Association of America
| |
| | jstor = 2687957}}.
| |
| *{{citation
| |
| | last = Dey | first = T. L.
| |
| | doi = 10.1007/PL00009354
| |
| | issue = 3
| |
| | journal = [[Discrete and Computational Geometry]]
| |
| | pages = 373–382
| |
| | title = Improved bounds for planar ''k''-sets and related problems
| |
| | volume = 19
| |
| | year = 1998
| |
| | mr = 1608878}}.
| |
| *{{citation
| |
| | last = Dirac | first = G. | author-link = Gabriel Andrew Dirac
| |
| | doi = 10.1093/qmath/2.1.221
| |
| | journal = Quart. J. Math.
| |
| | pages = 221–227
| |
| | title = Collinearity properties of sets of points
| |
| | volume = 2
| |
| | year = 1951}}.
| |
| *{{citation
| |
| | last = Edelsbrunner | first = H. | author-link = Herbert Edelsbrunner
| |
| | isbn = 978-3-540-13722-1
| |
| | publisher = Springer-Verlag
| |
| | series = EATCS Monographs in Theoretical Computer Science
| |
| | title = Algorithms in Combinatorial Geometry
| |
| | year = 1987}}.
| |
| *{{citation
| |
| | last1 = Edelsbrunner | first1 = H. | author1-link = Herbert Edelsbrunner
| |
| | last2 = Guibas | first2 = L. J. | author2-link = Leonidas J. Guibas
| |
| | doi = 10.1016/0022-0000(89)90038-X
| |
| | issue = 1
| |
| | journal = Journal of Computer and System Sciences
| |
| | pages = 165–194
| |
| | title = Topologically sweeping an arrangement
| |
| | volume = 38
| |
| | year = 1989}}.
| |
| *{{citation
| |
| | last1 = Edelsbrunner | first1 = H. | author1-link = Herbert Edelsbrunner
| |
| | last2 = Guibas | first2 = L. J. | author2-link = Leonidas J. Guibas
| |
| | last3 = Sharir | first3 = M. | author3-link = Micha Sharir
| |
| | doi = 10.1007/BF02187784
| |
| | issue = 1
| |
| | journal = [[Discrete and Computational Geometry]]
| |
| | pages = 161–196
| |
| | title = The complexity and construction of many faces in arrangements of lines and of segments
| |
| | volume = 5
| |
| | year = 1990}}.
| |
| *{{citation
| |
| | last1 = Edelsbrunner | first1 = H. | author1-link = Herbert Edelsbrunner
| |
| | last2 = O'Rouke | first2 = J. | author2-link = Joseph O'Rourke (professor)
| |
| | last3 = Seidel | first3 = R. | author3-link = Raimund Seidel
| |
| | doi = 10.1137/0215024
| |
| | issue = 2
| |
| | journal = SIAM Journal on Computing
| |
| | pages = 341–363
| |
| | title = Constructing arrangements of lines and hyperplanes with applications
| |
| | volume = 15
| |
| | year = 1986}}.
| |
| *{{citation
| |
| | last1 = Edelsbrunner | first1 = H. | author1-link = Herbert Edelsbrunner
| |
| | last2 = Welzl | first2 = E. | author2-link = Emo Welzl
| |
| | doi = 10.1137/0215019
| |
| | issue = 1
| |
| | journal = SIAM Journal on Computing
| |
| | pages = 271–284
| |
| | title = Constructing belts in two-dimensional arrangements with applications
| |
| | volume = 15
| |
| | year = 1986}}.
| |
| *{{citation
| |
| | last = Eppstein | first = D. | author-link = David Eppstein
| |
| | year = 2006
| |
| | issue = 1, R79
| |
| | journal = Electronic J. Combinatorics
| |
| | pages = 1–14
| |
| | title = Cubic partial cubes from simplicial arrangements
| |
| | url = http://www.combinatorics.org/Volume_13/Abstracts/v13i1r79.html
| |
| | volume = 13
| |
| | arxiv = math.CO/0510263
| |
| | mr = 2255421}}.
| |
| *{{citation
| |
| | last1 = Eppstein | first1 = D. | author1-link = David Eppstein
| |
| | last2 = Falmagne | first2 = J.-Cl. | author2-link = Jean-Claude Falmagne
| |
| | last3 = Ovchinnikov | first3 = S.
| |
| | publisher = Springer-Verlag
| |
| | title = Media Theory
| |
| | year = 2007}}.
| |
| *{{citation
| |
| | last1 = Eppstein | first1 = D. | author1-link = David Eppstein
| |
| | last2 = Hart | first2 = D.
| |
| | contribution = Shortest paths in an arrangement with ''k'' line orientations
| |
| | year = 1999
| |
| | pages = 310–316
| |
| | title = Proc. 10th ACM/SIAM Symp. Discrete Algorithms (SODA '99)
| |
| | url = http://portal.acm.org/citation.cfm?id=314580}}.
| |
| *{{citation
| |
| | last1 = Erdős | first1 = P. | author1-link = Paul Erdős
| |
| | last2 = Lovász | first2 = L. | author2-link = László Lovász
| |
| | last3 = Simmons | first3 = A.
| |
| | last4 = Straus | first4 = E. G. | author4-link = Ernst G. Straus
| |
| | contribution = Dissection graphs of planar point sets
| |
| | location = Amsterdam
| |
| | pages = 139–149
| |
| | publisher = North-Holland
| |
| | title = A Survey of Combinatorial Theory (Proc. Internat. Sympos., Colorado State Univ., Fort Collins, Colo., 1971)
| |
| | year = 1973
| |
| | mr = 0363986}}.
| |
| *{{citation
| |
| | last = Erickson | first = J.
| |
| | title = Shortest paths in line arrangements
| |
| | url = http://compgeom.cs.uiuc.edu/~jeffe/open/algo.html#shortpath
| |
| | year = 1997}}.
| |
| *{{citation
| |
| | last1 = Fortune | first1 = S.
| |
| | last2 = Milenkovic | first2 = V.
| |
| | contribution = Numerical stability of algorithms for line arrangements
| |
| | doi = 10.1145/109648.109685
| |
| | pages = 334–341
| |
| | title = Proc. 7th ACM Symp. Computational Geometry (SoCG '91)
| |
| | year = 1991}}.
| |
| *{{citation
| |
| | last1 = de Fraysseix | first1 = H.
| |
| | last2 = Ossona de Mendez | first2 = P.
| |
| | contribution = Stretching of Jordan arc contact systems
| |
| | edition = 2912
| |
| | pages = 71–85
| |
| | publisher = Springer-Verlag
| |
| | series = Lecture Notes in Computer Science
| |
| | title = [[International Symposium on Graph Drawing|Proc. 11th Int. Symp. Graph Drawing (GD 2003)]]
| |
| | year = 2003}}.
| |
| *{{citation
| |
| | last1 = Füredi | first1 = Z. | authorlink = Zoltán Füredi
| |
| | last2 = Palásti | first2 = I.
| |
| | issue = 4
| |
| | journal = Proceedings of the American Mathematical Society
| |
| | pages = 561–566
| |
| | title = Arrangements of lines with a large number of triangles
| |
| | url = http://www.math.uiuc.edu/~z-furedi/PUBS/furedi_palasti_lines.pdf
| |
| | volume = 92
| |
| | year = 1984}}
| |
| *{{citation
| |
| | last1 = Greene | first1 = D.
| |
| | last2 = Yao | first2 = F. F. | author2-link = Frances Yao
| |
| | contribution = Finite-resolution computational geometry
| |
| | doi = 10.1109/SFCS.1986.19
| |
| | pages = 143–152
| |
| | title = Proc. 27th IEEE Symp. Foundations of Computer Science
| |
| | year = 1986}}.
| |
| *{{citation
| |
| | last = Grünbaum | first = B. | author-link = Branko Grünbaum
| |
| | location = Providence, R.I.
| |
| | publisher = American Mathematical Society
| |
| | series = Regional Conference Series in Mathematics
| |
| | title = Arrangements and Spreads
| |
| | volume = 10
| |
| | year = 1972}}.
| |
| *{{citation
| |
| | last = Grünbaum | first = B. | author-link = Branko Grünbaum
| |
| | title = A catalogue of simplicial arrangements in the real projective plane
| |
| | url = http://digital.lib.washington.edu/dspace/handle/1773/2269
| |
| | year = 2005}}.
| |
| *{{citation
| |
| | doi = 10.4153/CJM-1958-024-6
| |
| | last1 = Kelly | first1 = L. M. | author1-link = Leroy Milton Kelly
| |
| | last2 = Moser | first2 = W. O. J.
| |
| | journal = Canad. J. Math.
| |
| | pages = 210–219
| |
| | title = On the number of ordinary lines determined by ''n'' points
| |
| | volume = 10
| |
| | year = 1958}}.
| |
| *{{citation
| |
| | last = Leighton | first = F. T. | author-link = F. Thomson Leighton
| |
| | location = Cambridge, MA
| |
| | publisher = MIT Press
| |
| | series = Foundations of Computing Series
| |
| | title = Complexity Issues in VLSI
| |
| | year = 1983}}.
| |
| *{{citation
| |
| | last = Levi | first = F. | authorlink = Friedrich Wilhelm Levi
| |
| | journal = Ber. Math.-Phys. Kl. Sächs. Akad. Wiss. Leipzig
| |
| | pages = 256–267
| |
| | title = Die Teilung der projektiven Ebene durch Gerade oder Pseudogerade
| |
| | volume = 78
| |
| | year = 1926}}.
| |
| *{{citation
| |
| | last = Lovász | first = L. | author-link = László Lovász
| |
| | journal = Annales Universitatis Scientiarum Budapestinensis de Rolando Eőtvős Nominatae Sectio Mathematica
| |
| | pages = 107–108
| |
| | title = On the number of halving lines
| |
| | volume = 14
| |
| | year = 1971}}.
| |
| *{{citation
| |
| | last = Matoušek | first = J. | authorlink = Jiří Matoušek (mathematician)
| |
| | doi = 10.1007/BF02574679
| |
| | issue = 1
| |
| | journal = [[Discrete and Computational Geometry]]
| |
| | pages = 129–134
| |
| | title = Lower bounds on the length of monotone paths in arrangements
| |
| | volume = 6
| |
| | year = 1991}}.
| |
| *{{citation
| |
| | last = Melchior | first = E.
| |
| | journal = [[Deutsche Mathematik]]
| |
| | pages = 461–475
| |
| | title = Über Vielseite der projektiven Ebene
| |
| | volume = 5
| |
| | year = 1940}}.
| |
| *{{citation
| |
| | last = Milenkovic | first = V.
| |
| | contribution = Double precision geometry: a general technique for calculating line and segment intersections using rounded arithmetic
| |
| | doi = 10.1109/SFCS.1989.63525
| |
| | pages = 500–505
| |
| | title = Proc. 30th IEEE Symp. Foundations of Computer Science (FOCS '89)
| |
| | year = 1989}}.
| |
| *{{citation
| |
| | last = Motzkin
| |
| | first = Th.
| |
| | authorlink = Theodore Motzkin
| |
| | publisher = American Mathematical Society
| |
| | journal = Transactions of the American Mathematical Society
| |
| | jstor = 1990609
| |
| | volume = 70
| |
| | issue = 3
| |
| | pages = 451–464
| |
| | title = The Lines and Planes Connecting the Points of a Finite Set
| |
| | year = 1951
| |
| }}.
| |
| *{{citation
| |
| | last1 = Orlik | first1 = P.
| |
| | last2 = Terao | first2 = H.
| |
| | publisher = Springer-Verlag
| |
| | series = Grundlehren der mathematischen Wissenschaften
| |
| | title = Arrangements of Hyperplanes
| |
| | volume = 300
| |
| | year = 1992}}.
| |
| *{{citation
| |
| | doi = 10.1016/0012-365X(79)90018-9
| |
| | last = Purdy | first = G. B.
| |
| | journal = Discrete Math.
| |
| | pages = 157–163
| |
| | title = Triangles in arrangements of lines
| |
| | volume = 25
| |
| | year = 1979
| |
| | issue = 2}}.
| |
| *{{citation
| |
| | last = Purdy | first = G. B.
| |
| | journal = Proceedings of the American Mathematical Society
| |
| | pages = 77–81
| |
| | title = Triangles in arrangements of lines, II
| |
| | volume = 79
| |
| | year = 1980
| |
| | doi = 10.1090/S0002-9939-1980-0560588-4}}.
| |
| *{{citation
| |
| | last = Roudneff | first = J.-P.
| |
| | doi = 10.1007/BF02187900
| |
| | issue = 1
| |
| | journal = [[Discrete and Computational Geometry]]
| |
| | pages = 97–102
| |
| | title = Arrangements of lines with a minimum number of triangles are simple
| |
| | volume = 3
| |
| | year = 1988}}.
| |
| *{{citation|first=Marcus|last=Schaefer|contribution=Complexity of some geometric and topological problems|url=http://ovid.cs.depaul.edu/documents/convex.pdf|title=[[International Symposium on Graph Drawing|Graph Drawing, 17th International Symposium, GS 2009, Chicago, IL, USA, September 2009, Revised Papers]]|series=Lecture Notes in Computer Science|publisher=Springer-Verlag|volume=5849|pages=334–344|doi=10.1007/978-3-642-11805-0_32|year=2010}}.
| |
| *{{citation
| |
| | last = Shor | first = P. W. | authorlink = Peter Shor
| |
| | contribution = Stretchability of pseudolines is NP-hard
| |
| | editor1-last = Gritzmann | editor1-first = P.
| |
| | editor2-last = Sturmfels | editor2-first = B.
| |
| | location = Providence, R.I.
| |
| | pages = 531–554
| |
| | publisher = American Mathematical Society
| |
| | series = DIMACS Series in Discrete Mathematics and Theoretical Computer Science
| |
| | title = Applied Geometry and Discrete Mathematics: The [[Victor Klee]] Festschrift
| |
| | volume = 4
| |
| | year = 1991}}.
| |
| *{{citation
| |
| | last = Steiner | first = J. | author-link = Jakob Steiner
| |
| | journal = [[Crelle's Journal|J. Reine Angew. Math.]]
| |
| | pages = 349–364
| |
| | title = Einige Gesetze über die Theilung der Ebene und des Raumes
| |
| | volume = 1
| |
| | year = 1826}}.
| |
| *{{citation
| |
| | doi = 10.1016/0097-3165(77)90022-X
| |
| | last = Strommer | first = T. O.
| |
| | journal = Journal of Combinatorial Theory, Series A
| |
| | pages = 314–320
| |
| | title = Triangles in arrangements of lines
| |
| | volume = 23
| |
| | year = 1977
| |
| | issue = 3}}.
| |
| *{{citation
| |
| | last = Székely | first = L. A.
| |
| | doi = 10.1017/S0963548397002976
| |
| | issue = 3
| |
| | journal = Combinatorics, Probability and Computing
| |
| | pages = 353–358
| |
| | title = Crossing numbers and hard Erdős problems in discrete geometry
| |
| | volume = 6
| |
| | year = 1997}}.
| |
| *{{citation
| |
| | last = Tóth | first = G.
| |
| | doi = 10.1007/s004540010022
| |
| | issue = 2
| |
| | journal = [[Discrete and Computational Geometry]]
| |
| | pages = 187–194
| |
| | title = Point sets with many ''k''-sets
| |
| | volume = 26
| |
| | year = 2001}}.
| |
| {{refend}}
| |
| | |
| == External links ==
| |
| * [http://www.inf.ethz.ch/personal/christt/line_arrangements.php Database of Combinatorially Different Line Arrangements]
| |
| | |
| {{DEFAULTSORT:Arrangement Of Lines}}
| |
| [[Category:Discrete geometry]]
| |
| [[Category:Euclidean plane geometry]]
| |