On the complexity of the k-level in arrangements of pseudoplanes

DOI10.1016/J.DISC.2021.112354MaRDI QIDQ2022137zbMATH OpenOpenAlexFDO

Authors Chen Ziv, Micha Sharir

Publication date 28 April 2021

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1903.07196

zbMATH Keywords

arrangements of pseudoplanesthree dimensions

Mathematics Subject Classification ID

Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35)

Abstract: A classical open problem in combinatorial geometry is to obtain tight asymptotic bounds on the maximum number of k-level vertices in an arrangement of n hyperplanes in d dimensions (vertices with exactly k of the hyperplanes passing below them). This is a dual version of the k-set problem, which, in a primal setting, seeks bounds for the maximum number of k-sets determined by n points in d dimensions, where a k-set is a subset of size k that can be separated from its complement by a hyperplane. The k-set problem is still wide open even in the plane, with a substantial gap between the best known upper and lower bounds. The gap gets larger as the dimension grows. In three dimensions, the best known upper bound is O(nk^(3/2)). In its dual version, the problem can be generalized by replacing hyperplanes by other families of surfaces (or curves in the planes). Reasonably sharp bounds have been obtained for curves in the plane, but the known upper bounds are rather weak for more general surfaces, already in three dimensions, except for the case of triangles. The best known general bound, due to Chan is O(n^2.997), for families of surfaces that satisfy certain (fairly weak) properties. In this paper we consider the case of pseudoplanes in 3 dimensions (defined in detail in the introduction), and establish the upper bound O(nk^(5/3)) for the number of k-level vertices in an arrangement of n pseudoplanes. The bound is obtained by establishing suitable (and nontrivial) extensions of dual versions of classical tools that have been used in studying the primal k-set problem, such as the Lova'sz Lemma and the Crossing Lemma.

Recommendations

• scientific article; zbMATH DE number 7559262
• Approximating the k-Level in Three-Dimensional Plane Arrangements
• Approximating the k-level in three-dimensional plane arrangements
• On arrangements of pseudohyperplanes
• Complexity of geometric \(k\)-planarity for fixed \(k\)
• On levels in arrangements and Voronoi diagrams
• Extremal configurations and levels in pseudoline arrangements.
• On the number of arrangements of pseudolines
• Randomized complexity lower bound for arrangements and polyhedra
• New lower bounds for the number of pseudoline arrangements

Cites work

• k-sets in four dimensions
• A characterization of planar graphs by pseudo-line arrangements
• An Improved Bound for k-Sets in Four Dimensions
• An improved bound for \(k\)-sets in three dimensions
• An improved, simple construction of many halving edges
• Applications of random sampling in computational geometry. II
• Counting triangle crossings and halving planes
• Crossing-Free Subgraphs
• scientific article; zbMATH DE number 4032498 (Why is no real title available?)
• scientific article; zbMATH DE number 732977 (Why is no real title available?)
• scientific article; zbMATH DE number 3407703 (Why is no real title available?)
• Improved bounds for planar k-sets and related problems
• On levels in arrangements of lines, segments, planes, and triangles
• On levels in arrangements of surfaces in three dimensions
• On the bichromatic k-set problem
• On the number of halving planes
• Point sets with many \(k\)-sets
• Pseudo-Line Arrangements: Duality, Algorithms, and Applications
• Three points do not determine a (pseudo-) plane
• Topologically sweeping an arrangement

Cited in

(8)

• On levels in arrangements of lines, segments, planes, and triangles
• k-levels of concave surfaces
• On levels in arrangements of surfaces in three dimensions
• k-sets and k-facets
• On levels in arrangements of surfaces in three dimensions
• Approximating the k-Level in Three-Dimensional Plane Arrangements
• scientific article; zbMATH DE number 7559262 (Why is no real title available?)
• Extremal configurations and levels in pseudoline arrangements.

This page was built for publication: On the complexity of the \(k\)-level in arrangements of pseudoplanes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2022137)