Pseudoline Arrangements

Pseudoline arrangements generalize in a natural way arrangements of straight lines, discarding the straightness aspect, but preserving their basic topological and combinatorial properties. Elementary and intuitive in nature, at the same time, by the Folkman-Lawrence topological representation theorem (see Chapter 6), they provide a concrete geometric model for oriented matroids of rank 3. After their explicit description by Levi in the 1920’s, and the subsequent development of the theory by Ringel in the 1950’s, the major impetus was given in the 1970’s by Grünbaum’s monograph Arrangements and Spreads, in which a number of results were collected and a great many problems and conjectures posed about arrangements of both lines and pseudolines. The connection with oriented matroids discovered several years later led to further work. The theory is by now very well developed, with many combinatorial and topological results and connections to other areas as for example algebraic combinatorics, as well as a large number of applications in computational geometry. In comparison to arrangements of lines arrangements of pseudolines have the advantage that they are more general and allow for a purely combinatorial treatment. Section 5.1 is devoted to the basic properties of pseudoline arrangements, and Section 5.2 to related structures, such as arrangements of straight lines, configurations (and generalized configurations) of points, and allowable sequences of permutations. (We do not discuss the connection with oriented matroids, however; that is included in Chapter 6.) In Section 5.3 we discuss the stretchability problem. Section 5.4 summarizes some combinatorial results known about line and pseudoline arrangements, in particular problems related to the cell structure of arrangements. Section 5.5 deals with results of a topological nature and Section 5.6 with issues of combinatorial and computational complexity. Section 5.7 with several applications, including sweeping arrangements and pseudotriangulations. Unless otherwise noted, we work in the real projective plane P.

[1]  Ileana Streinu,et al.  A Pseudo-Algorithmic Separation of Lines from Pseudo-Lines , 1995, Inf. Process. Lett..

[2]  Richard Pollack,et al.  A theorem of ordered duality , 1982 .

[3]  János Pach,et al.  On the Number of Balanced Lines , 2001, Discret. Comput. Geom..

[4]  Donald E. Knuth,et al.  Axioms and Hulls , 1992, Lecture Notes in Computer Science.

[5]  P. Suvorov,et al.  Isotopic but not rigidly isotopic plane systems of straight lines , 1988 .

[6]  Stefan Felsner,et al.  Zonotopes associated with higher Bruhat orders , 2001, Discret. Math..

[7]  Bernard Chazelle,et al.  Cutting hyperplanes for divide-and-conquer , 1993, Discret. Comput. Geom..

[8]  Jean-Pierre Roudneff.  Arrangements of lines with a minimum number of triangles are simple , 1988, Discret. Comput. Geom..

[9]  B. Grünbaum.  Arrangements and Spreads , 1972 .

[10]  N. Mnev.  The universality theorems on the classification problem of configuration varieties and convex polytopes varieties , 1988 .

[11]  Richard Pollack,et al.  Proof of Grünbaum's Conjecture on the Stretchability of Certain Arrangements of Pseudolines , 1980, J. Comb. Theory, Ser. A.

[12]  L. A S Z L,et al.  Crossing Numbers and Hard Erdős Problems in Discrete Geometry , 1997 .

[13]  Heiko Harborth,et al.  SOME SIMPLE ARRANGEMENTS OF PSEUDOLINES WITH A MAXIMUM NUMBER OF TRIANGLES , 1985 .

[14]  Kurt Mehlhorn,et al.  Data Structures and Algorithms 3: Multi-dimensional Searching and Computational Geometry , 2012, EATCS Monographs on Theoretical Computer Science.

[15]  Franz Aurenhammer,et al.  Enumerating Order Types for Small Point Sets with Applications , 2002, Order.

[16]  R. W. Shannon.  Simplicial cells in arrangements of hyperplanes , 1979 .

[17]  János Pach,et al.  Extremal Problems for Geometric Hypergraphs , 1996, ISAAC.

