TY - JOUR

T1 - Binary Space Partitions for Axis-Parallel Segments, Rectangles, and Hyperrectangles

AU - Dumitrescu, Adrian

AU - Mitchell, Joseph S.B.

AU - Sharir, Micha

PY - 2004/3

Y1 - 2004/3

N2 - We provide a variety of new upper and lower bounds and simpler proof techniques for the efficient construction of binary space partitions (BSPs) of axis- parallel rectangles of various dimensions, (a) We construct a set of n disjoint axis-parallel segments in the plane such that any binary space auto-partition has size at least 2n - o(n), almost matching an upper bound of d'Amore and Franciosa. (b) We establish a similar lower bound of 7n/3 - o(n) for disjoint rectangles in the plane, (c) We simplify and improve BSP constructions of Paterson and Yao for disjoint segments in ℝd and disjoint rectangles in ℝ3. (d) We derive a worst-case bound of θ(n5/3) for the size of BSPs of disjoint 2-rectangles in 4-space, (e) For disjoint k-rectangles in d-space, we prove the worst-case bound θ(nd/(d-k)), for any k < d/2 this bound holds for all k < d if the rectangles are allowed to intersect.

AB - We provide a variety of new upper and lower bounds and simpler proof techniques for the efficient construction of binary space partitions (BSPs) of axis- parallel rectangles of various dimensions, (a) We construct a set of n disjoint axis-parallel segments in the plane such that any binary space auto-partition has size at least 2n - o(n), almost matching an upper bound of d'Amore and Franciosa. (b) We establish a similar lower bound of 7n/3 - o(n) for disjoint rectangles in the plane, (c) We simplify and improve BSP constructions of Paterson and Yao for disjoint segments in ℝd and disjoint rectangles in ℝ3. (d) We derive a worst-case bound of θ(n5/3) for the size of BSPs of disjoint 2-rectangles in 4-space, (e) For disjoint k-rectangles in d-space, we prove the worst-case bound θ(nd/(d-k)), for any k < d/2 this bound holds for all k < d if the rectangles are allowed to intersect.

UR - http://www.scopus.com/inward/record.url?scp=1642338460&partnerID=8YFLogxK

U2 - 10.1007/s00454-003-0729-3

DO - 10.1007/s00454-003-0729-3

M3 - מאמר

AN - SCOPUS:1642338460

VL - 31

SP - 207

EP - 227

JO - Discrete and Computational Geometry

JF - Discrete and Computational Geometry

SN - 0179-5376

IS - 2

ER -