On `\(k\)-sets' in the plane

DOI10.1016/0012-365X(85)90193-1zbMath0595.52012MaRDI QIDQ1077725

G. W. Peck

Publication date: 1985

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

combinatorial geometry\(k\)-setsseparating lines

Mathematics Subject Classification ID

Other problems of combinatorial convexity (52A37) Euclidean geometries (general) and generalizations (51M05)

Related Items

Efficient algorithms for maximum regression depth ⋮ CENTROID TRIANGULATIONS FROM k-SETS ⋮ Entering and leaving \(j\)-facets ⋮ On circles enclosing many points

Cites Work

• 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