[18]  Leonidas J. Guibas,et al.  Combinatorial complexity bounds for arrangements of curves and spheres , 1990, Discret. Comput. Geom..

[19]  Oswin Aichholzer,et al.  Abstract order type extension and new results on the rectilinear crossing number , 2005, EuroCG.

[20]  Herbert Edelsbrunner,et al.  Algorithms in Combinatorial Geometry , 1987, EATCS Monographs in Theoretical Computer Science.

[21]  Jacob E. Goodman,et al.  Proof of a conjecture of Burr, Grünbaum, and Sloane , 1980, Discret. Math..

[22]  David Forge,et al.  On Counting the k-face Cells of Cyclic Arrangements , 2001, Eur. J. Comb..

[23]  Jean-Pierre Roudneff.  The Maximum Number of Triangles in Arrangements of Pseudolines , 1996, J. Comb. Theory, Ser. B.

[24]  Micha Sharir,et al.  Extremal Configurations and Levels in Pseudoline Arrangements , 2003, WADS.

[25]  Hisao Tamaki,et al.  A Characterization of Planar Graphs by Pseudo-Line Arrangements , 1997, Algorithmica.

[26]  P. Erdos,et al.  Extremal problems in combinatorial geometry , 1996 .

[27]  Kathryn L. Nyman.  Linear Inequalities for Rank 3 Geometric Lattices , 2004, Discret. Comput. Geom..

[28]  Stefan Felsner,et al.  Hamiltonicity and colorings of arrangement graphs , 2000, SODA '00.

[29]  P. Orlik,et al.  Arrangements Of Hyperplanes , 1992 .

[30]  Richard Pollack,et al.  The complexity of point configurations , 1991, Discret. Appl. Math..

[31]  Stefan Felsner,et al.  Triangles in Euclidean Arrangements , 1999, Discret. Comput. Geom..

[32]  R. Pollack,et al.  Allowable Sequences and Order Types in Discrete and Computational Geometry , 1993 .

[33]  Günter Rote,et al.  Straightening polygonal arcs and convexifying polygonal cycles , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[34]  Jean-Pierre Roudneff,et al.  Tverberg-type Theorems for Pseudoconfigurations of Points in the Plane , 1988, Eur. J. Comb..

[35]  József Balogh,et al.  Long monotone paths in line arrangements , 2003, SCG '03.

[36]  G. Ringel.  Teilungen der Ebene durch Geraden oder topologische Geraden , 1956 .

[37]  Jirí Matousek,et al.  Dynamic half-space range reporting and its applications , 2005, Algorithmica.

[38]  Micha Sharir,et al.  Pseudo-line arrangements: duality, algorithms, and applications , 2002, SODA '02.

[39]  Nicola Martinov.  Classification of arrangements by the number of their cells , 1993, Discret. Comput. Geom..

[40]  Endre Szemerédi,et al.  Extremal problems in discrete geometry , 1983, Comb..

[41]  Bernd Sturmfels,et al.  Simplicial cells in arrangements and mutations of oriented matroids , 1988 .

[42]  Bernd Sturmfels,et al.  Arrangements of lines and pseudolines without adjacent triangles , 1989, J. Comb. Theory, Ser. A.

[43]  Richard Pollack,et al.  A COMBINATORIAL VERSION OF THE ISOTOPY CONJECTURE , 1985 .

[44]  Leonidas J. Guibas,et al.  The complexity and construction of many faces in arrangements of lines and of segments , 1990, Discret. Comput. Geom..

[45]  R. Pollack,et al.  Arrangements and Topological Planes , 1994 .

[46]  Adrian Dumitrescu.  Monotone Paths in Line Arrangements with a Small Number of Directions , 2005, Discret. Comput. Geom..

[47]  Jürgen Richter-Gebert,et al.  Two interesting oriented matroids , 1996, Documenta Mathematica.

