.png){kind=icon}
返回
Improved Binary Space Partition merging
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cad.2008.11.002.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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. (C) 2008 Elsevier Ltd. All rights reserved.
Keyword:
Constructive solid geometry
Binary space partition
Linear programming
Tree merging
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
3.1
论文数:
3.2K
被引数:
6.4K
机构
引用论文
.png){kind=icon}
查看更多内容