On the partitionability of point sets in space (preliminary report)

Authors:
David Avis
Affiliations:
School of Computer Science, McC111 University, 805 Sherbrooke St. W. Montreal, Canada, H3A 2K6
Venue:
SCG '85 Proceedings of the first annual symposium on Computational geometry
Year:
1985

Citing 2
Cited 1

Non-partitionable point sets

Information Processing Letters
A 3-space partition and its applications

STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing

Optimization in Arrangements

STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of partitioning sets of n points in d dimensions by means of &kgr; intersecting hyperplanes. We collect known results on this problem and give some new results. In particular, for d=&kgr;=3 it is known that a set in general position can be split into equal parts given any initial bisecting plane and two other carefully chosen planes. We show that this result does not extend to the case d=&kgr;=4. We also give bounds on the smallest integer h(&kgr;) such that sets in h(&kgr;)-space can be partitioned by &kgr; hyperplanes into 2&kgr; subsets of equal cardinality, partially answering a question raised by Paul Erdös.