On k-hulls and related problems
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Slowing Down Sorting Networks To Obtain Faster Sorting Algorithm
SFCS '84 Proceedings of the 25th Annual Symposium onFoundations of Computer Science, 1984
Space Searching For Intersecting Objects
SFCS '84 Proceedings of the 25th Annual Symposium onFoundations of Computer Science, 1984
Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
A geometric consistency theorem for a symbolic perturbation scheme
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
ACM Transactions on Graphics (TOG)
Symbolic treatment of geometric degeneracies
Journal of Symbolic Computation
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
An efficient approach to removing geometric degeneracies
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Efficient algorithms for geometric optimization
ACM Computing Surveys (CSUR)
Generalizing ham sandwich cuts to equitable subdivisions
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Bisecting Two Subsets in 3-Connected Graphs
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
On the Complexity of the Pancake Problem
Electronic Notes in Theoretical Computer Science (ENTCS)
Orthogonal ham-sandwich theorem in R3
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
JCDCG'04 Proceedings of the 2004 Japanese conference on Discrete and Computational Geometry
Equipartitions of measures by 2-fans
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
| Hi-index | 0.00 |
Let B be a set of n"b black points and W a set of n"w, white points in the Euclidean plane. A line h is said to bisect B (or W) if, at most, half of the points of B (or W) lie on any one side of h. A line that bisects both B and W is called a ham-sandwich cut of B and W. We give an algorithm that computes a ham-sandwich cut of B and W in 0((n"h+n"w) log (min {n"b, n"w}+ 1)) time. The algorithm is considerably simpler than the previous most efficient one which takes 0((n"b + n"w) log (n"b + n"w)) time.