A family of pairwise disjoint sets in the plane is said to be separable, if any two sets can be separated by a straight line which does not intersect any member of the family. According to the first theorem of this paper there is a family of infinitely many pairwise disjoint circular disks (or squares) in the plane which has no separable subfamily consisting of three sets. This is related to a construction of K. Villanger concerning straight line segments which is described in a paper of \textit{H. Tverberg} [Math. Scand. 45, 255-260 (1979; Zbl 0431.52003)]. It is also shown that there is no such family of sets with bounded inradius and circumradius. NEWLINENEWLINENEWLINEThe first theorem contrasts with the second one which says that every uncountable family of pairwise disjoint convex sets in the plane has two uncountable subfamilies that can be separated by a straight line. The original proof of this was greatly simplified by V. Totik. Finally it is shown that there exists an infinite family of pairwise disjoint unit segments in 3-space such that there are no two members that can be separated from a third by a plane.
- Separating convex sets in the plane
- scientific article; zbMATH DE number 957570
- Distance between separating circles and points
- Partitions of a segment into sets of the same type
- Convex Polygons and Separation of Convex
- On the sets of points on the plane with integer-valued distances
- scientific article; zbMATH DE number 475114
- scientific article; zbMATH DE number 5035595
- On a Besicovitch set
- Two point set extensions- a counterexample
- Kirchberger-type theorems for separation by convex domains
- Separating convex sets in the plane
- On separation of plane convex sets
- Separation of convex sets
- Separability by two lines and by nearly straight polygonal chains
- Cutting out polygon collections with a saw
- Cutting disjoint disks by straight lines
- scientific article; zbMATH DE number 431371 (Why is no real title available?)
- Separating plane convex sets.
- “Convexity” of sets of lines
- scientific article; zbMATH DE number 6850368 (Why is no real title available?)
- Separating overlapped intervals on a line
- scientific article; zbMATH DE number 4184439 (Why is no real title available?)
- Convex Polygons and Separation of Convex
This page was built for publication: Separating convex sets by straight lines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5951952)
