Abstract
In this paper we prove the existence of binary space partitions (BSPs) with linear size for sets of axis-parallel boxes in three dimensional space under certain conditions that are often satisfied in practical situations. In particular, we give an O(n log n) time algorithm to construct a BSP tree with linear size for a set S of axis-parallel boxes where the ratio between the lengths of the longest and the shortest edges of boxes in S is bounded by a constant. The BSP tree constructed is balanced if S has a constant profile.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
