Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 228,397,757 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
11 relations
Crossing number (graph theory)
Crossing number inequality
Discrete & Computational Geometry
Dynamic convex hull
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
1998
1998
On Levels in Arrangements of Lines, Segments, Planes, and Triangles%
P. Agarwal
,
B. Aronov
,
Timothy M. Chan
,
M. Sharir
Discrete & Computational Geometry
1998
Corpus ID: 47164769
Abstract. We consider the problem of bounding the complexity of the k th level in an arrangement of n curves or surfaces, a…
Expand
1995
1995
Output-sensitive construction of convex hulls
Timothy M. Chan
1995
Corpus ID: 120475045
The construction of the convex hull of a nite point set in a low-dimensional Euclidean space is a fundamental problem in…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE