| 摘要: |
| 提出了一种快速而鲁棒的点模型布尔运算算法.在进行布尔运算之前,首先将点模型中的每个点表示成具有一定半径的面元,并确定它相对于另一个模型表面的内、外及相交关系;然后对相交面元进行全局误差控制下的自适应加密重采样,以求取交线;为了加速面元的内、外及相交关系的检测,对每个模型建立层次结构k-d树.实验结果表明,该方法对于具有不同分辨率以及采样不均匀的点模型也能进行稳定可靠的布尔运算. |
| 关键词: 采样点模型 布尔运算 面元 k-d树 重采样 |
| DOI： |
| 分类号: |
| 基金项目:Supported by the National Grand Fundamental Research 973 Program of China under Grant No.2002CB312101 (国家重点基础研究发展计划(973)) |
|
| Boolean Operation for Point Sampled Models |
|
MIAO Lan-Fang,PENG Qun-Sheng
|
| Abstract: |
| A robust and efficient Boolean operation algorithm for point sampled models is presented in this paper. First, a surfel with a certain size of radius is reconstructed at each sample point on the models. And all of the surfels are classified into one of the following categories: in, out and intersect with respect to the other solid model. Then the intersection curves are estimated under the control of a given global error through adaptively subdividing and re-sampling of the intersect surfels. Besides, a hierarchical structure k-d tree is built for each point model to accelerate the test of efficient classifying the surfel’s in/out/intersect test. The experimental results show that this Boolean operation algorithm can robustly handle point models with different sampling resolution and non-uniform sampled point models. |
| Key words: point sampled model Boolean operation surfel k-d Tree re-sampling |
