On `\(k\)-sets' in the plane
From MaRDI portal
Publication:1077725
DOI10.1016/0012-365X(85)90193-1zbMath0595.52012MaRDI QIDQ1077725
Publication date: 1985
Published in: Discrete Mathematics (Search for Journal in Brave)
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