Multi-way Space Partitioning Trees
In this paper, we introduce a new data structure, the multi-way space partitioning (MSP) tree similar in nature to the standard binary space partitioning (BSP) tree. Unlike the super-linear space requirement for BSP trees, we show that for any set of disjoint line segments in the plane there exists a linear-size MSP tree completely partitioning the set. Since our structure is a deviation from the standard BSP tree construction, we also describe an application of our algorithm. We prove that the well-known Painter’s algorithm can be adapted quite easily to use our structure to run in O(n) time. More importantly, the constant factor behind our tree size is extremely small, having size less than 4n.
KeywordsLine Segment Computational Geometry Rooted Segment Convex Region Binary Space
Unable to display preview. Download preview PDF.
- 1.Agarwal, P., Murali, T., Vitter, J.: Practical techniques for constructing binary space partitions for orthogonal rectangles. In: Proc. of the 13th Symposium on Computational Geometry, June 4-6, pp. 382–384. ACM Press, New York (1997)Google Scholar
- 3.Airey, J.M.: Increasing Update Rates in the Building Walkthrough System with Automatic Model-Space Subdivision and Potentially Visible Set Calculations. PhD thesis, Dept. of CS, U. of North Carolina (July 1990) TR90-027 Google Scholar
- 4.Chin, N., Feiner, S.: Near real-time shadow generation using BSP trees. Computer Graphics (SIGGRAPH 1990 Proceedings) 24(4), 99–106 (1990)Google Scholar
- 6.de Berg, de Groot, Overmars: New results on binary space partitions in the plane. CGTA: Computational Geometry: Theory and Applications 8 (1997)Google Scholar
- 7.de Berg, M.: Linear size binary space partitions for fat objects. In: Spirakis, P.G. (ed.) ESA 1995. LNCS, vol. 979, pp. 252–263. Springer, Heidelberg (1995)Google Scholar
- 8.de Berg, M., de Groot, M.: Binary space partitions for sets of cubes. In: Abstracts 10th European Workshop Comput. Geom., pp. 84–88 (1994)Google Scholar
- 10.Dumitrescu, A., Mitchell, J.S.G., Sharir, M.: Binary space partitions for axis-parallel segments, rectangles, and hyperrectangles. In: Proceedings of the 17th annual symposium on Computational geometry, pp. 141–150. ACM Press, New York (2001)Google Scholar
- 11.Foley, J.D., van Dam, A., Feiner, S.K., Hughes, J.F.: Computer Graphics: Principles and Practice. Addison-Wesley, Reading (1990)Google Scholar
- 14.Naylor, B., Thibault, W.: Application of BSP trees to ray-tracing and CGS evaluation. Technical Report GIT-ICS 86/03, Georgia Institute of Tech., School of Information and Computer Science (February 1986) Google Scholar
- 17.Teller, S.J.: Visibility Computations in Densely Occluded Polyhedral Environments. PhD thesis, Dept. of Computer Science, University of California, Berkeley (1992) Google Scholar
- 21.Tóth, C.D.: Binary space partitions for line segments with a limited number of directions. In: Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms, pp. 465–471. ACM Press, New York (2002)Google Scholar