On halving line arrangements

Given a set of n points in general position in the plane, where n is even, a halving line is a line going through two of the points and cutting the remaining set of n - 2 points in half. Let h(n) denote the maximum number of halving lines that can be realized by a planar set of n points. The problem naturally generalizes to pseudoconfigurations; denote the maximum number of halving pseudolines over all pseudoconfigurations of size n by h(n). We prove that h(12)= 18 and that the pseudoconfiguration on 12 points with the largest number of halving pseudolines is unique up to isomorphism; this pseudoconfiguration is realizable, implying h(12)= 18. We show several structural results that substantially reduce the computational effort needed to obtain the exact value of h(n) for larger n. Using these techniques, we enumerate all topologically distinct, simple arrangements of 10 pseudolines with a marked cell. We also prove that h(14)= 22 using certain properties of degree sequences of halving edges graphs.

[1]  David Eppstein.  Sets of points with many halving lines , 1992 .

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

[3]  Timothy M. Chan,et al.  On levels in arrangements of lines , 1998 .

[4]  E. Szemerédi,et al.  Crossing-Free Subgraphs , 1982 .

[5]  Micha Sharir,et al.  On levels in arrangements of lines, segments, planes, and triangles , 1997, SCG '97.

[6]  F. Thomas Leighton,et al.  Complexity Issues in VLSI , 1983 .

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

[8]  Boris Aronov,et al.  Results on k-sets and j-facets via continuous motion , 1998, SCG '98.

[9]  Hisao Tamaki,et al.  A Characterization of Planar Graphs by Pseudo-Line Arrangements , 2003 .

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

[11]  Herbert Edelsbrunner,et al.  On the Number of Line Separations of a Finite Set in the Plane , 1985, J. Comb. Theory, Ser. A.

[12]  P. Erdös,et al.  Dissection Graphs of Planar Point Sets , 1973 .

[13]  Géza Tóth,et al.  Point Sets with Many k-Sets , 2000, SCG '00.

[14]  Tamal K. Dey,et al.  Improved Bounds for Planar k -Sets and Related Problems , 1998, Discret. Comput. Geom..

[15]  J. Pach,et al.  An upper bound on the number of planar k-sets , 1989, 30th Annual Symposium on Foundations of Computer Science.

[16]  Artur Andrzejak,et al.  K-sets and j-facets - A tour of discrete geometry , 1997 .

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

[18]  Joseph O'Rourke,et al.  Handbook of Discrete and Computational Geometry, Second Edition , 1997 .

[19]  Noga Alon,et al.  The number of small semispaces of a finite set of points in the plane , 1986, J. Comb. Theory, Ser. A.

[20]  László A. Székely,et al.  Crossing Numbers and Hard Erdős Problems in Discrete Geometry , 1997, Combinatorics, Probability and Computing.

[21]  Artur Andrzejak.  Halving Point Sets , 1998 .

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

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

[24]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.