Elsevier

Information Processing Letters

Volume 53, Issue 4, 24 February 1995, Pages 177-183
Information Processing Letters

Separating collections of points in Euclidean spaces

https://doi.org/10.1016/0020-0190(94)00186-3Get rights and content

Abstract

Given two disjoint convex sets A and B in Ed, a hyperplane h in Ed separates them if A lies on one of the half spaces defined by h while B lies on the complementary half space. Given a collection F of convex sets in Ed we say F is separated by a set of hyperplanes H if every pair of elements of F is separated by some hyperplane of H. We deal here with the case that the convex sets are all points. Let f(n, d) be the minimum number of hyperplanes always sufficient and occasionally necessary to separate n points in general position in Ed. We prove that [(n −1)d] ⩽ f(n, d) ⩽ [(n −2[log(d)])d] + [log(d)]. When d is even the lower bound can be improved to [nd]. In the planar case this gives us f(n, 2) = [n2]. We prove the upper bound by presenting an algorithm that generates a separating family of hyperplanes H that satisfies the upper bound. In dimension 2 the algorithm has a time complexity of O(n log(n)). Finally, we show that in the planar case H can be stored such that retrieving a line in H that separates a given pair of points from P can be found in O(1) expected time and worst-case time of O(log2(n)).

References (13)

  • D. Avis

    Non-partitionable point sets

    Inform. Process. Lett.

    (1984)
  • N. Megiddo

    Partitioning with two lines in the plane

    J. Algorithms

    (1985)
  • N. Alon et al.

    Cutting disjoint disks by straight lines

    Discrete Comput. Geom.

    (1989)
  • D. Avis

    On the partitionability of point sets in space

  • R. Boland

    Separating convex sets

  • K. Borsuk

    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 Mathematics
  • Separating families of convex sets

    2013, Computational Geometry: Theory and Applications
  • Discriminating codes in geometric setups

    2020, Leibniz International Proceedings in Informatics, LIPIcs
View all citing articles on Scopus
View full text