摘要
为实现离散点模型的布尔运算,提出一种采用表面面元表示的点模型布尔运算算法。通过构造KD树实现了邻域的快速搜索,在此基础上,进行面元的内外相交测试提高了内外判别的准确性。布尔运算的结果采用面元方法进行快速绘制。实验表明,该算法运算简单快速,有效地进行点模型的布尔运算。
For realizing point models Boolean operations, a method of point models based on surfers is put forward. It can research quickly furthest border by using constructing KD tree. At the same time, surfers inside and outside estimation veracity is increased using processing surfers inside/outside/intersecting test. The boolean operations result is rendered quickly by splating method. And it has showed arithmetic simplicity and boolean operations efficiency.
出处
《计算机与数字工程》
2008年第6期38-40,共3页
Computer & Digital Engineering
基金
辽宁工程技术大学青年基金资助(编号:06-165)项目
关键词
点模型
布尔运算
点云
KD树
point models, boolean operations, point clouds, KD tree