More on k-sets of finite sets in the plane

DOI10.1007/BF02187686zbMath0598.52007WikidataQ54309874 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 inequalities; line separation; k-sets of finite sets in the plane

Mathematics Subject Classification ID

05A05: Permutations, words, matrices

05A20: Combinatorial inequalities

52A40: Inequalities and extremum problems involving convexity in convex geometry

52A37: Other problems of combinatorial convexity

Related Items

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

Cites Work

• Unnamed Item
• 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