Algorithms for ham-sandwich cuts
- 333 Downloads
Given disjoint setsP1,P2, ...,P d inR d withn points in total, ahamsandwich cut is a hyperplane that simultaneously bisects theP i . 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 inR d−1 . With the current estimates, we get complexity close toO(n 3/2 ) ford=3, roughlyO(n 8/3 ) ford=4, andO(n d−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.
Unable to display preview. Download preview PDF.
- 1.P.K. Agarwal and J. Matoušek. Dynamic half-space range reporting and its applications. Technical Report CS-91-43, Department of Computer Science, Duke University, 1991. The results combined with results of D. Eppstein appear inProc. 33rd IEEE Symposium on Foundations of Computer Science, 1992, pp. 80–89.Google Scholar
- 4.N. Alon, I. Bárány, Z. Füredi, and D. Kleitman. Point selections and weak ε-nets for convex hulls. Manuscript, 1991.Google Scholar
- 7.I. Bárány and W. Steiger. On the expected number ofk-sets. Technical Report, Rutgers University, 1992. AlsoDiscrete Comput. Geom. 11 243–263, 1994.Google Scholar
- 10.T. Dey and H. Edelsbrunner. Counting simplex crossings and halving hyperplanes.Proc. 9th Annual ACM Symposium on Computational Geometry, 1993, pp. 270–273.Google Scholar
- 16.C.-Y. Lo, J. Matoušek, and W. L. Steiger. Ham-sandwich cuts inR d.Proc. 24th ACM Symposium on Theory of Computing, 1992, pp. 539–545.Google Scholar
- 17.C.-Y. Lo and W. L. Steiger. An optimal time algorithm for ham-sandwich cuts in the plane.Proc. 2nd Canadian Conference on Computational Geometry, 1990, pp. 5–9.Google Scholar
- 19.J. Matoušek. Approximations and optimal geometric divide-and-conquer.Proc. 23rd Annual ACM Symposium on Theory of Computing 1991, pp. 505–511.Google Scholar
- 20.J. Matoušek. Randomized optimal algorithm for slope selection.Inform. Process. Lett., 183–187, 1991.Google Scholar
- 23.L. Shafer and W. Steiger. Randomizing optimal geometric algorithms.Proc. 5th Canadian Conference on Computational Geometry, 1993.Google Scholar