Binary space partitions for axis-parallel line segments: Size-height tradeoffs. (Q1853137)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1856476
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Binary space partitions for axis-parallel line segments: Size-height tradeoffs. |
scientific article; zbMATH DE number 1856476 |
Statements
Binary space partitions for axis-parallel line segments: Size-height tradeoffs. (English)
0 references
21 January 2003
0 references
We present worst-case lower bounds on the minimum size of a Binary Space Partition (BSP) tree as a function of its height, for a set \(S\) of \(n\) axis-parallel line segments in the plane. We assume that the BSP uses only axis-parallel cutting lines. These lower bounds imply that, in the worst case, a BSP tree of height \(O(\log n)\) must have size \(\Omega(n\log n)\) and a BSP tree of size \(O(n)\) must have height \(\Omega(n^{\delta})\), where \(\delta\) is a suitable constant.
0 references
Computational geometry
0 references
Binary space partitions
0 references
Line segments
0 references
0.9125713
0 references
0.9125713
0 references
0.89783776
0 references
0.87607896
0 references
0.8675857
0 references
0.86728317
0 references
0.8595283
0 references
0.8517125
0 references
0.84771746
0 references
