Improved Binary Space Partition merging
Document Type
Article
Publication Date
12-1-2008
Department
Department of Computer Science; Department of Mechanical Engineering-Engineering Mechanics
Abstract
This paper presents a new method for evaluating boolean set operations between Binary Space Partition (BSP) trees. Our algorithm has many desirable features, including both numerical robustness and O (n) output sensitive time complexity, while simultaneously admitting a straightforward implementation. To achieve these properties, we present two key algorithmic improvements. The first is a method for eliminating null regions within a BSP tree using linear programming. This replaces previous techniques based on polygon cutting and tree splitting. The second is an improved method for compressing BSP trees based on a similar approach within binary decision diagrams. The performance of the new method is analyzed both theoretically and experimentally. Given the importance of boolean set operations, our algorithms can be directly applied to many problems in graphics, CAD and computational geometry.
Publication Title
CAD Computer Aided Design
Recommended Citation
Lysenko, M.,
D'Souza, R.,
&
Shene, C.
(2008).
Improved Binary Space Partition merging.
CAD Computer Aided Design,
40(12), 1113-1120.
http://doi.org/10.1016/j.cad.2008.11.002
Retrieved from: https://digitalcommons.mtu.edu/michigantech-p/6070