Abstract

In this paper we present a new BSP (Binary Space Partitioning (BSP) tree. BSP trees are one of the most successful space partitioning techniques, since they allow both object modeling and classification in one single structure. In this paper, we present a new framework designed for a multi-resolution modeling system that incorporates the BSP tree structure and dynamic levels of detail models. It has the advantages of both BSP and multi-resolution representations. The tree construction and traversal routines for the multi-resolution BSP tree are discussed in detail. Images and timing for our implementation are provided.

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 call

Disclaimer: 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.