Few Cuts Meet Many Point Sets

08/09/2018
by   Sariel Har-Peled, et al.
0

We study the problem of how to breakup many point sets in R^d into smaller parts using a few splitting (shared) hyperplanes. This problem is related to the classical Ham-Sandwich Theorem. We provide a logarithmic approximation to the optimal solution using the greedy algorithm for submodular optimization.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset