Separating collections of points in Euclidean spaces
References (13)
Non-partitionable point sets
Inform. Process. Lett.
(1984)Partitioning with two lines in the plane
J. Algorithms
(1985)- et al.
Cutting disjoint disks by straight lines
Discrete Comput. Geom.
(1989) On the partitionability of point sets in space
Separating convex sets
Drei Sätze uber die n-dimensionale euklidische Sphare
Fund. Math.
(1933)
There are more references available in the full text version of this article.
Cited by (10)
Identification of points using disks
2019, Discrete MathematicsSeparating families of convex sets
2013, Computational Geometry: Theory and ApplicationsAbstractions of hybrid systems: Formal languages to describe dynamical behaviour
2011, IFAC Proceedings Volumes (IFAC-PapersOnline)Discriminating codes in geometric setups
2020, Leibniz International Proceedings in Informatics, LIPIcs
Copyright © 1995 Published by Elsevier B.V.