التفاصيل البيبلوغرافية
| العنوان: |
Few Cuts Meet Many Point Sets |
| المؤلفون: |
Har-Peled, Sariel, Jones, Mitchell |
| سنة النشر: |
2018 |
| المجموعة: |
Computer Science |
| مصطلحات موضوعية: |
Computer Science - Computational Geometry |
| الوصف: |
We study the problem of how to breakup many point sets in $\mathbb{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. |
| نوع الوثيقة: |
Working Paper |
| URL الوصول: |
http://arxiv.org/abs/1808.03260 |
| رقم الانضمام: |
edsarx.1808.03260 |
| قاعدة البيانات: |
arXiv |