A k -set of a finite set S of points in the plane is a subset of cardinality k that can be separated from the rest by a straight line.
Abstract. A k-set of a finite set S of points in the plane is a subset of cardinality k that can be separated from the rest by a straight line.
Jun 1, 2000 · A class of point-sets with few k-sets · Contents. Computational Geometry: Theory and Applications. Volume 16, Issue 2 · NEXT ARTICLE. Cylindrical ...
The question of how many k-sets a set of n points can contain is a long-standing open problem where a lower bound of (n log k) and an upper bound of O(nk 1/3 ) ...
May 22, 1998 · Abstract. A k-set of a nite set S of points in the plane is a subset of car- dinality k that can be separated from the rest by a straight ...
Abstract. A k-set of a nite set S of points in the plane is a subset of car- dinality k that can be separated from the rest by a straight line. The.
Missing: class | Show results with:class
Abstract. A k-set of a nite set S of points in the plane is a subset of car- dinality k that can be separated from the rest by a straight line. The.
Missing: class | Show results with:class
Jan 31, 2016 · If A1,A2,…,Am∈F and k is a positive integer, show that the set of points of Ω which belong to exactly k of the A's belongs to F.
May 21, 2020 · We give conditions for k-point configuration sets of thin sets to have nonempty interior, applicable to a wide variety of configurations.
Jun 6, 2023 · Let us start with some definitions. We call any point set that determines at most k distances a k -distance set. We denote by \(m_k(d)\) the ...