On halving line arrangements

Authors:
Alina Beygelzimer;Stanislaw Radziszowski
Affiliations:
Department of Computer Science University of Rochester, Rochester, NY;Department of Computer Science, Rochester Institute of Technology, Rochester, NY
Venue:
Discrete Mathematics - Kleitman and combinatorics: a celebration
Year:
2002

Citing 7
Cited 1

The number of small semispaces of a finite set of points in the plane

Journal of Combinatorial Theory Series A
An upper bound on the number of planar K-sets

Discrete & Computational Geometry
Results on k-sets and j-facets via continuous motion

Proceedings of the fourteenth annual symposium on Computational geometry
Handbook of discrete and computational geometry

Handbook of discrete and computational geometry
Point sets with many k-sets

Proceedings of the sixteenth annual symposium on Computational geometry
A Characterization of Planar Graphs by Pseudo-Line Arrangements

ISAAC '97 Proceedings of the 8th International Symposium on Algorithms and Computation
Crossing Numbers and Hard Erdös Problems in Discrete Geometry

Combinatorics, Probability and Computing

Note: An extended lower bound on the number of (≤k)-edges to generalized configurations of points and the pseudolinear crossing number of Kn

Journal of Combinatorial Theory Series A

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.