A Note on Binary Plane Partitions
- Cite this article as:
- Tóth Discrete Comput Geom (2003) 30: 3. doi:10.1007/s00454-003-2921-x
- 49 Downloads
Abstract. This paper considers binary space partition s (BSP for short) for disjoint line segments in the plane. The BSP for a disjoint set of objects is a scheme dividing the space recursively by hyperplanes until the resulting fragments of objects are separated. The size of a BSP is the number of resulting fragments of the objects. We show that the minimal size of a BSP for n disjoint line segments in the plane is Ω (n log n /log log n) in the worst case.