volume 30, issue 1, P3-16 2003
DOI: 10.1007/s00454-003-2921-x
View full text
|
|
Share

Abstract: This paper considers binary space partitions (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.

Search citation statements

Order By: Relevance

Paper Sections

0
0
0
0
0

Citation Types

0
6
0

Publication Types

Select...

Relationship

0
0

Authors

Journals