Discrete & Computational Geometry

, Volume 11, Issue 4, pp 433–452

Algorithms for ham-sandwich cuts


DOI: 10.1007/BF02574017

Cite this article as:
Lo, CY., Matoušek, J. & Steiger, W. Discrete Comput Geom (1994) 11: 433. doi:10.1007/BF02574017


Given disjoint setsP1,P2, ...,Pd inRd withn points in total, ahamsandwich cut is a hyperplane that simultaneously bisects thePi. We present algorithms for finding ham-sandwich cuts in every dimensiond>1. Whend=2, the algorithm is optimal, having complexityO(n). For dimensiond>2, the bound on the running time is proportional to the worst-case time needed for constructing a level in an arrangement ofn hyperplanes in dimensiond−1. This, in turn, is related to the number ofk-sets inRd−1. With the current estimates, we get complexity close toO(n3/2) ford=3, roughlyO(n8/3) ford=4, andO(nd−1−a(d)) for somea(d)>0 (going to zero asd increases) for largerd. We also give a linear-time algorithm for ham-sandwich cuts inR3 when the three sets are suitably separated.

Copyright information

© Springer-Verlag New York Inc. 1994

Authors and Affiliations

  1. 1.AT&T Bell LaboratoriesMurray HillUSA
  2. 2.Charles UniversityPraha 1Czech Republic
  3. 3.Free University BerlinBerlinGermany
  4. 4.Rutgers UniversityPiscatawayUSA