检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]浙江师范大学数理信息学院,浙江金华321004 [2]广西大学计算机与电子信息学院,广西南宁530004
出 处:《计算机工程与设计》2011年第4期1363-1365,1444,共4页Computer Engineering and Design
基 金:国家自然科学基金项目(60963022);广西自然科学基金项目(桂科自0832056)
摘 要:为了避免网格重建过程而直接在三维点采样表面上进行纹理合成,研究了在点模型上的三维纹理合成的算法。利用KDtree这种数据结构在离散采样点上构建点与点的邻域关系,通过投影和建立匹配窗得到每一个待合成纹理的点与样图的映射关系,根据映射关系在样图中找出与待定点纹理值最佳匹配的点。最后将该匹配点的纹理值赋给待定点,同时结合邻域关系实现多点同时赋值。实验结果表明,该算法能有效地保持了生成的纹理结构和视觉效果的连续性和平滑性,具有耗时短、灵活可控、较好的鲁棒性等特点。To avoid grid reconstruction over point-based model and synthesize the sample texture to pointed set model directly,an al-gorithm of 3D texture synthesis based on point set model is researched.Firstly,the neighborhood relation among the discrete sampling points is built by KDtree.Then mapping relation between each point to be synthesized texture and the sample image is gotten by projecting and setting up the matching window.According to the mapping relation the best matching point with texture value is found in the input sample image.Finally,the value is assigned to the point to be synthesized and meanwhile multi-point synchronous assignment is achieved via the neighborhood relation.The experimental results show that the new technique can produce smooth texture synthesis as well as keeping the continuity and flatness of visual effects.In contrast with traditional 3D texture synthesis,this algorithm uses less time and is more flexible and more controllable and of robustness.
分 类 号:TP391[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.189.13.48