Abstract
We generate a binary space partition (BSP) of size O(n log8 n) and depth O (log4 n) for n orthogonal fat rectangles in three-space, improving earlier bounds of Agarwal et al. We also give a lower bound construction showing that the size of an orthogonal BSP for these objects is Ω (n log n) in the worst case. © Springer-Verlag 2003.
Cite
CITATION STYLE
APA
Tóth, C. D. (2003). Binary Space Partition for Orthogonal Fat Rectangles. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2832, 494–505. https://doi.org/10.1007/978-3-540-39658-1_45
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free