More on k-sets of finite sets in the plane

DOI10.1007/BF02187686zbMath0598.52007OpenAlexW2028416480WikidataQ54309874 ScholiaQ54309874MaRDI QIDQ1079816

Ermo Welzl

Publication date: 1986

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

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

zbMATH Keywords

geometric inequalitiesline separationk-sets of finite sets in the plane

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorial inequalities (05A20) Inequalities and extremum problems involving convexity in convex geometry (52A40) Other problems of combinatorial convexity (52A37)

Related Items

On the expected number of \(k\)-sets, On some monotone path problems in line arrangements, PARAMETRIC POLYMATROID OPTIMIZATION AND ITS GEOMETRIC APPLICATIONS, Line arrangements and range search, Algorithms for generalized halfspace range searching and other intersection searching problems, Relative \((p,\varepsilon )\)-approximations in geometry, On \(\leq k\)-edges, crossings, and halving lines of geometric drawings of \(K _{n }\), Partitioning arrangements of lines. I: An efficient deterministic algorithm, Construction of \(\epsilon\)-nets, The complexity of point configurations, An upper bound on the number of planar \(K\)-sets, Applications of random sampling in computational geometry. II, Algorithms for generalized halfspace range searching and other intersection searching problems, On levels in arrangements and Voronoi diagrams

Cites Work

• The number of small semispaces of a finite set of points in the plane
• The number of extreme pairs of finite point-sets in Euclidean spaces
• On the combinatorial classification of nondegenerate configurations in the plane
• On the number of line separations of a finite set in the plane
• Constructing Belts in Two-Dimensional Arrangements with Applications
• Unnamed Item