Binary space partitions for 3D subdivisions

We consider the following question: Given a subdivision of space into n convex polyhedral cells, what is the worst-case complexity of a binary space partition (BSP) for the subdivision? We show that if the subdivision is rectangular and axis-aligned, then the worstcase complexity of an axis-aligned BSP is Ω(n4/3 ) and O(nα log2

• Type: Conference
• Year: 2003
• Where: SODA
• Authors: John Hershberger, Subhash Suri
• Keywords: Algorithms, Binary Space Partition, Convex Polyhedral Cells, SODA 2003, Worst-case Complexity