The Strong Dirac conjecture, open in some form since 1951 [5], is that every set of n points in R includes a member incident to at least n/2 − c lines spanned by the set, for some universal constant c. The less frequently stated dual of this conjecture is that every arrangement of n lines includes a line incident to at least n/2 − c vertices of the arrangement. It is known that an arrangement o...

A simplicial arrangement of pseudolines is a collection of topological lines in the projective plane where each region that is formed is triangular. This paper refines and develops David Eppstein’s notion of a kaleidoscope construction for symmetric pseudoline arrangements to construct and analyze several infinite families of simplicial pseudoline arrangements with high degrees of geometric sym...

We describe a linear-time algorithm that finds a planar drawing of every graph of a simple line or pseudoline arrangement within a grid of area O(n). No known input causes our algorithm to use area Ω(n ) for any > 0; finding such an input would represent significant progress on the famous k-set problem from discrete geometry. Drawing line arrangement graphs is the main task in the Planarity puz...

Recent advances in the field of plant community phylogenetics and invasion phylogenetics are mostly based on plot-level data, which do not take into consideration the spatial arrangement of individual plants within the plot. Here we use within-plot plant coordinates to investigate the link between the physical distance separating plants, and their phylogenetic relatedness. We look at two vegeta...

Given a line arrangement A with n lines, we show that there exists a path of length n/3−O(n) in the dual graph of A formed by its faces. This bound is tight up to lower order terms. For the bicolored version, we describe an example of a line arrangement with 3k blue and 2k red lines with no alternating path longer than 14k. Further, we show that any line arrangement with n lines has a coloring ...

The realizability problem for rank 3 oriented matroids (see [1]) is equivalent to the pseudoline stretchability problem (see [4]). This paper uses an example to illustrate a new approach to this problem. The main theorem of this paper, like the trigonometric form of Ceva’s theorem, shows a non-trivial relationship amongst the angles in a specific line arrangement figure (c). We work in polar co...

in order to study the effect of water deficit stress at different growth stages on yield and seed oil quality of rapeseed cultivars, a field experiment was conducted as split-plot in a randomized complete block design arrangement with three replications in 2009-2010 growing seasons in abarkouh in iran. four levels of irrigation were located in the main plot including, (i1) normal irrigation bas...

Introduction. A pseudoline is formed from a line by stretching the plane without tearing: it is the image of a line under a homeomorphism of the plane [13]. In arrangements of pseudolines, pairs of pseudolines intersect at most once and cross at their intersections. Pseudoline arrangements can be used to model sorting networks [1], tilings of convex polygons by rhombi [4], and graphs that have ...

We generalize the Hadwiger theorem on line transversals to collections of compact convex sets in the plane to the case where the sets are connected and the transversals form an arrangement of pseudolines. The proof uses the embeddability of pseudoline arrangements in topological affine planes. In 1940 Santaló showed [8], by an example, that Vincensini’s proof [9] of an extension of Helly’s theo...