摘要
通过在运动拼接网格预处理阶段采用求解两个具有拼接关系的相邻面的外接长方体的公共区域,缩小搜索范围,建立基于拼接区域网格的Kd树,区块经负载平衡区域分解后得到小区块,建立原拼接面与小区块拼接面的快速定位索引等方法减少操作时间,达到了提高并行求解运动拼接网格问题效率的目的。实验结果表明了上述方法有效可行。
To improve the efficiency of paralle solution to moving patched, a method is discussed.It includes reducing the research bound by getting the intersection region of two surfaces, building the Kd tree based on girds of patched surfaces, setting the index of smaller surfaces.Experiments＇results show that the above method can reduce computing-time.
出处
《计算机工程与设计》
CSCD
北大核心
2009年第23期5499-5502,共4页
Computer Engineering and Design
基金
国家863高技术研究发展计划基金项目(2006AA1149)
