K-set (geometry)
Summary
In discrete geometry, a -set of a finite point set in the Euclidean plane is a subset of elements of that can be strictly separated from the remaining points by a line. More generally, in Euclidean space of higher dimensions, a -set of a finite point set is a subset of elements that can be separated from the remaining points by a hyperplane. In particular, when (where is the size of ), the line or hyperplane that separates a -set from the rest of is a halving line or halving plane.
Further reading
- Wikipedia, page 8075001, revision 1368661379, K-set (geometry). adopted
About this page
| Tag | W63YT2E5KY |
|---|---|
| URI | m2://W63YT2E5KY |
| Aliases | k-set-mathematics |
| Kind | concept |
| Writing | W1 stated |
| Same as | |
| Changed | 4 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W2
- edge defines in: at least one definition (0 of 1)
- edge instance_of in: at least two examples (0 of 2)
- edge not_instance_of in: at least one non-example (0 of 1)
- edge specializes both: the more general notions and the special cases (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.