On the average complexity of the $k$-level

DOI10.20382/jocg.v11i1a19zbMath1492.68132arXiv1911.02408OpenAlexW3106683722MaRDI QIDQ5132651

Pavel Valtr, Manfred Scheucher, Patrick Schnider, Man-Kwun Chiu, Stefan Felsner, Raphael Steiner

Publication date: 12 November 2020

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar arrangements of lines and pseudolines (aspects of discrete geometry) (52C30)

Related Items (2)

On the number of hyperedges in the hypergraph of lines and pseudo-discs ⋮ Improved bounds for the expected number of \(k\)-sets

This page was built for publication: On the average complexity of the $k$-level