论文信息 - A Note on Binary Plane Partitions

A Note on Binary Plane Partitions

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.

Csaba D. Tóth

[1] F. Frances Yao,et al. Efficient binary space partitions for hidden-surface removal and solid modeling , 1990, Discret. Comput. Geom..

[2] Mark de Berg,et al. New Results on Binary Space Partitions in the Plane , 1997, Comput. Geom..

[3] F. Frances Yao,et al. Optimal binary space partitions for orthogonal objects , 1990, SODA '90.

[4] T. M. Murali,et al. Binary Space Partitions for Fat Rectangles , 2000, SIAM J. Comput..

[5] R. Schmacher,et al. Study for Applying Computer-Generated Images to Visual Simulation: (510842009-001) , 1969 .