[48]  Peter Ungar,et al.  2N Noncollinear Points Determine at Least 2N Directions , 1982, J. Comb. Theory, Ser. A.

[49]  David Eppstein,et al.  Horizon Theorems for Lines and Polygons , 1990, Discrete and Computational Geometry.

[50]  Jürgen Richter-Gebert.  Realization Spaces of Polytopes , 1996 .

[51]  L. A. Oa,et al.  Crossing Numbers and Hard Erd} os Problems in Discrete Geometry , 1997 .

[52]  Géza Tóth,et al.  Monotone paths in line arrangements , 2003, Comput. Geom..

[53]  Paul Erdös,et al.  The Solution to a Problem of Grünbaum , 1988, Canadian Mathematical Bulletin.

[54]  R. Canham.  A theorem on arrangements of lines in the plane , 1969 .

[55]  Rephael Wenger,et al.  There are uncountably many universal topological planes , 1996 .

[56]  Jürgen Richter-Gebert.  Kombinatorische Realisierbarkeitskriterien für orientierte Matroide , 1989 .

[57]  Jean-Pierre Roudneff.  Quadrilaterals and pentagons in arrangements of lines , 1987 .

[58]  Richard Pollack,et al.  Helly-Type Theorems for Pseudoline Arrangements in P2 , 1982, J. Comb. Theory, Ser. A.

[59]  Jiří Matoušek.  Lower bounds on the length of monotone paths in arrangements , 1991, Discret. Comput. Geom..

[60]  Jirí Matousek,et al.  Reporting Points in Halfspaces , 1992, Comput. Geom..

[61]  Stefan Felsner,et al.  Geometric Graphs and Arrangements , 2004 .

[62]  Robert E. Jamison,et al.  A SURVEY OF THE SLOPE PROBLEM , 1985 .

[63]  B. Sturmfels.  Computational Synthetic Geometry , 1989 .

[64]  Francisco Santos,et al.  Pseudo-Triangulations - a Survey , 2006 .

[65]  Leonidas J. Guibas,et al.  Topologically sweeping an arrangement , 1986, STOC '86.

[66]  David Forge,et al.  Straight line arrangements in the real projective plane , 1998, Discret. Comput. Geom..

[67]  Bernd Sturmfels,et al.  Coordinate representation of order types requires exponential storage , 1989, STOC '89.

[68]  Richard Pollack,et al.  Semispaces of Configurations, Cell Complexes of Arrangements , 1984, J. Comb. Theory, Ser. A.

[69]  Ileana Streinu,et al.  Clusters of stars , 1997, SCG '97.

[70]  Bernd Sturmfels,et al.  An infinite family of minor-minimal nonrealizable 3-chirotopes , 1989 .

[71]  Hisao Tamaki,et al.  How to Cut Pseudoparabolas into Segments , 1998, Discret. Comput. Geom..

[72]  Peter W. Shor,et al.  Stretchability of Pseudolines is NP-Hard , 1990, Applied Geometry And Discrete Mathematics.

[73]  Richard Pollack,et al.  Three Points Do Not Determine a (Pseudo-) Plane , 1981, J. Comb. Theory, Ser. A.

[74]  Martin Aigner,et al.  Proofs from THE BOOK , 1998 .

[75]  Stefan Felsner,et al.  Sweeps, arrangements and signotopes , 2001, Discret. Appl. Math..

[76]  N. Sloane,et al.  The orchard problem , 1974 .

[77]  John Hershberger,et al.  Sweeping arrangements of curves , 1989, SCG '89.

[78]  Richard Pollack,et al.  On the Combinatorial Classification of Nondegenerate Configurations in the Plane , 1980, J. Comb. Theory, Ser. A.

[79]  RICHARD P. STANLEY,et al.  On the Number of Reduced Decompositions of Elements of Coxeter Groups , 1984, Eur. J. Comb..

[80]  Stefan Felsner,et al.  On the Number of Arrangements of Pseudolines , 1996, SCG '96.