Stack Exchange network consists of 183 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.
The paper by
Lo, Matoušek, and Steiger entitled "Algorithms for Ham-Sandwich Cuts" gives an $O(n)$ algorithm in arbitrary dimensions (!), where $n$ is the number of points. That's the best you can do, since you need to consider all such points.
The paper by
Lo, Matoušek, and Steiger entitled "Algorithms for Ham-Sandwich Cuts" gives an $O(n)$ algorithm in arbitrary dimensions (!), where $n$ is the number of points. That's the best you can do, since you need to consider all such points.
The paper by
Lo, Matoušek, and Steiger entitled "Algorithms for Ham-Sandwich Cuts" gives an $O(n)$ algorithm, where $n$ is the number of points. That's the best you can do, since you need to consider all such points.
The paper by
Lo, Matoušek, and Steiger entitled "Algorithms for Ham-Sandwich Cuts" gives an $O(n)$ algorithm in arbitrary dimensions (!), where $n$ is the number of points. That's the best you can do, since you need to consider all such points.
