Skip to search formSkip to main contentSkip to account menu

K-set (geometry)

Known as: K-set (Mathematics) 
In discrete geometry, a k-set of a finite point set S in the Euclidean plane is a subset of k elements of S that can be strictly separated from the… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
1998
1998
Abstract. We consider the problem of bounding the complexity of the k th level in an arrangement of n curves or surfaces, a… 
1995
1995
The construction of the convex hull of a nite point set in a low-dimensional Euclidean space is a fundamental problem in…