A note on binary plane partitions

@inproceedings{Tth2001ANO,
  title={A note on binary plane partitions},
  author={Csaba D. T{\'o}th},
  booktitle={Symposium on Computational Geometry},
  year={2001}
}
This paper considers {\sl binary space partition}s (BSP for short) for $n$ 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 $\Omega (n \log n / \log \log n)$ in the worst case. The best known upper… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.
1 Citations
3 References
Similar Papers

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-3 of 3 references

Similar Papers

Loading similar papers…