SEPARATING SETS OF HYPERRECTANGLES
1993 ◽
Vol 03
(02)
◽
pp. 155-165
◽
We consider the problem of separating a set of d-dimensional non-overlapping isothetic hyperrectangles by means of one cutting isothetic hyperplane. If the cutting hyperplane crosses one hyperrectangle this is split into two non-overlapping hyperrectangles. We show that it always exists a cutting hyperplane that separates n given hyperrectangles into two sets each containing no more than [αd · n] hyperrectangles, where αd=(2d−1)/2d. Also, we show that there are instances for which it is not possible to do better. An optimal O(d · n) time and space algorithm for finding this cutting hyperplane is presented. An upper bound to the number of intersected hyperrectangles is also given, thus proving a separator theorem for hyperrectangles.