, Volume 30, Issue 1, pp 3-16

A Note on Binary Plane Partitions

  • show all 1 hide

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access

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.