An upper bound on the number of planar \(K\)-sets

DOI10.1007/BF02187829zbMath0765.68211OpenAlexW2167163837WikidataQ56853079 ScholiaQ56853079MaRDI QIDQ1184155

William Steiger, János Pach, Endre Szemerédi

Publication date: 28 June 1992

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/131184

zbMATH Keywords

\(k\)-sets

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (10)

On the expected number of \(k\)-sets ⋮ Algorithms for ham-sandwich cuts ⋮ \(k\)-violation linear programming ⋮ Dynamic half-space range reporting and its applications ⋮ Cutting dense point sets in half ⋮ Continuous location of dimensional structures. ⋮ Dense point sets with many halving lines ⋮ A pseudo-algorithmic separation of lines from pseudo-lines ⋮ Median hyperplanes in normed spaces -- a survey ⋮ A bound on local minima of arrangements that implies the upper bound theorem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the number of k-subsets of a set of n points in the plane
• The number of small semispaces of a finite set of points in the plane
• Halfspace range search: An algorithmic application of k-sets
• More on k-sets of finite sets in the plane
• Points and triangles in the plane and halving planes in space
• New applications of random sampling in computational geometry
• On the number of line separations of a finite set in the plane
• Applications of random sampling in computational geometry. II
• On k-Hulls and Related Problems

This page was built for publication: An upper bound on the number of planar \(K\)-sets